Optimal ternary linear codes-Reference-Cited by-同舟云学术

Optimal ternary linear codes

Published:1992-06 Issue:2 Volume:2 Page:137-157
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des Codes Crypt

Author:

Hill R.,Newton D. E.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/BF00124893.pdf

Reference20 articles.

1. Belov, B.I., Logachev, V.N., and Sandimirov, V.P. 1974. Construction of a class of linear binary codes achieving the Varshimov-Griesmer bound. Problems of Info. transmission 10 (3):211?217.

2. Dodunekov, S.M. 1984. Minimum block length of a linear q-ary code with specified dimension and code distance. Problems of Info. Trans. 20:239?249.

3. Dodunekov, S.M., Helleseth, T., Manev, N., and Ytrehus, ?. 1987. New bounds on binary linear codes of dimension eight. IEEE Trans. Info. Theory 33:917?919.

4. Farrell, P.G. 1970. Linear binary anticodes. Electronics Letters 6:419?421.

5. Games, R.A. 1983. The packing problem for projective geometries over GF(3) with dimension greater than 5 J. Comb. Theory, Series A, 35:126?144.

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

1. Large (k,3)-arcs in PG(2,19) and the related linear codes;Journal of Kufa for Mathematics and Computer;2024-03-30

2. On construction of ternary optimal self-orthogonal codes;Computational and Applied Mathematics;2024-03-28

3. On Building Self-Complementary Codes and Their Application in Information Hiding;Automatic Control and Computer Sciences;2023-12

4. On the Construction of Self-Complementary Codes and their Application in the Problem of Information Hiding;Modeling and Analysis of Information Systems;2022-09-25

5. Nonexistence of some ternary linear codes with minimum weight -2 modulo 9;Advances in Mathematics of Communications;2021