Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems (Q579215)

The work explores the correspondence between linear (n,k,d) codes and algorithms for computing a system of k bilinear forms over \(GF(p^ m)\). The author shows that a number of fast and efficient algorithms which were developed for digital signal processing can also be used to reduce the complexity of the decoding procedures of coding schemes. Fourier transforms defined in a Galois field can play an important role in a new approach to the design and analysis of coding schemes. A class of codes with adaptive error-correcting capabilities for digital communication over channels having non-stationary error rates is proposed. An error control scheme which can be used to provide high throughput for digital communication systems that use the automatic repeat request technique is described and analyzed. The author derives efficient algorithms for aperiodic convolutions and corresponding linear error-correcting codes.