Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Ward (1998)
Divisibility of Codes Meeting the Griesmer BoundJ. Comb. Theory, Ser. A, 83
Keith Conrad (2018)
Finite FieldsSeries and Products in the Development of Mathematics
(1988)
Some New Results for Optimal Ternary Linear Codes , IEEE Trans
N. Hamada, T. Helleseth, H. Martinsen, Øyvind Ytrehus (2000)
There is no ternary [28, 6, 16] codeIEEE Trans. Inf. Theory, 46
N. Hamada, Yoko Watamori (1996)
The nonexistence of [71,5,46;3]-codesJournal of Statistical Planning and Inference, 52
N. Hamada (1999)
The Nonexistence of Quaternary Linear Codes With Parameters [243, 5, 181], [248, 5, 185] and [240, 5, 179]Ars Comb., 51
A. Brouwer, M. Eupen (1997)
The Correspondence Between Projective Codes and 2-weight CodesDesigns, Codes and Cryptography, 11
M. Eupen (1995)
Some new results for ternary linear codes of dimension 5 and 6IEEE Trans. Inf. Theory, 41
N. Hamada, T. Helleseth (2000)
The Nonexistence of Some Ternary Linear Codes and Update of the Bounds for n3(6; d), 1 ≤ d ≤ 243Math. Japon., 52
M. Eupen, R. Hill (1994)
An optimal ternary [69, 5, 45] code and related codesDesigns, Codes and Cryptography, 4
M. Eupen (1994)
Four non-existence results for ternary linear codesProceedings of 1994 IEEE International Symposium on Information Theory
M. van Eupen (1995)
Four Non-existence Results for Ternary Linear Codes, IEEE TransInf. Theory, 41
F. MacWilliams, N. Sloane (1977)
The Theory of Error-Correcting Codes
N. Hamada, M. Eupen (1998)
The Nonexistence of Ternary [38, 6, 23] CodesDesigns, Codes and Cryptography, 13
N. Hamada, Y. Watamori (1996)
The Nonexistence of Some Ternary Linear Codes of Dimension 6 and the Bounds for n3(6; d), 1 ≤ d ≤ 243Math. Japon., 43
N. Hamada, T. Helleseth (2002)
The nonexistence of ternary [97,6,63] codesJournal of Statistical Planning and Inference, 106
R. Hill, D. Newton (1992)
Optimal ternary linear codesDesigns, Codes and Cryptography, 2
M. Eupen, P. Lisoněk (1997)
Classification of Some Optimal Ternary Linear Codes of Small LengthDesigns, Codes and Cryptography, 10
(1994)
New Linear Codes of Dimension 5 over GF
G. Solomon, J. Stiffler (1965)
Algebraically Punctured Cyclic CodesInf. Control., 8
T. Maruta (2004)
The nonexistence of some ternary linear codes of dimension 6Discret. Math., 288
(1996)
The Non-existence of Ternary Linear [158
C. Jones (2000)
PhD Thesis
J. Griesmer (1960)
A Bound for Error-Correcting CodesIBM J. Res. Dev., 4
N. Hamada (1997)
THE NONEXISTENCE OF TERNARY [29, 6, 17] CODESMathematica japonicae, 46
(1995)
Some New Results for Ternary Linear Codes of Dimension 5 and 6 , IEEE Trans
(1993)
Bounds on the Minimum Length for Ternary Linear Codes of Dimension Six, in Mathematics and Education in Mathematics, Sofia
N. Hamada, T. Helleseth (1996)
The uniqueness of [87,5,57; 3]-codes and the nonexistence of [258,6,171; 3]-codesJournal of Statistical Planning and Inference, 56
M. Eupen (1994)
Five new optimal ternary linear codesIEEE Trans. Inf. Theory, 40
I. Bouyukliev (1997)
Some New Optimal Ternary Linear CodesDesigns, Codes and Cryptography, 12
I. Landjev (1998)
The Nonexistence of Some Optimal Ternary Codes of Dimension FiveDesigns, Codes and Cryptography, 15
N. Hamada, Yoko Watamori (1998)
The nonexistence of ternary [79,6,51] codesJournal of Statistical Planning and Inference, 72
R. Hill (1988)
Some optimal ternary linear codesArs Combinatoria, 25
(1984)
Minimum Block Length of a Linear q-ary Code with Specified Dimension and Code Distance, Probl
N. Hamada (1993)
A survey of recent work on characterization of minihypers in PG (t, q) and nonbinary linear codes meeting the Griesmer bound, 18
N. Hamada, T. Helleseth (2000)
THE NONEXISTENCE OF SOME TERNARY LINEAR CODES AND UPDATE OF THE BOUNDS FOR n_3 (6, d), 1【less than or equal】d【less than or equal】243Mathematica japonicae, 52
I. Bouyukliev, J. Simonis (2002)
Some new results for optimal ternary linear codesIEEE Trans. Inf. Theory, 48
Christopher Jones (1999)
Optimal ternary linear codes.
M. Eupen, N. Hamada, Yoko Watamori (1996)
The Nonexistence of Ternary [50,5,32] CodesDesigns, Codes and Cryptography, 7
Let [n, k, d] q codes be linear codes of length n, dimension k, and minimum Hamming distance d over GF(q). Let n q (k, d) be the smallest value of n for which there exists an [n, k, d] q code. It is known from [1, 2] that 284 ≤ n 3(6, 188) ≤ 285 and 285 ≤ n 3(6, 189) ≤ 286. In this paper, the nonexistence of [284, 6, 188]3 codes is proved, whence we get n 3(6, 188) = 285 and n 3(6, 189) = 286.
Problems of Information Transmission – Springer Journals
Published: Dec 16, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.