Extendability of linear codes over Fq
نویسنده
چکیده
For an [n, k, d]q code C, we define a mapping wC from PG(k − 1, q) to the set of weights of C via a generator matrix of C. We give a geometric aspect derived from wC to investigate the extendability of linear codes. We survey known extension theorems and some recent results.
منابع مشابه
Fq-Linear Cyclic Codes over Fq: DFT Characterization
Codes over Fqm that form vector spaces over Fq are called Fq-linear codes over Fqm . Among these we consider only cyclic codes and call them Fq-linear cyclic codes (FqLC codes) over Fqm . This class of codes includes as special cases (i) group cyclic codes over elementary abelian groups (q = p, a prime), (ii) subspace subcodes of Reed-Solomon codes and (iii) linear cyclic codes over Fq (m=1). T...
متن کاملLinear codes over Fq which are equivalent to LCD codes
Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual are trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault injection attacks. Non-binary LCD codes in characteristic 2 can be transformed into binary LCD codes by expansion. In this paper, we introduce a general constr...
متن کاملLinear Codes over $\mathbb{F}_{q}[x]/(x^2)$ and $GR(p^2,m)$ Reaching the Griesmer Bound
We construct two series of linear codes over finite ring Fq[x]/(x) and Galois ring GR(p2,m) respectively reaching the Griesmer bound. They derive two series of codes over finite field Fq by Gray map. The first series of codes over Fq derived from Fq[x]/(x) are linear and also reach the Griesmer bound in some cases. Many of linear codes over finite field we constructed have two Hamming (non-zero...
متن کاملSome improvements to the extendability of ternary linear codes
For a ternary [n, k, d] code C with d ≡ 1 or 2 (mod 3), k 3, the diversity (Φ0,Φ1) given by Φ0 = 1 2 ∑ 3|i, i =0 Ai, Φ1 = 1 2 ∑ i ≡0, d (mod 3) Ai is important to know about the extendability of C, where Ai stands for the number of codewords with weight i. As a continuation of [T. Maruta, Extendability of ternary linear codes, Des. Codes Cryptogr. 35 (2005) 175–190], we prove all the conjecture...
متن کاملNecessary and Sufficient Conditions for the Extendability of Ternary Linear Codes
We give the necessary and sufficient conditions for the extendability of ternary linear codes of dimension k ≥ 5 with minimum distance d ≡ 1 or 2 (mod 3) from a geometrical point of view.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008