Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels

Daniel Cullina, Negar Kiyavash. Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels. IEEE Transactions on Information Theory, 62(8):4454-4465, 2016. [doi]

@article{CullinaK16-0,
  title = {Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels},
  author = {Daniel Cullina and Negar Kiyavash},
  year = {2016},
  doi = {10.1109/TIT.2016.2565578},
  url = {http://dx.doi.org/10.1109/TIT.2016.2565578},
  researchr = {https://researchr.org/publication/CullinaK16-0},
  cites = {0},
  citedby = {0},
  journal = {IEEE Transactions on Information Theory},
  volume = {62},
  number = {8},
  pages = {4454-4465},
}