ELEMENTS OF MDS CODES VIA EXTENDED CAUCHY MATRICES
Dr.Rajesh Kumar Saini
, Dr.Binny Gupta
Maximum- distance separable, transmitted words, codes, element
An (n,k,d) linear code over the finite field F = GF(q) is maximum- distance separable(MDS) if it attains the Singleton bound d ≤ n-k+1. A k × n matrix G over F is a generator matrix of an MDS code if and only if every k columns of G are linearly Independent. In most cases, error patterns with slightly more than D/2 error can be corrected by an (N, K) maximum- distance separable (MDS) code. Earlier the complexity of computation increased with number of additional errors, where a single error could be amended with an acceptable degree of computation. To fight out this problem Sudan’s algorithm (1997) more errors can be corrected, in addition to this provides proof that for a limited number of errors, the correct codeword is always on a very small list of possible transmitted words. The right codeword is always on a very small list of possible transmitted words.
"ELEMENTS OF MDS CODES VIA EXTENDED CAUCHY MATRICES", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.8, Issue 1, page no.583 - 586, January-2023, Available :https://ijsdr.org/papers/IJSDR2301096.pdf
Volume 8
Issue 1,
January-2023
Pages : 583 - 586
Paper Reg. ID: IJSDR_203540
Published Paper Id: IJSDR2301096
Downloads: 000347176
Research Area: Mathematics
Country: Jhunjhunu, Rajasthan, India
ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator
Publisher: IJSDR(IJ Publication) Janvi Wave
