On the minimum length of some linear codes-Reference-Cited by-同舟云学术

On the minimum length of some linear codes

Published:2007-05-02 Issue:2-3 Volume:43 Page:123-135
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des Codes Crypt

Author:

Cheon E. J.,Maruta T.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10623-007-9070-9.pdf

Reference12 articles.

1. Brouwer AE Bounds on the minimum distance of linear codes. Eindhoven University of Technology, the Netherlands, available on line: http://www.win.tue.nl/~aeb/voorlincod.html

2. Cheon EJ (2007). On the upper bound of the minimum length of 5-dimensional linear codes. Aust J Combin 37: 225–232

3. Cheon EJ, Kato T and Kim SJ (2005). On the minimum length of some linear codes of dimension 5. Des Codes Cryptogr 37: 421–434

4. Govaerts P and Storme L (2003). On a particular class of minihypers and its applications I. The result for general q. Des Codes Cryptogr 28: 51–63

5. Hamada N (1993). A characterization of some [n, k, d; q] codes meeting the Griesemer bound using a minihyper in a finite projective geometry. Discrete Math 116: 229–268

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

1. Nonexistence of linear codes meeting the Griesmer bound;Discrete Mathematics;2022-04

2. Nonexistence of some Griesmer codes over Fq;Discrete Mathematics;2016-02

3. On the geometric constructions of optimal linear codes;Designs, Codes and Cryptography;2016-01-04

4. The non-existence of Griesmer codes with parameters close to codes of Belov type;Designs, Codes and Cryptography;2010-11-02

5. Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes;Designs, Codes and Cryptography;2009-05-18