Optimal Linear Codes of Dimension 4 over GF(5)
نویسنده
چکیده
[48] __, " On complexity of trellis structure of linear block codes, " IEEE [49] T. Klgve, " Upperbounds on codes correcting asymmebic errors, " IEEE [SO] __, " Minimum support weights of binary codes, " IEEE Trans. Inform. [53] A. Lafourcade and A. Vardy, " Asymptotically good codes have infinite trellis comwlexitv. " IEEE Duns. issue on " Codes and Finite Geometries "). [59] __, " The shift bound for cyclic, Reed-Muller and geomeCric Goppa codes, " preprint. 1994. [65] P. Vamoose, " Code construction for the noiseless binary switching multiple access channel, " IEEE Trans.
منابع مشابه
Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3
Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...
متن کاملNew bounds for n4(k, d) and classification of some optimal codes over GF(4)
Let n4(k; d) be the minimum length of a linear [n; k; d] code over GF(4) for given values of k and d. For codes of dimension "ve, we compute the exact values of n4(5; d) for 75 previously open cases. Additionally, we show that n4(6; 14)=24, n4(7; 9)=18, and n4(7; 10)=20. Moreover, we classify optimal quaternary codes for some values of n and k. c © 2003 Elsevier B.V. All rights reserved.
متن کاملLinear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملNew linear codes over GF(8)1
Let [n, k, d]q-code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the most important problems in coding theory is to construct codes with best possible minimum distances. Recently, the class of quasi-cyclic (QC) codes has been proven to contain many such codes. In this paper, thirty two codes over GF (8) are constructed (among them one optimal code...
متن کاملNew minimum distance bounds for linear codes over GF(5)
Let [n; k; d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). In this paper, 32 new codes over GF(5) are constructed and the nonexistence of 51 codes is proved. c © 2003 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 43 شماره
صفحات -
تاریخ انتشار 1997