Optimal permutation anticodes with the infinity norm via permanents of (0,1)-matrices

Journal of Combinatorial Theory. Series A

Volumn 118, Issue 6, 2011, Pages 1761-1774

  Schwartz, Moshe ^a   Tamo, Itzhak ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Infinity norm; Optimal anticode; Permanent; Permutations

Indexed keywords

EID: 79952323821     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2011.02.008     Document Type: Article

References (29)

1. Ahlswede R., Aydinian H.K., Khachatrian L.H. On perfect codes and related concepts. Des. Codes Cryptogr. 2001, 22(3):221-237.
2. Ahlswede R., Khachatrian L.H. The diametric theorem in Hamming spaces-optimal anticodes. Adv. in Appl. Math. 1998, 20:429-449.
3. Alon N., Spencer J. The Probabilistic Method 2000, John Wiley & Sons, Inc. 2nd edition.
4. Bailey R.F. Error-correcting codes from permutation groups. Discrete Math. 2009, 309(13):4253-4265.
5. Barg A., Mazumdar A. Codes in permutations and error correction for rank modulation. IEEE Trans. Inform. Theory 2010, 56(7):3158-3165.
6. Brégman L.M. Some properties of nonnegative matrices and their permanents. Soviet Math. Dokl. 1973, 14:945-949.
7. Chadwick H.D., Kurz L. Rank permutation group codes based on Kendall's correlation statistic. IEEE Trans. Inform. Theory 1969, 15(2):306-315.
8. Chu W., Colbourn C.J., Dukes P. Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 2004, 32(1-3):51-64.
9. Delsarte P. An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 1973, 10:1-97.
10. Deza M., Huang H. Metrics on permutations, a survey. J. Comb. Inf. Syst. Sci. 1998, 23:173-185.
11. Frankl P., Deza M. On the maximum number of permutations with given maximal or minimal distance. J. Combin. Theory Ser. A 1977, 22:352-360.
12. Erdos P., Ko C., Rado R. Intersection theorems for systems of finite sets. Q. J. Math. 1961, 12:313-320.
13. Etzion T., Schwartz M., Vardy A. Optimal tristance anticodes in certain graphs. J. Combin. Theory Ser. A 2005, 113(2):189-224.
14. Farrell P.G. Linear binary anticodes. Electron. Lett. 1970, 6:419-421.
15. Frankl P., Wilson R.M. The Erdös-Ko-Rado theorem for vector spaces. J. Combin. Theory Ser. A 1986, 43:228-236.
16. Fu F.-W., Kløve T. Two constructions of permutation arrays. IEEE Trans. Inform. Theory 2004, 50(5):881-883.
17. Jiang A., Schwartz M., Bruck J. Correcting charge-constrained errors in the rank-modulation scheme. IEEE Trans. Inform. Theory 2010, 56(5):2112-2120.
18. Kløve T. Generating functions for the number of permutations with limited displacement. Electron. J. Combin. 2009, 16:1-11.
19. Kløve T., Lin T.-T., Tsai S.-C., Tzeng W.-G. Permutation arrays under the Chebyshev distance. IEEE Trans. Inform. Theory 2010, 56(6):2611-2617.
20. T.-T. Lin, S.-C. Tsai, W.-G. Tzeng, Efficient encoding and decoding with permutation arrays, in: Proceedings of the 2008 IEEE International Symposium on Information Theory (ISIT2008), Toronto, Canada, 2008, pp. 211-214.
21. MacWilliams F.J., Sloane N.J.A. The Theory of Error-Correcting Codes 1978, North-Holland.
22. Martin W.J., Zhu X.J. Anticodes for the Grassman and bilinear forms graphs. Des. Codes Cryptogr. 1995, 6(1):73-79.
23. Minc H. Permanents. Encyclopedia Math. Appl. 1978, vol. 6. Cambridge University Press.
24. Schwartz M. Efficiently computing the permanent and hafnian of some banded toeplitz matrices. Linear Algebra Appl. 2009, 430(4):1364-1374.
25. Schwartz M., Etzion T. Codes and anticodes in the Grassman graph. J. Combin. Theory Ser. A 2002, 97(1):27-42.
26. Solomon G., Stiffler I.I. Algebraically punctured cyclic codes. Inform. Control 1965, 8(2):170-179.
27. Tamo I., Schwartz M. Correcting limited-magnitude errors in the rank-modulation scheme. IEEE Trans. Inform. Theory 2010, 56(6):2551-2560.
28. H. Vinck, J. Haering, T. Wadayama, Coded M-FSK for power line communications, in: Proceedings of the 2000 IEEE International Symposium on Information Theory (ISIT2000), Sorrento, Italy, 2000, p. 137.
29. Wanless I.M. Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum. Discrete Math. 1999, 205:191-205.