On repeated-root cyclic codes
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On self-orthogonal group ring codes
- The condition for a cyclic code to have a complementary dual
- New linear codes from constacyclic codes
- Algebraic quantum synchronizable codes
- On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- All \(\alpha+u\beta\)-constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- Negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) and their duals
- On the Hamming distances of repeated-root constacyclic codes of length 4p^s
- On LCD repeated-root cyclic codes over finite fields
- \(\mathbb F_q\)-linear cyclic codes over \(\mathbb F_{q^m}\): DFT approach
- Skew constacyclic codes over finite fields and finite chain rings
- Cyclic codes of length 2e over Z₄.
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- Hamming distances of constacyclic codes of length 3p^s and optimal codes with respect to the Griesmer and Singleton bounds
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- Repeated-root constacyclic codes of length \(6lp^s\)
- Repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m} \)
- On the cyclic order distribution and partitioning of linear cyclic codes
- Optimal binary codes derived from \(\mathbb{F}_2 \mathbb{F}_4\)-additive cyclic codes
- The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes
- On Hamming and \(b\)-symbol distance distributions of repeated-root constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}\)
- MDS symbol-pair codes from repeated-root cyclic codes
- On the construction of self-dual cyclic codes over \(\mathbb{Z}_4\) with arbitrary even length
- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
- Construction of optimal codes from a class of constacyclic codes
- Two new families of quantum synchronizable codes
- Duality of constacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{ \mathbb{F}_{p^m} [ u , \theta ]}{ \langle u^2 \rangle} \)
- A construction of optimal nonbinary pure quantum stabilizer codes
- Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)
- Repeated-root constacyclic codes of length 3 ^m p^s
- Quantum codes from repeated-root cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} \)
- On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths
- On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
- Multidimensional quasi-twisted codes: equivalent characterizations and their relation to multidimensional convolutional codes
- Repeated-root constacyclic codes of length \(n l p^s\)
- On universally decodable matrices for space-time coding
- Cyclic codes over the rings Z₂ + u Z₂ and Z₂ + u Z₂ + u^2 Z₂
- Multivariable codes in principal ideal polynomial quotient rings with applications to additive modular bivariate codes over \(\mathbb{F}_4\)
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- On the algebraic structure of quasi-cyclic codes. IV: Repeated roots
- Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
- Repeated root cyclic codes over \(\mathbb{Z}_{p^2}+u\mathbb{Z}_{p^2}\) and their Lee distances
- Constructions of MDS symbol-pair codes with minimum distance seven or eight
- On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring
- Matrix-product structure of repeated-root cyclic codes over finite fields
- MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\)
- Cyclic codes of length \(5p\) with MDS symbol-pair
- On repeated-root constacyclic codes of length 4p^s
- On non-binary quantum repeated-root cyclic codes
- Recent progress on weight distributions of cyclic codes over finite fields
- On a class of repeated-root monomial-like abelian codes
- Repeated-root constacyclic codes of length 3lp^s and their dual codes
- Linear complexity of periodic sequences: a general theory
- Repeated-root constacyclic codes of prime power lengths over finite chain rings
- On structure and distances of some classes of repeated-root constacyclic codes over Galois rings
- scientific article; zbMATH DE number 4102987 (Why is no real title available?)
- scientific article; zbMATH DE number 3746974 (Why is no real title available?)
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- scientific article; zbMATH DE number 2077084 (Why is no real title available?)
- On a class of constacyclic codes of length \(2p^s\) over \(\frac{\mathbb{F}_{p^m}[u]}{\langle u^a \rangle}\)
- QUANTUM CODES CONSTRUCTED FROM BINARY CYCLIC CODES
- Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- On Repeated-Single-Root Constacyclic Codes
- On generalizations of repeated-root cyclic codes
- Repeated-root constacyclic codes of length $2p^s$ over Galois rings
- A quantum error-correction circuit based on cyclic code
- A mass formula for negacyclic codes of length \(2^k\) and some good negacyclic codes over \(\mathbb {Z}_{4}+u\mathbb {Z}_{4}\)
- Negacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{\mathbb{F}_{p^m}[u,\theta]}{\langle u^2\rangle}\)
- On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)
- Towards a general construction of recursive MDS diffusion layers
- Optimal b-symbol constacyclic codes with respect to the Singleton bound
- Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
- Negacyclic codes of length \(8p^s\) over \(F_{p^m} + uF_{p^m}\)
- Repeated-root constacyclic codes over \(\mathbb{F}_3+u\mathbb{F}_3+v\mathbb{F}_3+uv\mathbb{F}_3\)
- The distance and weight distribution of cyclic code of length \(2^S\) over \(F_{2^a}\)
- Further study of repeated-root cyclic codes
- Correcting errors and erasures via the syndrome variety
- RT distance and weight distributions of Type 1 constacyclic codes of length 4ps over Fpm[u]
- Repeated-root cyclic codes
- Explicit constructions of cyclic and negacyclic codes of length \(3 p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m} \)
- A survey on proper codes
- AMDS symbol-pair codes from repeated-root cyclic codes
- Quantum error-correcting codes from the quantum construction \(X\)
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)
- On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Asymmetric quantum codes with high code rates
- Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
- MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes
- A characterization of optimal constacyclic locally repairable codes
- δ-dual codes over finite commutative semi-simple rings
- Hamming distances of constacyclic codes of length \(7p^s\) over \(\mathbb{F}_{p^m}\)
- New QEC and EAQEC codes from repeated-root cyclic codes of length \(10p^s\) over finite fields \(\mathbb{F}_{p^m} \)
- On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
- The adjacency codes of the first yellow graphs
- Repeated-root constacyclic codes of length
- New quantum codes and entanglement-assisted quantum codes from repeated-root cyclic codes of length 2rp^s
- On \(b\)-symbol distance, Hamming distance and RT distance of type 1 \(\lambda \)-constacyclic codes of length \(8 p^s\) over \(\mathbb{F}_{p^m}[u]/\langle u^k\rangle \)
This page was built for publication: On repeated-root cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753884)