Linear Block Codes
Linear Block Codes
复制标题
DOI：
10.1007/978-1-4615-5745-6_2
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
Shu Lin;T. Kasami;T. Fujiwara;M. Fossorier
中科院分区：
文献类型：
--
作者：
Shu Lin;T. Kasami;T. Fujiwara;M. Fossorier
第二章对线性分组码进行了简要的回顾。其目的是为后面章节的格状结构和基于格状结构的线性分组码译码算法的发展提供必要的背景材料。主要介绍了线性分组码的编码和译码的基本概念，并陈述了一些没有推导和证明的事实。由于在大多数目前的数字数据通信系统中，信息是以二进制数编码的，所以我们仅讨论具有来自二进制域GF(2)的符号的线性分组码。首先，用生成矩阵和奇偶校验矩阵来定义和描述线性分组码。其次，讨论了线性分组码的陪集划分，这是分析码格结构和构造所必需的。第三，提出了最小距离、权重分布和距离分布的概念，这是后面章节介绍译码算法及其误码性能所需要的。最后给出了硬判决、软判决和最大似然译码的概念。
Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. We mainly present the basic concepts of encoding and decoding of linear block codes and state some facts without derivations or proofs. Since in most present digital data communication systems, information is coded in binary digits, ‘0’ or ‘1’, we discuss only linear block codes with symbols from the binary field GF(2). First, linear block codes are defined and described in terms of generator and parity-check matrices. Second, coset partition of a linear block code is discussed, which is needed in analyzing the code trellis structure and construction. Third, the concepts of minimum distance, weight distribution and distance profile are presented, which are needed in the later chapters for presenting decoding algorithms and their error performances. Finally, the concepts of hard-decision, soft-decision, and maximum likelihood decoding are presented.