A new approach to error-correcting codes
From MaRDI portal
Publication:4133530
DOI10.1109/TIT.1977.1055735zbMATH Open0357.94017MaRDI QIDQ4133530FDOQ4133530
Shmuel Winograd, Abraham Lempel
Publication date: 1977
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Cited In (24)
- Gaps between prime numbers and tensor rank of multiplication in finite fields
- Title not available (Why is that?)
- Correcting a specified set of likely error patterns
- A New Class of Error-Correcting/Detecting Codes for Fault-Tolerant Computer Applications
- \((2,1)\)-separating systems beyond the probabilistic bound
- A New Method for Constructing Circuit Codes
- On a new method of coding of information
- Improved identification schemes based on error-correcting codes
- The Horace method for error-correcting codes
- Linear intersecting codes
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Two new four-error-correcting binary codes
- New approach to estimation of the decoding error probability
- Title not available (Why is that?)
- Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields
- Title not available (Why is that?)
- On the complexity of multiplication in finite fields
- Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
- A Transform Approach to Alternant and the Like Error Correcting Codes
- A lower bound for the multiplication of polynomials modulo a polynomial
- Trade-offs between communication and space
- Weight enumerators of codes derived from polynomial product algorithms
- On a signal processing algorithms based class of linear codes
- Maximal bilinear complexity and codes
This page was built for publication: A new approach to error-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133530)
