Absolute minimal trellis complexities of extended codes and their dual codes of two types of linear block codes whose code length is odd are given 給出了兩類奇數(shù)碼長線性分組碼的擴展碼及其對偶碼的絕對最小網(wǎng)格圖復(fù)雜度。
Although the estimation algorithm is carried out by parity check code , but it is also applicable in general linear block codes to estimate the channel ’ s parameter 本文算法不僅可以利用偶校驗碼的碼結(jié)構(gòu)去估計信道參數(shù),而且對于一般的線性分組碼也適用。
The other is the modified hamming bound , also the geometry of the bound is introduced . the fourth chapter is about the linear block codes and their unequal error protection capability 第三章主要證明了兩個關(guān)于非均勻保護(hù)的性能限,這兩個性能限不僅對線性碼有效,對非線性碼同樣有效。
Among the linear block codes , rs code is an important one widely used in modern digital communications , which can correct both random and bursty errors with the most powerful error - correcting capability Rs碼是一種典型的糾錯碼,在線性分組碼中,它具有最強的糾錯能力,既能糾正隨機錯誤,也能糾正突發(fā)錯誤。
Ldpc ( low density parity check ) code is a kind of linear block code that defined by very sparse parity matrix or tanner graph , and it is also called gallager code since gallager initially presented it Ldpc ( lowdensityparitycheck )碼是一類用非常稀疏的校驗矩陣或二分圖定義的線性分組糾錯碼,最初由gallager發(fā)現(xiàn),故亦稱gallager碼。
The linear block code is called a binary low - density parity - check code if it is based on a sparse parity - check matrix . this sort of code was originally proposed by dr . gallager in 1962 , which cannot attract a large amount of interest at that time 低密度奇偶校驗( ldpc )碼是基于稀疏校驗矩陣的線性分組碼,它最初由gallager于1962年提出,當(dāng)時并未受到人們的重視。
Some results on the undetected error probability of linear codes for pure error - detection are , at present , generalized for both error detection and correction . an analytic formula is obtained to calculate the undetected error probability of linear block codes for simultaneous error detection and correction 在只檢錯時,證明了糾正兩個錯誤擴展bch碼是最佳檢錯碼; m大于4的非線性等重碼( 2m , 2 , m )不是最佳碼。
Being an important linear block code in error control field , the reed - solomon ( rs ) code has very strong capability of correcting random and burst errors , which is widely used in various modern communication systems to satisfy the requirement of channel reliability Rs ( reed - solomon )碼是差錯控制領(lǐng)域中一類重要的線性分組碼,由于具有很強的糾錯能力,因而被廣泛地應(yīng)用于各種現(xiàn)代通信系統(tǒng)中,以滿足對信道可靠性的要求。