Construction of Some Optimal Ternary Linear Codes and the Uniqueness of [294, 6, 195; 3]-Codes Meeting the Griesmer Bound

N. Hamada;  Helleseth T.

doi:10.1006/ffta.1995.1036

Construction of Some Optimal Ternary Linear Codes and the Uniqueness of [294, 6, 195; 3]-Codes Meeting the Griesmer Bound

Finite Fields and Their Applications ◽

10.1006/ffta.1995.1036 ◽

1995 ◽

Vol 1 (4) ◽

pp. 458-468 ◽

Cited By ~ 1

Author(s):

N. Hamada ◽

Helleseth T.

Keyword(s):

Linear Codes ◽

Griesmer Bound ◽

Ternary Linear Codes

Download Full-text

On the minimum length of ternary linear codes

Designs Codes and Cryptography ◽

10.1007/s10623-011-9593-y ◽

2011 ◽

Vol 68 (1-3) ◽

pp. 407-425 ◽

Cited By ~ 1

Author(s):

Tatsuya Maruta ◽

Yusuke Oya

Keyword(s):

Linear Codes ◽

Minimum Length ◽

Ternary Linear Codes

Download Full-text

Nonexistence of linear codes meeting the Griesmer bound

Discrete Mathematics ◽

10.1016/j.disc.2021.112744 ◽

2022 ◽

Vol 345 (4) ◽

pp. 112744

Author(s):

Wen Ma ◽

Jinquan Luo

Keyword(s):

Linear Codes ◽

Griesmer Bound

Download Full-text

Nonexistence Proofs for Five Ternary Linear Codes

Journal of Mathematics and Its Applications ◽

10.29244/jmap.1.1.35-40 ◽

2002 ◽

Vol 1 (1) ◽

pp. 35

Author(s):

S. GURITMAN

Keyword(s):

Linear Code ◽

Minimum Distance ◽

Linear Codes ◽

Ternary Linear Codes

<p>An [n,k, dh-code is a ternary linear code with length n, dimension k and minimum distance d. We prove that codes with parameters [110,6, 72h, [109,6,71h, [237,6,157b, [69,7,43h, and [120,9,75h do not exist.</p>

Download Full-text

Linear codes close to the Griesmer bound and the related geometric structures

Designs Codes and Cryptography ◽

10.1007/s10623-018-0565-3 ◽

2018 ◽

Vol 87 (4) ◽

pp. 841-854

Author(s):

Assia Rousseva ◽

Ivan Landjev

Keyword(s):

Linear Codes ◽

Griesmer Bound ◽

Geometric Structures

Download Full-text

Five new optimal ternary linear codes

IEEE Transactions on Information Theory ◽

10.1109/18.272479 ◽

1994 ◽

Vol 40 (1) ◽

pp. 193 ◽

Cited By ~ 9

Author(s):

M. Van Eupen

Keyword(s):

Linear Codes ◽

Ternary Linear Codes

Download Full-text

Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes

Designs Codes and Cryptography ◽

10.1007/s10623-009-9298-7 ◽

2009 ◽

Vol 53 (2) ◽

pp. 119-136

Author(s):

Simeon Ball ◽

Szabolcs L. Fancsali

Keyword(s):

Linear Codes ◽

Projective Spaces ◽

Blocking Sets ◽

Griesmer Bound ◽

Finite Projective Spaces

Download Full-text

A class of optimal linear codes of length one above the Griesmer bound

Designs Codes and Cryptography ◽

10.1007/s10623-008-9239-x ◽

2008 ◽

Vol 51 (1) ◽

pp. 9-20 ◽

Cited By ~ 2

Author(s):

E. J. Cheon

Keyword(s):

Linear Codes ◽

Griesmer Bound ◽

Optimal Linear ◽

Optimal Linear Codes

Download Full-text

Some new ternary linear codes

Journal of Algebra Combinatorics Discrete Structures and Applications ◽

10.13069/jacodesmath.327360 ◽

2017 ◽

pp. 227-227

Author(s):

Rumen Daskalov ◽

Plamen Hristov

Keyword(s):

Linear Codes ◽

Ternary Linear Codes

Download Full-text

A new extension theorem for ternary linear codes and its application

Finite Fields and Their Applications ◽

10.1016/j.ffa.2020.101711 ◽

2020 ◽

Vol 67 ◽

pp. 101711

Author(s):

Hitoshi Kanda

Keyword(s):

Linear Codes ◽

Extension Theorem ◽

Ternary Linear Codes

Download Full-text

New optimal ternary linear codes

IEEE Transactions on Information Theory ◽

10.1109/18.391267 ◽

1995 ◽

Vol 41 (4) ◽

pp. 1182-1185 ◽

Cited By ~ 14

Author(s):

T.A. Gulliver

Keyword(s):

Linear Codes ◽

Ternary Linear Codes

Download Full-text