Pages that link to "Item:Q4133530"
From MaRDI portal
The following pages link to A new approach to error-correcting codes (Q4133530):
Displaying 22 items.
- \((2,1)\)-separating systems beyond the probabilistic bound (Q375844) (← links)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (Q432769) (← links)
- Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields (Q751615) (← links)
- Linear intersecting codes (Q1072521) (← links)
- On the complexity of multiplication in finite fields (Q1171378) (← links)
- A lower bound for the multiplication of polynomials modulo a polynomial (Q1197994) (← links)
- Trade-offs between communication and space (Q1201877) (← links)
- Improved identification schemes based on error-correcting codes (Q1352426) (← links)
- Weight enumerators of codes derived from polynomial product algorithms (Q1356476) (← links)
- Gaps between prime numbers and tensor rank of multiplication in finite fields (Q1727373) (← links)
- On a signal processing algorithms based class of linear codes (Q1803557) (← links)
- New approach to estimation of the decoding error probability (Q1812333) (← links)
- The Horace method for error-correcting codes (Q2432550) (← links)
- Two new four-error-correcting binary codes (Q2572972) (← links)
- Maximal bilinear complexity and codes (Q2638779) (← links)
- On a new method of coding of information (Q2737172) (← links)
- A Transform Approach to Alternant and the Like Error Correcting Codes (Q3808014) (← links)
- A New Class of Error-Correcting/Detecting Codes for Fault-Tolerant Computer Applications (Q3877562) (← links)
- (Q4044441) (← links)
- A New Method for Constructing Circuit Codes (Q5365416) (← links)
- Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$ (Q5452256) (← links)
- (Q5513470) (← links)
