Paper Info
Title
Erasure Corrections in Tensor Product DFT Codes
Abstract
A new class of long codes that encode numerical values into codewords with numerical symbols is constructed using a Kronecker product of two shorter discrete Fourier transform (DFT) code-checking matrices. These tensor product codes can correct declared erasures up to the capabilities of the two underlying DFT codes. The erasure correction procedures are done in two stages. The first involves pre-syndromes that correct some of the items that are affected by codeword erasures. The newly corrected pre-syndromes, in turn, establish corrections for erased codeword symbols. Some comparisons with long standard DFT codes are included.
Year
DOI
Venue
2019
10.1109/LCOMM.2019.2924627
IEEE Communications Letters
Keywords
Field
DocType
Numerical-valued coding,discrete Fourier transform (DFT),Kronecker product,DFT codes,syndromes
Tensor product,ENCODE,Discrete mathematics,Kronecker product,Matrix (mathematics),Computer science,Real-time computing,Code word,Discrete Fourier transform,Erasure
Journal
Volume
Issue
ISSN
23
9
1089-7798
Citations 
PageRank 
References 
0
0.34
0
Authors
1
Name
Order
Citations
PageRank
G. Robert Redinbo15415.28