Pages that link to "Item:Q2350921"
From MaRDI portal
The following pages link to Efficient representation of binary nonlinear codes: constructions and minimum distance computation (Q2350921):
Displaying 7 items.
- Comparing decoding methods for quaternary linear codes (Q510602) (← links)
- Efficiency of chain codes to represent binary objects (Q877106) (← links)
- A deterministic algorithm for the distance and weight distribution of binary nonlinear codes (Q1993387) (← links)
- Generating nonlinear codes for multi-bit symbol error correction using cellular automata (Q2116307) (← links)
- Parity check systems of nonlinear codes over finite commutative Frobenius rings (Q2408275) (← links)
- On decoding procedures of intertwining codes (Q5034975) (← links)
- Efficient and compact representations of some non-canonical prefix-free codes (Q5916286) (← links)