Coprimitive sets and inextendable codes
- 作者T. L. Alderson; A. A. Bruen
- 卷第47卷
- 印刷ISSN0925-1022
- 电子ISSN1573-7586
- 文件大小188.67KB
- 发表时间2008-06
- DOI10.1007/s10623-007-9079-0
- 页码113-124
同期刊推荐
Hermitian varieties as codewordsJ. D. Key · Designs, Codes and Cryptography · 1991
EditorialDesigns, Codes and Cryptography · 1991
Covering radius and dual distanceA. Tietäväinen · Designs, Codes and Cryptography · 1991
Four pairwise balanced designsE. R. Lamken; W. H. Mills; R. M. Wilson · Designs, Codes and Cryptography · 1991
On quasi-symmetric designsBhaskar Bagchi · Designs, Codes and Cryptography · 1992
Authentication and authenticated key exchangesWhitfield Diffie; Paul C. Oorschot; Michael J. Wiener · Designs, Codes and Cryptography · 1992
Optimal ternary linear codesR. Hill; D. E. Newton · Designs, Codes and Cryptography · 1992
Combinatorial characterizations of authentication codesD. R. Stinson · Designs, Codes and Cryptography · 1992