Decoding Algorithms for Two-dimensional Constacyclic Codes over Fq
Abstract
We derive the spectral domain properties of two-dimensional (2-D) (λ1, λ2)-constacyclic codes over Fq using the 2-D finite field Fourier transform (FFFT). Based on the spectral nulls of 2-D (λ1, λ2)-constacyclic codes, we characterize the structure of 2-D constacyclic coded arrays. The proposed 2-D construction has flexible code rates and works for any code areas, be it odd or even area. We present an algorithm to detect the location of 2-D errors. Further, we also propose decoding algorithms for extracting the error values using both time and frequency domain properties by exploiting the sparsity that arises due to duality in the time and frequency domains. Through several illustrative examples, we demonstrate the working of the proposed decoding algorithms.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.