A coding scheme that increases the code rate
From MaRDI portal
Publication:2514072
Recommendations
Cites work
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- scientific article; zbMATH DE number 1332357 (Why is no real title available?)
- scientific article; zbMATH DE number 5054873 (Why is no real title available?)
- scientific article; zbMATH DE number 5499321 (Why is no real title available?)
- scientific article; zbMATH DE number 3251924 (Why is no real title available?)
- A Mathematical Theory of Communication
- Algorithms for computing parameters of graph-based extensions of BCH codes
- Bilinear forms over a finite field, with applications to coding theory
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Erasure techniques in MRD codes.
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Matrix Factorization over $GF(2)$ and Trace-Orthogonal Bases of $GF(2^n )$
- Maximum distance<tex>q</tex>-nary codes
- On a class of error correcting binary group codes
- On cyclic codes in incidence rings
- Polynomial Codes Over Certain Finite Fields
- Ring constructions and applications
- Self-Complementary Normal Bases in Finite Fields
- Theory of codes with maximum rank distance
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)
