A new approach to error-correcting codes
From MaRDI portal
Publication:4133530
DOI10.1109/TIT.1977.1055735zbMath0357.94017MaRDI QIDQ4133530
Shmuel Winograd, Abraham Lempel
Publication date: 1977
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
94B05: Linear codes (general theory)
Related Items
Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$, \((2,1)\)-separating systems beyond the probabilistic bound, Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method, Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields, 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, Weight enumerators of codes derived from polynomial product algorithms, On a signal processing algorithms based class of linear codes, Maximal bilinear complexity and codes