Results 211 to 220 of about 36,705 (229)

On repeated-root cyclic codes and its weight enumirator

2010 IEEE International Conference on Information Theory and Information Security, 2010
The squaring and iterated squaring construction for cyclic codes, obtained from well known construction | u | u + v|, are widely in use because of their comparatively less complex nature. A large number of quality codes and lattices such as Reed-Mullar codes and Barnes-Wall lattices are generated by employing simple constructions.
Jaskaran Bhullar, Manish K. Gupta, Sonia Sonia   +2 more
openalex   +2 more sources

Repeated-Root Isodual Cyclic Codes over Finite Fields

, 2015
In this paper we give several constructions of cyclic codes over finite fields that are monomially equivalent to their dual, where the characteristic of the field divides the length of the code. These are called repeated-root cyclic isodual codes over finite fields.
Aicha Batoul, Kenza Guenda, T. Aaron Gulliver   +2 more
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

A note on the q-ary image of a q/sup m/-ary repeated-root cyclic code

IEEE Transactions on Information Theory, 1997
Summary: For \((n,q)=p^s\), where \(p=\text{ch}(F_q)\), \(s\geq 1\), \(V\) a \(q^m\)-ary repeated-root cyclic code of length \(n\) with generator polynomial \(g(x)\), we give a partial answer about whether the \(q\)-ary image of \(V\) is cyclic or not with respect to a certain basis for \(F_{q^m}\) over \(F_q\).
Tang, Li-zhong, Soh, Cheong Boon, Gunawan, Erry   +2 more
openaire   +3 more sources

A class of 1-generator repeated root quasi-cyclic codes

Designs, Codes and Cryptography, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yonglin Cao
openalex   +3 more sources

Repeated root cyclic codes over $\mathbb {Z}_{p^{2}}+u\mathbb {Z}_{p^{2}}$ and their Lee distances

Cryptography and Communications, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raj Kumar, Maheshanand Bhaintwal
openalex   +2 more sources

New quantum codes and entanglement-assisted quantum codes from repeated-root cyclic codes of length $$2^rp^s$$

Quantum Information Processing
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Lanqiang, Cao, Ziwen, Wu, Tingting, Liu, Li   +3 more
openaire   +4 more sources

On repeated-root cyclic codes and the two-way chain condition

, 1997
Some repeated-root cyclic codes are shown to satisfy the two-way chain condition. Necessary or sufficient conditions for codes satisfying the two-way chain condition are derived. Parameters of codes which do not admit efficient coordinate ordering are provided.
Sylvia Encheva
openalex   +2 more sources

On non-binary quantum repeated-root cyclic codes

International Journal of Quantum Information, 2014
In this paper, based on the Steane's enlargement construction, three classes of non-binary quantum codes are constructed from classical repeated-root cyclic codes of length 2ps over 𝔽q with odd characteristic p. The exact minimum distances of these quantum codes are determined.
Wang, Liqi, Zhu, Shixin
openaire   +1 more source

Class of repeated‐single‐root cyclic codes for power‐line communications

Electronics Letters, 2016
Valdemar C. da Rocha
openalex   +3 more sources

Construction of Asymmetric Quantum Product Codes Based Repeated-Root Cyclic Codes

Applied Mechanics and Materials, 2014
A kind of classical product codes based on repeated-root cyclic codes are considered in this paper, and the classical product codes are applied to construct the asymmetric quantum product codes. The novel asymmetric quantum product codes have great asymmetry for correcting Z errors and X errors, and the parameters of asymmetric quantum product codes ...
Pan Yue Fu, Wei Liu
openaire   +1 more source