Extending permutation arrays: improving MOLS bounds-Reference-Cited by-同舟云学术

Extending permutation arrays: improving MOLS bounds

Published:2016-08-03 Issue:3 Volume:83 Page:661-683
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des. Codes Cryptogr.

Author:

Bereg Sergey,Morales Linda,Sudborough I. Hal

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10623-016-0263-y.pdf

Reference21 articles.

1. Bereg S., Morales L., Sudborough I.: Table of lower bounds for $$M(n,n-1)$$ M ( n , n - 1 ) . http://www.utdallas.edu/~sxb027100/soft/permutation-arrays/n-1/ (2016).

2. Bereg S., Morales L., Sudborough I.: PAs exhibiting results from partition and extension. http://www.utdallas.edu/~sxb027100/soft/permutation-arrays/n-1/data.zip (2016).

3. Beth T.: Eine Bemerkung zur Abschätzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren. Abh. Math. Sem. Hamburg. 53, 284–288 (1983).

4. Chu W., Colbourn C.J., Dukes P.: Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 32, 51–64 (2004).

5. Colbourn C.J., Dinitz J.H.: Handbook of Combinatorial Designs, 2nd edn. Chapman and Hall/CRC, New York (2006).

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multiple contractions of permutation arrays;Journal of Algebraic Combinatorics;2023-06-14

2. Using permutation rational functions to obtain permutation arrays with large hamming distance;Designs, Codes and Cryptography;2022-06-20

3. Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions;Arithmetic of Finite Fields;2021

4. Constructing permutation arrays using partition and extension;Designs, Codes and Cryptography;2019-10-13

5. A lower bound on permutation codes of distance $$n-1$$;Designs, Codes and Cryptography;2019-08-20