56 citations to 10.1016/0378-3758(78)90008-3 (Crossref Cited-By Service)
  1. Fei Gao, Yiting Yang, Gennian Ge, “An Improvement on the Gilbert–Varshamov Bound for Permutation Codes”, IEEE Trans. Inform. Theory, 59, № 5, 2013, 3059  crossref
  2. Roberto Montemanni, Janos Barta, Derek H. Smith, 2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI), 2015, 298  crossref
  3. R. Sobhani, A. Abdollahi, J. Bagherian, M. Khatami, “A note on good permutation codes from Reed–Solomon codes”, Des. Codes Cryptogr., 87, № 10, 2019, 2335  crossref
  4. Andrzej K. Brodzik, Richard Tolimieri, “Bat Chirps With Good Properties: Zak Space Construction of Perfect Polyphase Sequences”, IEEE Trans. Inform. Theory, 55, № 4, 2009, 1804  crossref
  5. Carmen Amarra, Dom Vito A. Briones, Manuel Joseph C. Loquias, “Multiple contractions of permutation arrays”, J Algebr Comb, 58, № 3, 2023, 695  crossref
  6. Ian Blake, Alfred Menezes, Doug Stinson, “Guest Editorial: Special Issue in Honor of Scott A. Vanstone”, Des. Codes Cryptogr., 77, № 2-3, 2015, 287  crossref
  7. Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Hal Sudborough, 2017 51st Annual Conference on Information Sciences and Systems (CISS), 2017, 1  crossref
  8. Cunsheng Ding, Fang-Wei Fu, T. Klove, V.K.-W. Wei, “Constructions of permutation arrays”, IEEE Trans. Inform. Theory, 48, № 4, 2002, 977  crossref
  9. C. Ding, J. Yin, “Combinatorial Constructions of Optimal Constant-Composition Codes”, IEEE Trans. Inform. Theory, 51, № 10, 2005, 3671  crossref
  10. Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, I. H. Sudborough, “New lower bounds for permutation arrays using contraction”, Des. Codes Cryptogr., 87, № 9, 2019, 2105  crossref
Предыдущая
1
2
3
4
5
6
Следующая