A new approach to error-correcting codes
- 1 July 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 23 (4), 503-508
- https://doi.org/10.1109/tit.1977.1055735
Abstract
A correspondence between linear(n,k,d)codes and algorithms for computing a systempsiofkbilinear forms is established under which the codelengthnis equal to the multiplicative complexity of the algorithm for computingpsi, and the code distancedis underbounded by the minimum number of multiplications required to compute any linear combination of thekforms inpsi. This hitherto unexplored approach to linear codes holds promise of a better understanding of the structure of existing codes as well as for methods of constructing new codes with prescribed rate and distance.Keywords
This publication has 5 references indexed in Scilit:
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear FormsSIAM Journal on Computing, 1973
- On the optimal evaluation of a set of bilinear formsPublished by Association for Computing Machinery (ACM) ,1973
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960