New decoding algorithms for super-symmetric rank codes

摘要：

New decoding algorithms for the super-symmetric rank codes 1 are constructed. They include the recurrent decoding algorithm and the majority decoding algorithm. The super-symmetric rank codes are rank-metric codes over binary fields with lengths Ns = 2s, s = 0, 1,... , where codes of length Ns are designed recursively from codes of length Ns.1. This provides block symmetry construction of code matrices and allows to decode corrupted received matrices starting with a small size. The new decoding algorithms are described and simulation results are presented.

关键词： Rank codes recurrent decoding algorithm,majority decoding algorithm.

作者: Ernst M.Gabidulin Nina I.Pilipchuk

作者单位: Moscow Institute of Physics and Technology (State University)

会议类型: 国际会议

会议名称: The IET 2nd International Conference on Wireless,Mobile & Multimedia Networks(第二届IET国际无线移动多媒体网络会议)

会议地点: 北京

会议语种:英文

在线出版日期: 2008-10-12（万方平台首次上网日期，不代表论文的发表时间）