A new approach to error-correcting codes
From MaRDI portal
Publication:4133530
DOI10.1109/TIT.1977.1055735zbMath0357.94017MaRDI QIDQ4133530
Abraham Lempel, Shmuel Winograd
Publication date: 1977
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (12)
Maximal bilinear complexity and codes ⋮ Weight enumerators of codes derived from polynomial product algorithms ⋮ \((2,1)\)-separating systems beyond the probabilistic bound ⋮ Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method ⋮ On the complexity of multiplication in finite fields ⋮ Gaps between prime numbers and tensor rank of multiplication in finite fields ⋮ A lower bound for the multiplication of polynomials modulo a polynomial ⋮ Trade-offs between communication and space ⋮ Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$ ⋮ On a signal processing algorithms based class of linear codes ⋮ Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields ⋮ Linear intersecting codes
This page was built for publication: A new approach to error-correcting codes
