Pages that link to "Item:Q4361468"
From MaRDI portal
The following pages link to On the decoding of Reed-Solomon and BCH codes over integer residue rings (Q4361468):
Displayed 14 items.
- An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings (Q522204) (← links)
- Construction and decoding of BCH codes over finite commutative rings (Q1301272) (← links)
- Generator polynomials of characteristic ideal of maximal periodic arrays over Galois rings. (Q1427475) (← links)
- Identification of proteins by the use of Chinese remainder theorem codes over finite commutative rings (Q2167358) (← links)
- A matrix based list decoding algorithm for linear codes over integer residue rings (Q2229499) (← links)
- Decoding of cyclic codes over the ring \(F_2+uF_2+u^2F_2\) (Q2243996) (← links)
- Construction and decoding of BCH codes over chain of commutative rings (Q2391751) (← links)
- Transmission of intra-cellular genetic information: a system proposal (Q2415671) (← links)
- Algorithms for computing parameters of graph-based extensions of BCH codes (Q2466021) (← links)
- List decoding of convolutional codes over integer residue rings (Q2662048) (← links)
- Computing the reciprocal of units in Galois rings (Q4549929) (← links)
- Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission (Q4628712) (← links)
- Maximal Periodic Two-Dimensional Arrays Over Galois Rings (Q5466696) (← links)
- Gröbner bases over Galois rings with an application to decoding alternant codes (Q5938546) (← links)