A new approach to error-correcting codes
From MaRDI portal
Publication:4133530
Recommendations
Cited in
(30)- Linear intersecting codes
- On the complexity of multiplication in finite fields
- A lower bound for the multiplication of polynomials modulo a polynomial
- Trade-offs between communication and space
- Improved identification schemes based on error-correcting codes
- Weight enumerators of codes derived from polynomial product algorithms
- Gaps between prime numbers and tensor rank of multiplication in finite fields
- On a signal processing algorithms based class of linear codes
- New approach to estimation of the decoding error probability
- The Horace method for error-correcting codes
- Two new four-error-correcting binary codes
- Maximal bilinear complexity and codes
- On a new method of coding of information
- Computing statistics for polynomial codes: an algorithm based on the Mann-Whitney U-test
- Approximate algorithms of construction of largest error-correcting codes which correct one error on the Z-channel
- \((2,1)\)-separating systems beyond the probabilistic bound
- A Transform Approach to Alternant and the Like Error Correcting Codes
- A New Class of Error-Correcting/Detecting Codes for Fault-Tolerant Computer Applications
- scientific article; zbMATH DE number 3458474 (Why is no real title available?)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- scientific article; zbMATH DE number 1104164 (Why is no real title available?)
- Correcting a specified set of likely error patterns
- scientific article; zbMATH DE number 842890 (Why is no real title available?)
- A New Method for Constructing Circuit Codes
- Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
- scientific article; zbMATH DE number 3225057 (Why is no real title available?)
- scientific article; zbMATH DE number 3345383 (Why is no real title available?)
- Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems
- MWS and FWS codes for coordinate-wise weight functions
- Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields
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)
