Transform Techniques for Error Control Codes
From MaRDI portal
Cited in
(16)- Finite field transforms and symmetry groups
- On the MacWilliams identities for linear codes
- Solving linear systems of determinant frequently zero over finite field GF(2)
- On viewing block codes as finite automata.
- VLSI architecture of modified Euclidean algorithm for Reed-Solomon code.
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- Trace representation of Legendre sequences over non-binary fields
- Zigzag decodable codes: linear-time erasure codes with applications to data storage
- A Transform Approach to Alternant and the Like Error Correcting Codes
- Group testing and fault detection for replicated files
- Multiscale matrix pencils for separable reconstruction problems
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
- Shortened and punctured codes and the MacWilliams identities
- Trace representation of a family of generalized cyclotomic binary sequences with period p^n
- Trace representation of pseudorandom binary sequences derived from Euler quotients
- Coding for a multiple access OR channel: A survey
This page was built for publication: Transform Techniques for Error Control Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4189179)