Polynomial weights and code constructions
From MaRDI portal
Recommendations
Cited in
(80)- How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences
- Algebraic theory of block codes detecting independent errors
- Polynomial-time construction of codes. I: Linear codes with almost equal weights
- On weight spaces of polynomial representations of the general linear group as linear codes
- Polynomials generating Hamming codes
- Weight enumerators of codes derived from polynomial product algorithms
- Generators and weights of polynomial 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
- The symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\mathbb {F}_{p^{m}}\)
- On the Hamming distances of repeated-root constacyclic codes of length 4p^s
- Skew constacyclic codes over finite fields and finite chain rings
- Weighted Reed-Muller codes revisited
- 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 \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\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}\)
- Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)
- MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes
- On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths
- Multidimensional quasi-twisted codes: equivalent characterizations and their relation to multidimensional convolutional codes
- On the distance of stabilizer quantum codes from \(J\)-affine variety codes
- Evaluation codes from order domain theory
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
- On the evaluation codes given by simple \(\delta \)-sequences
- 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
- \(n\)-dimensional quasi-cyclic codes over finite chain rings
- Rank weight hierarchy of some classes of polynomial codes
- On repeated-root constacyclic codes of length 4p^s
- Recent progress on weight distributions of cyclic codes over finite fields
- On a class of repeated-root monomial-like abelian codes
- ON THE ALGEBRAIC PARAMETERS OF CONVOLUTIONAL CODES WITH CYCLIC STRUCTURE
- Input-state-output representation of convolutional product codes
- 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
- Weighted Nonbinary Repeat–Accumulate Codes
- CONVOLUTIONAL CODES FOR PHASE-MODULATED CHANNELS
- A direct proof of the weight retaining property of polynomials over a finite field
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Binary coding by integration of polynomials
- On a class of constacyclic codes of length \(2p^s\) over \(\frac{\mathbb{F}_{p^m}[u]}{\langle u^a \rangle}\)
- Extensions of the method of poles for code construction
- Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- scientific article; zbMATH DE number 826046 (Why is no real title available?)
- On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)
- Optimal b-symbol constacyclic codes with respect to the Singleton bound
- Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
- On multivariate polynomials with many roots over a finite grid
- A CLASS OF ONE-DIMENSIONAL MDS CONVOLUTIONAL CODES
- The asymptotic average degree of an augmented polynomial
- Polynomial codes
- scientific article; zbMATH DE number 3394018 (Why is no real title available?)
- RT distance and weight distributions of Type 1 constacyclic codes of length 4ps over Fpm[u]
- Explicit constructions of cyclic and negacyclic codes of length \(3 p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m} \)
- On symbol-pair distances of repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) and MDS symbol-pair codes
- 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}\)
- Asymmetric quantum codes with high code rates
- Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
- Weighted Reed–Solomon convolutional codes
- On weight distributions for a class of codes with parameters of Reed-Muller codes
- δ-dual codes over finite commutative semi-simple rings
- 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
- Repeated-root constacyclic codes of length
- On a class of constacyclic codes of length \(4 p^s\) over \(\frac{ \mathbb{F}_{p^m} [ u ]}{ \langle u^3 \rangle} \)
- Some results on the Hamming distances of cyclic codes
- 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
- Two new classes of AMDS symbol-pair cyclic codes of length 4p
- New constructions of MDP convolutional codes with memory 1 for k=2,3
- New quantum codes from evaluation and matrix-product codes
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- A first approximation of concatenated convolutional codes from linear systems theory viewpoint
This page was built for publication: Polynomial weights and code constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5661390)
