var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fdblp.org%2Fpid%2F51%2F8860.bib&jsonp=1&noBootstrap=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fdblp.org%2Fpid%2F51%2F8860.bib&jsonp=1&noBootstrap=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fdblp.org%2Fpid%2F51%2F8860.bib&jsonp=1&noBootstrap=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2012\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An Efficient Algorithm for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes.\n \n \n \n \n\n\n \n García-Villalba, L. J.; Cortez, J. R. F.; Orozco, A. L. S.; and Blaum, M.\n\n\n \n\n\n\n IEEE Commun. Lett., 16(1): 89–91. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/icl/Garcia-VillalbaCOB12,\n  author       = {Luis Javier Garc{\\'{\\i}}a{-}Villalba and\n                  Jos{\\'{e}} Ren{\\'{e}} Fuentes Cortez and\n                  Ana Lucila Sandoval Orozco and\n                  Mario Blaum},\n  title        = {An Efficient Algorithm for Searching Optimal Shortened Cyclic Single-Burst-Correcting\n                  Codes},\n  journal      = {{IEEE} Commun. Lett.},\n  volume       = {16},\n  number       = {1},\n  pages        = {89--91},\n  year         = {2012},\n  url          = {https://doi.org/10.1109/LCOMM.2011.111011.112186},\n  doi          = {10.1109/LCOMM.2011.111011.112186},\n  timestamp    = {Thu, 20 Aug 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/icl/Garcia-VillalbaCOB12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2011\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Efficient Shortened Cyclic Codes Correcting Either Random Errors or Bursts.\n \n \n \n \n\n\n \n García-Villalba, L. J.; Cortez, J. R. F.; Orozco, A. L. S.; and Blaum, M.\n\n\n \n\n\n\n IEEE Commun. Lett., 15(7): 749–751. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"EfficientPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/icl/Garcia-VillalbaCOB11,\n  author       = {Luis Javier Garc{\\'{\\i}}a{-}Villalba and\n                  Jos{\\'{e}} Ren{\\'{e}} Fuentes Cortez and\n                  Ana Lucila Sandoval Orozco and\n                  Mario Blaum},\n  title        = {Efficient Shortened Cyclic Codes Correcting Either Random Errors or\n                  Bursts},\n  journal      = {{IEEE} Commun. Lett.},\n  volume       = {15},\n  number       = {7},\n  pages        = {749--751},\n  year         = {2011},\n  url          = {https://doi.org/10.1109/LCOMM.2011.060111.110338},\n  doi          = {10.1109/LCOMM.2011.060111.110338},\n  timestamp    = {Thu, 20 Aug 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/icl/Garcia-VillalbaCOB11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Extension Proposal of D2HCP for Network Merging.\n \n \n \n \n\n\n \n García-Villalba, L. J.; Matesanz, J. G.; Orozco, A. L. S.; and Cortez, J. R. F.\n\n\n \n\n\n\n J. Ubiquitous Syst. Pervasive Networks, 3(1): 35–40. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/juspn/Garcia-VillalbaMOC11,\n  author       = {Luis Javier Garc{\\'{\\i}}a{-}Villalba and\n                  Juli{\\'{a}}n Garc{\\'{\\i}}a Matesanz and\n                  Ana Lucila Sandoval Orozco and\n                  Jos{\\'{e}} Ren{\\'{e}} Fuentes Cortez},\n  title        = {An Extension Proposal of {D2HCP} for Network Merging},\n  journal      = {J. Ubiquitous Syst. Pervasive Networks},\n  volume       = {3},\n  number       = {1},\n  pages        = {35--40},\n  year         = {2011},\n  url          = {https://doi.org/10.5383/JUSPN.03.01.007},\n  doi          = {10.5383/JUSPN.03.01.007},\n  timestamp    = {Tue, 11 Jul 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/juspn/Garcia-VillalbaMOC11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Use of Gray codes for optimizing the search of (shortened) cyclic single burst-correcting codes.\n \n \n \n \n\n\n \n García-Villalba, L. J.; Cortez, J. R. F.; Orozco, A. L. S.; and Blaum, M.\n\n\n \n\n\n\n In Kuleshov, A.; Blinovsky, V. M.; and Ephremides, A., editor(s), 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011, pages 1186–1189, 2011. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"UsePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/isit/Garcia-VillalbaCOB11,\n  author       = {L. Javier Garc{\\'{\\i}}a{-}Villalba and\n                  Jos{\\'{e}} Ren{\\'{e}} Fuentes Cortez and\n                  Ana Lucila Sandoval Orozco and\n                  Mario Blaum},\n  editor       = {Alexander Kuleshov and\n                  Vladimir M. Blinovsky and\n                  Anthony Ephremides},\n  title        = {Use of Gray codes for optimizing the search of (shortened) cyclic\n                  single burst-correcting codes},\n  booktitle    = {2011 {IEEE} International Symposium on Information Theory Proceedings,\n                  {ISIT} 2011, St. Petersburg, Russia, July 31 - August 5, 2011},\n  pages        = {1186--1189},\n  publisher    = {{IEEE}},\n  year         = {2011},\n  url          = {https://doi.org/10.1109/ISIT.2011.6033720},\n  doi          = {10.1109/ISIT.2011.6033720},\n  timestamp    = {Wed, 16 Oct 2019 14:14:48 +0200},\n  biburl       = {https://dblp.org/rec/conf/isit/Garcia-VillalbaCOB11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficient Algorithms for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes.\n \n \n \n \n\n\n \n García-Villalba, L. J.; Cortez, J. R. F.; Orozco, A. L. S.; and Blaum, M.\n\n\n \n\n\n\n CoRR, abs/1101.5411. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"EfficientPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1101-5411,\n  author       = {Luis Javier Garc{\\'{\\i}}a{-}Villalba and\n                  Jos{\\'{e}} Ren{\\'{e}} Fuentes Cortez and\n                  Ana Lucila Sandoval Orozco and\n                  Mario Blaum},\n  title        = {Efficient Algorithms for Searching Optimal Shortened Cyclic Single-Burst-Correcting\n                  Codes},\n  journal      = {CoRR},\n  volume       = {abs/1101.5411},\n  year         = {2011},\n  url          = {http://arxiv.org/abs/1101.5411},\n  eprinttype    = {arXiv},\n  eprint       = {1101.5411},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1101-5411.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On the efficiency of shortened cyclic single-burst-correcting codes.\n \n \n \n \n\n\n \n García-Villalba, L. J.; Cortez, J. R. F.; and Blaum, M.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 56(7): 3290–3296. 2010.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/tit/Garcia-VillalbaCB10,\n  author       = {Luis Javier Garc{\\'{\\i}}a{-}Villalba and\n                  Jos{\\'{e}} Ren{\\'{e}} Fuentes Cortez and\n                  Mario Blaum},\n  title        = {On the efficiency of shortened cyclic single-burst-correcting codes},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {56},\n  number       = {7},\n  pages        = {3290--3296},\n  year         = {2010},\n  url          = {https://doi.org/10.1109/TIT.2010.2048454},\n  doi          = {10.1109/TIT.2010.2048454},\n  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tit/Garcia-VillalbaCB10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);