On normal and subnormal q-ary codes

被引:0
作者
机构
[1] Lobstein, Antoine C.
[2] van Wee, Gerhard J.M.
来源
Lobstein, Antoine C. | 1600年 / 35期
关键词
Codes; Symbolic;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 41 条
[21]   Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary Kernels [J].
Mori, Ryuhei ;
Tanaka, Toshiyuki .
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, :894-898
[22]   On Zero-Knowledge Identification Based on q-ary Syndrome Decoding [J].
Hu, Rong ;
Morozov, Kirill ;
Takagi, Tsuyoshi .
2013 EIGHTH ASIA JOINT CONFERENCE ON INFORMATION SECURITY (ASIAJCIS), 2013, :12-18
[23]   Q-ary LDPC Decoder with Euclidean-Distance-Based Sorting Criterion [J].
Shen, X. H. ;
Lau, Francis C. M. .
IEEE COMMUNICATIONS LETTERS, 2010, 14 (05) :444-446
[24]   Constructions of link-fault-tolerant q-ary k-cube networks [J].
Tsai, J ;
Kuo, SY .
ELECTRONICS LETTERS, 1997, 33 (12) :1025-1026
[25]   A Note on Constant Weight Sequences over q-Ary from Cyclic Difference Sets [J].
Kaida, Takayasu ;
Zheng, Junru .
IWSDA'09: PROCEEDINGS OF THE FOURTH INTERNATIONAL WORKSHOP ON SIGNAL DESIGN AND ITS APPLICATIONS IN COMMUNICATIONS, 2009, :112-+
[26]   Construction of q-ary Constant Weight Sequences using a Knuth-like Approach [J].
Mambou, Elie N. ;
Swart, Theo G. .
2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, :2028-2032
[27]   A Constrained Coding Scheme for Correcting Asymmetric Magnitude-1 Errors in q-Ary Channels [J].
Hemo, Evyatar ;
Cassuto, Yuval .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (02) :918-932
[28]   Dynamic Bubble-Check Algorithm for Check Node Processing in Q-Ary LDPC Decoders [J].
Lin, Wei ;
Bai, Baoming ;
Ma, Xiao ;
Sun, Rong .
IEICE TRANSACTIONS ON COMMUNICATIONS, 2012, E95B (05) :1815-1818
[29]   On the Design of Repetition-Based Slotted ALOHA Operated With q-Ary Compute-Forward [J].
Yang, Tao ;
Xi, Zhiyu ;
Ren, Wencheng ;
Yu, Fangtao .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2024, 73 (10) :15675-15680
[30]   Codes on graphs: Normal realizations [J].
Forney, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :520-548