Pages that link to "Item:Q5661390"
From MaRDI portal
The following pages link to Polynomial weights and code constructions (Q5661390):
Displayed 50 items.
- Decoding of repeated-root cyclic codes up to new bounds on their minimum distance (Q259877) (← links)
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals (Q267186) (← links)
- Recent progress on weight distributions of cyclic codes over finite fields (Q307903) (← links)
- On a class of repeated-root monomial-like abelian codes (Q307909) (← links)
- Repeated-root constacyclic codes of prime power lengths over finite chain rings (Q346276) (← links)
- On structure and distances of some classes of repeated-root constacyclic codes over Galois rings (Q346282) (← links)
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals (Q406323) (← links)
- Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) (Q473090) (← links)
- On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\) (Q507515) (← links)
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\) (Q606647) (← links)
- Repeated-root constacyclic codes of length (Q661982) (← links)
- New quantum codes from evaluation and matrix-product codes (Q747973) (← links)
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) (Q897327) (← links)
- A first approximation of concatenated convolutional codes from linear systems theory viewpoint (Q998203) (← links)
- How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences (Q1032492) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) (Q1685981) (← links)
- All \(\alpha+u\beta\)-constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) (Q1696746) (← links)
- Negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) and their duals (Q1699551) (← links)
- The symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\mathbb {F}_{p^{m}}\) (Q1704204) (← links)
- On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) (Q1732780) (← links)
- Skew constacyclic codes over finite fields and finite chain rings (Q1793100) (← links)
- Weighted Reed-Muller codes revisited (Q1934223) (← links)
- Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds (Q1995224) (← links)
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\) (Q2011488) (← links)
- Repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m} \) (Q2040331) (← links)
- MDS symbol-pair codes from repeated-root cyclic codes (Q2068385) (← links)
- On the construction of self-dual cyclic codes over \(\mathbb{Z}_4\) with arbitrary even length (Q2088958) (← links)
- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\) (Q2099600) (← links)
- Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\) (Q2158236) (← links)
- MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes (Q2207991) (← links)
- On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths (Q2297733) (← links)
- Multidimensional quasi-twisted codes: equivalent characterizations and their relation to multidimensional convolutional codes (Q2334445) (← links)
- On the distance of stabilizer quantum codes from \(J\)-affine variety codes (Q2412656) (← links)
- Evaluation codes from order domain theory (Q2469475) (← links)
- Repeated-root cyclic and negacyclic codes over a finite chain ring (Q2489937) (← links)
- On the evaluation codes given by simple \(\delta \)-sequences (Q2634585) (← links)
- Repeated root cyclic codes over \(\mathbb{Z}_{p^2}+u\mathbb{Z}_{p^2}\) and their Lee distances (Q2673770) (← links)
- Constructions of MDS symbol-pair codes with minimum distance seven or eight (Q2673981) (← links)
- On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring (Q2682398) (← links)
- \(n\)-dimensional quasi-cyclic codes over finite chain rings (Q2700153) (← links)
- ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4p<sup>s</sup> (Q2853419) (← links)
- ON THE ALGEBRAIC PARAMETERS OF CONVOLUTIONAL CODES WITH CYCLIC STRUCTURE (Q3379465) (← links)
- Input-State-Output Representation of Convolutional Product Codes (Q3460454) (← links)
- CONVOLUTIONAL CODES FOR PHASE-MODULATED CHANNELS (Q3741568) (← links)
- (Q4583451) (← links)
- Optimal b-symbol constacyclic codes with respect to the Singleton bound (Q5132285) (← links)
- Symbol-triple distance of repeated-root constacyclic codes of prime power lengths (Q5133858) (← links)
- On multivariate polynomials with many roots over a finite grid (Q5157742) (← links)
- A CLASS OF ONE-DIMENSIONAL MDS CONVOLUTIONAL CODES (Q5493880) (← links)