Pages that link to "Item:Q5535509"
From MaRDI portal
The following pages link to A Class of Error-Correcting Codes in $p^m $ Symbols (Q5535509):
Displaying 21 items.
- New developments in \(q\)-polynomial codes (Q267804) (← links)
- Simple algorithms for decoding systematic Reed-Solomon codes (Q356717) (← links)
- Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503) (← links)
- Computer algebra tales on Goppa codes and McEliece cryptography (Q782704) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- At the dawn of the theory of codes (Q1209799) (← links)
- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance (Q1696750) (← links)
- On some cyclic codes of length \(\frac{q^{2m} - 1}{q + 1} \) (Q2007712) (← links)
- Quantum BCH codes with maximum designed distance (Q2140831) (← links)
- MemHyb: predicting membrane protein types by hybridizing SAAC and PSSM (Q2263483) (← links)
- A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \) (Q2291669) (← links)
- A note on good permutation codes from Reed-Solomon codes (Q2324769) (← links)
- Dimensions of three types of BCH codes over \(\mathrm{GF}(q)\) (Q2397534) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- A New Algorithm for Decoding Reed-Solomon Codes (Q3448743) (← links)
- A Decoding Approach to Reed–Solomon Codes from Their Definition (Q4577009) (← links)
- BCH Codes with Minimum Distance Proportional to Code Length (Q5150816) (← links)
- Peterson–Gorenstein–Zierler algorithm for skew RS codes (Q5206286) (← links)
- Dimensions of nonbinary antiprimitive BCH codes and some conjectures (Q6098084) (← links)
- Two families of negacyclic BCH codes (Q6101271) (← links)
- BCH cyclic codes (Q6204335) (← links)
