Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed-Solomon codes
From MaRDI portal
Publication:4633757
Recommendations
- A general construction of Reed-Solomon codes based on generalized discrete Fourier transform
- DFT domain characterization of quasi-cyclic codes
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
- scientific article; zbMATH DE number 4039800
- On the algebraic structure of quasi-cyclic codes. IV: Repeated roots
Cites work
- scientific article; zbMATH DE number 1026591 (Why is no real title available?)
- A New Algorithm for Decoding Reed-Solomon Codes
- Algebraic codes for data transmission.
- Linear complexity of periodic sequences: a general theory
- New good rate (m-1)/pm ternary and quaternary quasi-cyclic codes
- Polynomial Codes Over Certain Finite Fields
- Properties of the Multidimensional Generalized Discrete Fourier Transform
Cited in
(5)- A generalization of the pascal matrix and an application to coding theory
- \(n\)-dimension quasi-twisted codes of arbitrary length over finite fields
- A general construction of Reed-Solomon codes based on generalized discrete Fourier transform
- 2DRMP: A suite of two-dimensional R-matrix propagation codes
- 2-D quasi m-arrays and Gold code arrays
This page was built for publication: Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633757)