Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed-Solomon codes
DOI10.3906/MAT-1607-49zbMATH Open1424.42016OpenAlexW2794183083MaRDI QIDQ4633757FDOQ4633757
Authors: Majid Mazrooei, Lale Rahimi, Najme Sahami 
Publication date: 3 May 2019
Published in: Turkish Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3906/mat-1607-49
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
Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42B10) Other transforms and operators of Fourier type (43A32) Linear codes (general theory) (94B05)
Cites Work
- Polynomial Codes Over Certain Finite Fields
- A New Algorithm for Decoding Reed-Solomon Codes
- Algebraic codes for data transmission.
- New good rate \((m-1)/pm\) ternary and quaternary quasi-cyclic codes
- Title not available (Why is that?)
- Linear complexity of periodic sequences: a general theory
- 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)
