Uniform constant composition codes derived from repeated‐root cyclic codes
Electronics Letters, 2018 Uniform constant composition (UCC) codes are introduced, which are p ‐ary constant composition codes with block length mp where each p ‐ary symbol appears exactly m times in
V.C. da Rocha +2 more
openaire +3 more sources
Repeated-root cyclic and negacyclic codes over a finite chain ring [PDF]
Discrete Applied Mathematics, 2006 We show that repeated-root cyclic codes over a finite chain ring are in general not principally generated. Repeated-root negacyclic codes are principally generated if the ring is a Galois ring with characteristic a power of 2.
Ana Salagean (1257498)
core +2 more sources
Applicable Algebra in Engineering, Communication and Computing, 2023 There are various metrics for researching error-correcting codes. Especially, high-density data storage system gives the existence of inconsistency for the reading and writing process. The symbol-pair metric is motivated for outputs that have overlapping pairs of symbols in a certain channel.
Boran Kim
openalex +4 more sources
Matrix-product structure of repeated-root cyclic codes over finite fields
Finite Fields and Their Applications, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reza Sobhani
openaire +3 more sources
Correction: Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes [PDF]
Applicable Algebra in Engineering, Communication and Computing, 2023 Boran Kim
openalex +2 more sources
Unique Generators for Cyclic Codes of Arbitrary Length over Fpmu/u3 and Their Applications
Journal of Mathematics, 2022 Cyclic codes play a very important role in the history of coding theory since they have good algebraic structures that can be widely used in coding and decoding.
Hongju Li +3 more
doaj +1 more source
On a Family of Quantum Synchronizable Codes Based on the
IEEE Access, 2020 In this paper, we propose a family of quantum synchronizable codes from repeated-root cyclic codes and constacyclic codes. This family of quantum synchronizable codes are based on (λ(u + v)|u - v) construction which is constructed from ...
Chao Du +4 more
doaj +1 more source
Quantum MDS and Synchronizable Codes From Cyclic and Negacyclic Codes of Length 2
IEEE Access, 2020 Let p be an odd prime, and Fp(m) is the finite field of pm elements. In this paper, all maximum distance separable (briefly, MDS) cyclic and negacyclic codes of length 2ps over Fp(m) are established.
Hai Q. Dinh +2 more
doaj +1 more source
On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots [PDF]
Designs, Codes and Cryptography, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ling, S., Niederreiter, H., Solé, P.
openaire +3 more sources
Some Constacyclic Codes over Finite Chain Rings [PDF]
, 2012 For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes.
Batoul, Aicha +2 more
core +1 more source