Repeated-root cyclic codes
From MaRDI portal
Recommendations
- On repeated-root cyclic codes
- Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
- On generalizations of repeated-root cyclic codes
- Matrix-product structure of repeated-root cyclic codes over finite fields
- The distance and weight distribution of cyclic code of length \(2^S\) over \(F_{2^a}\)
Cited in
(only showing first 100 items - show all)- 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 \(3 p^s\) over the finite non-chain ring \(\frac{\mathbb{F}_{p^m} [u,v]}{\langle u^2,v^2,uv-vu\rangle}\) and their duals
- Closed formulas for the generators of all constacyclic codes and for the factorization of \(X^{n} - 1\), the \(n\)-th cyclotomic polynomial and every composition of the form \(f(X^n)\) over a finite field for arbitrary positive integers \(n\)
- MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\)
- On the construction of self-dual cyclic codes over \(\mathbb{Z}_4\) with arbitrary even length
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Optimal b-symbol constacyclic codes with respect to the Singleton bound
- 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}\)
- New QEC and EAQEC codes from repeated-root cyclic codes of length \(10p^s\) over finite fields \(\mathbb{F}_{p^m} \)
- Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)
- The complete weight enumerator of the square of one-weight irreducible cyclic codes
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
- Some minimal cyclic codes over finite fields
- On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
- Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
- Some families of \(\mathbb Z_4\)-cyclic codes
- 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
- On universally decodable matrices for space-time coding
- On Hamming distance and RT distance of a class of constacyclic codes over \(\mathbb{F}_{p^n}+u\mathbb{F}_{p^n}+\cdots +u^{t-1}\mathbb{F}_{p^n}\)
- MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes
- Repeated-root constacyclic codes of prime power lengths over finite chain rings
- Cyclic codes of length 2e over Z₄.
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths
- Repeated root cyclic codes over \(\mathbb{Z}_{p^2}+u\mathbb{Z}_{p^2}\) and their Lee distances
- Matrix-product structure of repeated-root cyclic codes over finite fields
- On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of length $2p^s$ over Galois rings
- Repeated-root constacyclic codes of length
- On repeated-root cyclic codes
- Correcting errors and erasures via the syndrome variety
- Negacyclic codes of length \(8p^s\) over \(F_{p^m} + uF_{p^m}\)
- Recent progress on weight distributions of cyclic codes over finite fields
- On LCD repeated-root cyclic codes over finite fields
- Repeated-root constacyclic codes of length 3 ^m p^s
- Negacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{\mathbb{F}_{p^m}[u,\theta]}{\langle u^2\rangle}\)
- Two new classes of AMDS symbol-pair cyclic codes of length 4p
- 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} \)
- On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
- Repeated-root constacyclic codes of length \(n l p^s\)
- A class of constacyclic codes over a finite field
- Quantum codes from repeated-root cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} \)
- \(\mathbb F_q\)-linear cyclic codes over \(\mathbb F_{q^m}\): DFT approach
- All \(\alpha+u\beta\)-constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- Repeated-root constacyclic codes of length \(6lp^s\)
- Cyclic self-orthogonal codes over finite chain ring
- Cyclic self-dual \(\mathbb Z_4\)-codes.
- On a class of repeated-root monomial-like abelian codes
- Explicit constructions of cyclic and negacyclic codes of length \(3 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 non-binary quantum repeated-root cyclic codes
- On self-orthogonal group ring codes
- Repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m} \)
- Jack van Lint (1932--2004): a survey of his scientific work
- Skew constacyclic codes over finite fields and finite chain rings
- Construction and decomposition of cyclic codes of composite length (Corresp.)
- The distance and weight distribution of cyclic code of length \(2^S\) over \(F_{2^a}\)
- scientific article; zbMATH DE number 1189047 (Why is no real title available?)
- On cyclic codes over the ring \(\mathbb Z_p[u]/\langle u^k\rangle\)
- scientific article; zbMATH DE number 3487347 (Why is no real title available?)
- Repeated-root constacyclic codes over \(\mathbb{F}_3+u\mathbb{F}_3+v\mathbb{F}_3+uv\mathbb{F}_3\)
- Repeated-root constacyclic codes of length 3lp^s and their dual codes
- Cyclic codes over the ring \(\mathbb{Z}_p [u, v] / \langle u^2, v^2, u v - v u \rangle\)
- Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- On cyclic self-dual codes
- Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- New quantum codes and entanglement-assisted quantum codes from repeated-root cyclic codes of length 2rp^s
- Cyclic codes over \(R = F_p + uF_p + \cdots + u^{k - 1}F_p\) with length \(p^sn\)
- Cyclic codes over the rings Z₂ + u Z₂ and Z₂ + u Z₂ + u^2 Z₂
- 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 modular cyclic codes
- New linear codes from constacyclic codes
- The Hamming distances of repeated-root cyclic codes of length 5 p^s
- Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
- On structure and distances of some classes of repeated-root constacyclic codes over Galois rings
- Construction of optimal codes from a class of constacyclic codes
- 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 \)
- scientific article; zbMATH DE number 2077084 (Why is no real title available?)
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- scientific article; zbMATH DE number 5572824 (Why is no real title available?)
- Asymmetric quantum codes with high code rates
- δ-dual codes over finite commutative semi-simple rings
- Five infinite families of binary cyclic codes and their related codes with good parameters
- RT distance and weight distributions of Type 1 constacyclic codes of length 4ps over Fpm[u]
- On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- On a class of constacyclic codes of length \(4 p^s\) over \(\frac{ \mathbb{F}_{p^m} [ u ]}{ \langle u^3 \rangle} \)
- Further study of repeated-root cyclic codes
- On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Reduced linear codes from cyclic ones
- Cyclic concatenated codes with constacyclic outer codes
- Hamming distances of constacyclic codes of length \(7p^s\) over \(\mathbb{F}_{p^m}\)
- Some results on the Hamming distances of cyclic codes
- On a class of constacyclic codes and MDS code construction over \(\frac{\mathbb{F}_{p^m} [u, v]}{\langle u^2 - \delta u, v^2 - \gamma v, uv - vu \rangle}\)
- On repeated-root constacyclic codes of length 4p^s
This page was built for publication: Repeated-root cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753885)