首页 | 本学科首页   官方微博 | 高级检索  
     

常重复合码的构造和界
引用本文:杨建生,杨小青. 常重复合码的构造和界[J]. 应用数学与计算数学学报, 2013, 0(4): 433-442
作者姓名:杨建生  杨小青
作者单位:上海大学理学院,上海200444
基金项目:上海高校一流学科(B)类经费资助项目
摘    要:摘要给出了一种Chebyshev距离下的常重复合码的构造,并在其基础上讨论了它的译码算法和优化处理.考虑了Chebyshev距离下的界及其改进.研究了具有Chebyshev距离和Hamming距离的常重复合码的构造,给出了Hamming距离为4的常重复合码的一个结论.

关 键 词:常重复合码  Chebyshev距离  Hamming距离  重复排列

Construction and bounds of constant composition codes
YANG Jian-sheng,YANG Xiao-qing. Construction and bounds of constant composition codes[J]. Communication on Applied Mathematics and Computation, 2013, 0(4): 433-442
Authors:YANG Jian-sheng  YANG Xiao-qing
Affiliation:(College of Sciences, Shanghai University, Shanghai 200444, China)
Abstract:A construction of constant composition codes under the Chebysnev distance is given, and their error correcting algorithm and optimization are dis- cussed based on the construction. The bounds under the Chebyshev distance and their improvement are considered. The construction of constant composition codes under the Chebyshev distance and the Hamming distance is researched, and a conclusion about constant composition codes with the Hamming distance four is given.
Keywords:constant composition code  Chebyshev distance  Hamming distance  repeated permutation
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号