Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes. Karpinski, M. & Nekrich, Y. Parallel Process. Lett., 16(1):81-92, 2006.
Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes. [link]Link  Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes. [link]Paper  bibtex   
@article{journals/ppl/KarpinskiN06,
  added-at = {2020-03-24T00:00:00.000+0100},
  author = {Karpinski, Marek and Nekrich, Yakov},
  biburl = {https://www.bibsonomy.org/bibtex/25b7aba8980ca71b6fc7835e960310063/dblp},
  ee = {https://doi.org/10.1142/S0129626406002484},
  interhash = {445ebbb5873370503573145bde154c4c},
  intrahash = {5b7aba8980ca71b6fc7835e960310063},
  journal = {Parallel Process. Lett.},
  keywords = {dblp},
  number = 1,
  pages = {81-92},
  timestamp = {2020-03-25T11:39:36.000+0100},
  title = {Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes.},
  url = {http://dblp.uni-trier.de/db/journals/ppl/ppl16.html#KarpinskiN06},
  volume = 16,
  year = 2006
}

Downloads: 0