Some Bounds on the Size of Codes

IEEE Transactions on Information Theory - Tập 60 Số 3 - Trang 1475-1480 - 2014
Emanuele Bellini1, Eleonora Guerrini2, Massimiliano Sala1
1University of Trento, Trento, Italy
2University of Montpellier 2, Laboratory of Informatics, Robotics, and Microelectronics, Montpellier, France

Tóm tắt

Từ khóa


Tài liệu tham khảo

10.1109/TIT.1971.1054656

10.1016/S0019-9958(72)90376-2

levenshtein, 1998, Handbook of Coding Theory, 1, 499

10.1023/A:1008260505585

0, MAGMA Computational Algebra System for Algebra Number Theory and Geometry

pless, 1998, Handbook of Coding Theory

10.1109/TIT.1960.1057584

10.1016/S0019-9958(68)90874-7

10.1109/TIT.2005.851748

zinov'ev, 1984, On shortening of codes, Probl Peredachi Inf, 20, 3

10.1109/TIT.1983.1056675

brouwer, 2012, Table of General Ternary Codes

10.1147/rd.45.0532

delsarte, 1973, An algebraic approach to the association schemes of coding theory, Philips Res Rep Suppl

10.1017/CBO9780511807077

guerrini, 2009, Systematic codes and polynomial ideals

brouwer, 2012, Table of General Binary Codes

bassalygo, 1965, New upper bounds for error correcting codes, Probl Peredachi Inf, 1, 41

10.1109/TIT.1962.1057714