3 research outputs found
Construction of Cyclic and Constacyclic Codes for b-symbol Read Channels Meeting the Plotkin-like Bound
The symbol-pair codes over finite fields have been raised for symbol-pair
read channels and motivated by application of high-density data storage
technologies [1, 2]. Their generalization is the code for b-symbol read
channels (b > 2). Many MDS codes for b-symbol read channels have been
constructed which meet the Singleton-like bound ([3, 4, 10] for b = 2 and [11]
for b > 2). In this paper we show the Plotkin-like bound and present a
construction on irreducible cyclic codes and constacyclic codes meeting the
Plotkin-like bound
Generalized Pair Weights of Linear Codes and Linear Isomorphisms Preserving Pair Weights
In this paper, we first introduce the notion of generalized pair weights of
an -linear code over the finite field and the notion of
pair -equiweight codes, where . Some basic properties of
generalized pair weights of linear codes over finite fields are derived. Then
we obtain a necessary and sufficient condition for an -linear code to be
a pair equiweight code, and we characterize pair -equiweight codes for any
. Finally, a necessary and sufficient condition for a linear
isomorphism preserving pair weights between two linear codes is obtained
Generalized -weights and -MDS Codes
In this paper, we first introduce the notion of generalized -weights of
-linear codes over finite fields, and obtain some basic properties and
bounds of generalized -weights of linear codes which is called Singleton
bound for generalized -weights in this paper. Then we obtain a necessary and
sufficient condition for an -linear code to be a -MDS code by using
generator matrixes of this linear code and parity check matrixes of this linear
code respectively. Next a theorem of a necessary and sufficient condition for a
linear isomorphism preserving -weights between two linear codes is obtained,
in particular when , this theorem is the MacWilliams extension theorem.
Then we give a reduction theorem for the MDS conjecture. Finally, we calculate
the generalized -weight matrix when is simplex codes or two
especial Hamming codes