The smallest length of binary 7–dimensional linear codes with prescribed minimum distance-Reference-Cited by-同舟云学术

The smallest length of binary 7–dimensional linear codes with prescribed minimum distance

Published:1981 Issue:2 Volume:33 Page:197-207
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Henk C.A. van Tilborg

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference14 articles.

1. Binary codes with improved minimum weights;Alltop;IEEE Trans. Inform. Theory,1976

2. A note on the Griesmer bound;Baumert;IEEE Trans. Inform. Theory.,1973

3. A conjecture on the Griesner bound, Optimization methods and their applications (All-Union Summer Sem. Khakusy, Lake Baikal 1972) (Russian);Belov,1974

4. Computer results on the minimum distance of some binary cyclic codes;Chen;IEEE Trans. Inform. Theory,1970

5. An introduction to anticodes;Farrell;CISM Summer School: Algebraic coding theory and applications,1978

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

1. On the nonexistence of ternary linear codes attaining the Griesmer bound;Designs, Codes and Cryptography;2022-02-23

2. The $[46, 9, 20]_2$ code is unique;Advances in Mathematics of Communications;2021

3. Connecting and Improving Direct Sum Masking and Inner Product Masking;Smart Card Research and Advanced Applications;2018

4. New Upper Bounds on Binary Linear Codes and a $ {\mathbb Z}_{4}$ -Code With a Better-Than-Linear Gray Image;IEEE Transactions on Information Theory;2016-12

5. Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3;IRAN J MATH SCI INFO;2015