共查询到19条相似文献,搜索用时 125 毫秒
1.
研究了二元等距码、等重等距码及其距离分布的Q-变换。通过使用Q-变换分布的性质,研究了二元等距码和等重等距码的最大码字数并得到2个新的上界,这些上界在某些情况下优于已知的结果。 相似文献
2.
等距码的对偶距离分布及其性质 总被引:5,自引:2,他引:3
本文主要讨论了等距码的对偶距离分布及其性质,然后利用这些性质将[1]中的某些结果推广到q元等距码情形,并得到了其对偶距离分布的递推关系式,最后,本文给出了q元等距码的码字数目的一个上界。 相似文献
3.
4.
本文研究了线性码编码的MSK调制系统。指出在插入一个简单差分编码网络后,线性码的优化问题在汉明距离与在欧氏距离上是一致的,从而解决了线性码编码的MSK调制问题。由于插入网络简单、便于实现,因此在MSK上使用最优线性码调制在实践上是可行的。 相似文献
5.
6.
环F2+uF2上线性码及其对偶码的二元象 总被引:1,自引:0,他引:1
利用环F2+uF2上线性码C的生成矩阵给出了码C的对偶码C^┴及其Gray象Ф(C)的生成矩阵,证明了环F2+uF2上线性码及其对偶码的Gray象仍是对偶码。并由此给出了一个环F2+uF2如上线性码为自对偶码的充要条件。 相似文献
7.
8.
9.
10.
11.
利用GRS(generalized reed-solomon)码的生成多项式提出了基于改进的2-D GRS(two-dimensional GRS)码设计和构造QC-LDPC(quasi-cyclic low density parity-check)码的方法,使所构造的码具有较好的译码性能。同时在码的构造过程中,考虑到了准双对角线结构和合适的度分布。不同码率的LDPC码用于和新设计的QC-LDPC码进行测试和比较。实验结果表明,所提出的码构造方法可加快LDPC码校验矩阵的构造,同时基于所提出方法构造的QC-LDPC码可提高译码性能,并降低编码复杂度。 相似文献
12.
The problem of Gray image of constacyclic code over finite chain ring is studied. A Gray map between codes over a finite chain ring and a finite field is defined. The Gray image of a linear constacyclic code over the finite chain ring is proved to be a distance invariant quasi-cyclic code over the finite field. It is shown that every code over the finite field, which is the Gray image of a cyclic code over the finite chain ring, is equivalent to a quasi-cyclic code. 相似文献
13.
The problem of Gray image of constacyclic code over finite chain ring is studied. A Gray map between codes over a finite chain ring and a finite field is defined. The Gray image of a linear constacyclic code over the finite chain ring is proved to be a distance invariant quasi-cyclic code over the finite field. It is shown that every code over the finite field, which is the Gray image of a cyclic code over the finite chain ring, is equivalent to a quasi-cyclic code. 相似文献
14.
15.
16.
宋成 《太赫兹科学与电子信息学报》2011,9(2):165-168
遥测信道是一种典型的时变衰落信道,为弥补信道衰落对信息传输质量的影响,通常采用纠错编码的方法比单纯依靠加大系统功率裕量的方法更有意义。根据RS码的相关理论及编译码原理,结合遥测信道的特点,提出了RS码与卷积码级联的编译码方案,最后对该级联码的方案进行了软件仿真和硬件设计。实现结果表明级联码的增益要优于单纯的卷积码2 dB。 相似文献
17.
徐大专 《电子科学学刊(英文版)》1994,11(1):37-43
The definition of good codes for error-detection is given. It is proved that a (n, k) linear block code in GF(q) are the good code for error-detection, if and only if its dual code is also. A series of new results about the good codes for error-detection are derived. New lower bounds for undetected error probabilities are obtained, which are relative to n and k only, and not the weight structure of the codes. 相似文献
18.
19.
Peng Li Zhu Guangxi 《电子科学学刊(英文版)》2006,23(1):35-38
This paper presents a matrix permuting approach to the construction of Low-Density Parity-Check (LDPC) code. It investigates the structure of the sparse parity-check matrix defined by Gallager. It is discovered that the problem of constructing the sparse parity-check matrix requires an algorithm that is efficient in search environments and also is able to work with constraint satisfaction problem. The definition of Q-matrix is given, and it is found that the queen algorithm enables to search the Q-matrix. With properly permuting Q-matrix as sub-matrix, the sparse parity-check matrix which satisfied constraint condition is created, and the good regular-LDPC code that is called the Q-matrix LDPC code is generated. The result of this paper is significant not only for designing low complexity encoder, improving performance and reducing complexity of iterative decoding arithmetic, but also for building practical system of encodable and decodable LDPC code. 相似文献