On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound

Leonid A. Bassalygo, Stefan M. Dodunekov, Tor Helleseth, Victor A. Zinoviev. On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound. In Gadiel Seroussi, Alfredo Viola, editors, 2006 IEEE Information Theory Workshop, ITW 2006, Punta del Este, Uruguay, March 13-17, 2006. pages 278-282, IEEE, 2006. [doi]

@inproceedings{BassalygoDHZ06,
  title = {On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound},
  author = {Leonid A. Bassalygo and Stefan M. Dodunekov and Tor Helleseth and Victor A. Zinoviev},
  year = {2006},
  doi = {10.1109/ITW.2006.1633829},
  url = {https://doi.org/10.1109/ITW.2006.1633829},
  researchr = {https://researchr.org/publication/BassalygoDHZ06},
  cites = {0},
  citedby = {0},
  pages = {278-282},
  booktitle = {2006 IEEE Information Theory Workshop, ITW 2006, Punta del Este, Uruguay, March 13-17, 2006},
  editor = {Gadiel Seroussi and Alfredo Viola},
  publisher = {IEEE},
  isbn = {1-4244-0036-8},
}