To make codes easier to use and to analyze we must impose some algebraic structure on them. The simplest assumption is that the code is linear. In this chapter we give the basic theory of linear codes, including the fundamental notions of generator matrix, parity check matrix, dual code, and standard decoding array.
KeywordsGenerator Matrix Linear Code Parity Check Binary Matrix Error Pattern
Unable to display preview. Download preview PDF.
- [50b]Chien, R.T., and W.D. Frazer (1966), An application of coding theory to document retrieval, PGIT 12: 92–96.Google Scholar
- Hobbs, C.F. (1965), Approximating the performance of a binary group code, PGIT 11: 142–144.Google Scholar
- Sloane, N.J.A. and R.J. Dick (1971), On the enumeration of cosets of first order Reed-Müller codes, IEEE Intern, Conf. on Commun., Montreal 1971, 7: 36–2 to 36–6.Google Scholar
- Wyner, A.D. (1965A), Capabilities of bounded discrepancy decoding, BSTJ 44: 1061–1122.Google Scholar