在不用构造标准阵列的前提下，利用一致校验矩阵直接生成简化的译码表。
This article USES the parity check matrix to produce a simplified decoding table under the premise of not using the structure standard array.
然后，处理器（50）结合子阵H1和子阵H2来产生奇偶校验矩阵H。
The processor (50) then joins partial matrix H1 and partial matrix H2 to generate parity check matrix H.
LDPC码是一种特殊的具有稀疏校验矩阵的纠错编码，其性能逼近香农限。
Low density parity check (LDPC) code, which is a special case of error correction code with sparse parity-check matrix, has the performance very close to the Shannon Limit.
实际上利用每一个mds码的生成矩阵或校验矩阵都可以得到一种分享秘密的方法。
In fact, we have shown that by the generation matrices or parity check matrices of any MDS codes, one can get a new method of secret sharing.
根据正交校验矩阵的特点，提出了一种一般线性分组码的正交校验矩阵的穷举搜索算法。
According to the characteristics of orthogonal parity-check matrixes, an exhaustive algorithm was proposed to search for the orthogonal parity-check matrixes of general block codes.
提出了一种基于置换矩阵的非规则低密度奇偶校验(LDPC)码的校验矩阵设计方法。
A design of parity check matrix for Irregular LDPC codes based on per mutation matrix is proposed in this paper.
由于信息码元与校验码元之间关系的重要性，对每一种码的生成矩阵和校验矩阵均进行了讨论。
For the importance of the relationship between information and parity, the generator matrix and the parity-check matrix of every code have been discussed.
LDPC码校验矩阵声称函数，可以根据度分布生成相应的校验矩阵，适用于码长很长的LDPC。
LDPC check matrix function claims that can be generated in accordance with the corresponding distribution check matrix, for a very long code length LDPC.
而LDPC码性能的优劣，与其二分图中是否存在短长度的圈有关，也即与其奇偶校验矩阵的构造有关。
However, the performance of LDPC code depends on the girth of its bipartite graph, that is it depends on its sparse parity-check matrices H, especially the complexity of encoding with H.
该算法采用人们熟悉的树型数据结构，可以较为合理地表示稀疏校验矩阵中行与列中非零元素的跳转关系。
This algorithm used the data of tree structure, and could more reasonably the skipping relations of the non-zero elements in the rows and lines of the sparse check matrix.
LDPC码是一种可以接近香农限的线性分组码，可通过稀疏奇偶校验矩阵来构造，也可以用因子图来构成。
Low Density parity check (LDPC) codes are a kind of linear block codes approaching Shannon limit. They can be constructed either with spare parity-check matrix or with factor graphs.
该方法利用一个短的LDPC码的校验矩阵作为其母矩阵，在此基础上采用循环置换矩阵构造一个长的LDPC码。
The method used a parity-check matrix of a short LDPC code as its mother matrix upon which a long code was constructed with circulant permutation matrices.
在校验矩阵构造方面，PEG的构造方法在度约束条件下能最大化环长，从而降低误码平层。同时准循环码在结构化方面也有很多优点。
When constructing a parity-check matrix, PEG can maximize the girth length, thus lowering error-floor, while quasi-cyclic structure bears other advantages.
证明了BCH码的校验矩阵是用循环变换的特征向量作基底时的一种表示形式，从而把循环码的研究纳入到线性系统理论研究的框架之中。
It is proved that the parity check matrix for BCH code is a representation form in the eigenvector basis. Thus the study on cyclic codes may be brought into the framework of linear system theory.
摘要结构化低密度奇偶校验码可通过基矩阵和扩展因子描述，具有较低的编译码复杂度和优异的译码性能。
Abstract : The structured low density parity check (LDPC) codes can be described by the base-matrices and lifting factors, which have low encoding/decoding complexity and good coding performance.
校验码算法，采取矩阵移位算法，网络通讯中经常使用。
CRC Check Code algorithm, take the matrix transposition algorithm, frequently used in network communications.
校验码算法，采取矩阵移位算法，网络通讯中经常使用。
CRC Check Code algorithm, take the matrix transposition algorithm, frequently used in network communications.
应用推荐