A coding scheme that increases the code rate
From MaRDI portal
Publication:2514072
DOI10.1007/S40314-013-0082-YzbMATH Open1351.94081OpenAlexW1983209816MaRDI QIDQ2514072FDOQ2514072
Authors: R. S. Raja Durai, Meenakshi Devi 
Publication date: 30 January 2015
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-013-0082-y
Recommendations
Cites Work
- A Mathematical Theory of Communication
- Bilinear forms over a finite field, with applications to coding theory
- Erasure techniques in MRD codes.
- Polynomial Codes Over Certain Finite Fields
- On a class of error correcting binary group codes
- Title not available (Why is that?)
- Theory of codes with maximum rank distance
- Ring constructions and applications
- Maximum distance<tex>q</tex>-nary codes
- Title not available (Why is that?)
- Self-Complementary Normal Bases in Finite Fields
- Title not available (Why is that?)
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Algorithms for computing parameters of graph-based extensions of BCH codes
- Title not available (Why is that?)
- On cyclic codes in incidence rings
- Matrix Factorization over $GF(2)$ and Trace-Orthogonal Bases of $GF(2^n )$
- Title not available (Why is that?)
Cited In (6)
- Design of \(\mathcal{T}\)-\textit{direct} codes over \(\mathrm{GF}(2^N)\) with increased users
- Construction of high rate \(\mathcal {T}\)-direct codes
- Modified product codes
- Modified linear block code with code rate 1/2 and less than 1/2
- A new coding scheme in coded ultrasound using staggering repetition interval
- Multiple-rate error-correcting coding scheme
This page was built for publication: A coding scheme that increases the code rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2514072)
