A correspondence between linear(n,k,d)codes and algorithms for computing a system forms is established under which the codelengthnis equal to the multiplicative complexity of the algorithm for computingψ, and the code distancedis underbounded by the minimum number of multiplications required to compute any linear combination of thekforms inψ. 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.
No takes yet. Share an insight, caveat, or question.
Lempel et al. (1977) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: