Random quantization bounds for lattices over q-ary linear codes

被引:0
|
作者
Yurkov, Kinh V. [1 ]
Kudryashov, Boris D. [1 ]
机构
[1] St Petersburg Univ Aerosp Instrumentat, Dept Informat Sci, St Petersburg 190000, Russia
关键词
D O I
10.1109/ISIT.2007.4557232
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. The efficiency of the lattice-based quantization depends on a lattice parameter called the normalized second moment of Voronoi region. It is shown that there exist lattices over q -ary linear codes with normalized second moment value close to the theoretical limits. Particularly, the coding gain achievable by lattice over ternary codes is equal to 1.5321 dB which is less than 0.01 dB away from the coding gain provided by optimum non-structured vector quantizers.
引用
收藏
页码:236 / +
页数:2
相关论文
共 50 条
  • [1] Some new bounds for q-ary linear block codes
    Xiao, M
    Wang, XM
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (05) : 1996 - 1998
  • [2] Linear Programming Bounds on the Kissing Number of q-ary Codes
    Sole, Patrick
    Liu, Yi
    Cheng, Wei
    Guilley, Sylvain
    Rioul, Olivier
    [J]. 2021 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
  • [3] Bounds on the Error Probability of Nonbinary Linear Codes over the Q-ary Symmetric Channel
    Ben Yacoub, Emna
    Liva, Gianluigi
    Paolini, Enrico
    [J]. 2021 55TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2021,
  • [4] LOWER BOUNDS FOR Q-ARY COVERING CODES
    CHEN, W
    HONKALA, IS
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (03) : 664 - 671
  • [5] LOWER BOUNDS FOR Q-ARY COVERING CODES
    CHEN, WD
    HONKALA, IS
    [J]. CHINESE SCIENCE BULLETIN, 1990, 35 (06): : 521 - 522
  • [6] A note on bounds for q-ary covering codes
    Bhandari, MC
    Durairajan, C
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (05) : 1640 - 1642
  • [7] LOWER BOUNDS FOR q-ARY COVERING CODES
    陈文德
    IIRO S. HONKALA
    [J]. Science Bulletin, 1990, (06) : 521 - 522
  • [8] Lower Bounds on the Minimum Pseudodistance for Linear Codes with q-ary PSK Modulation over AWGN
    Skachek, Vitaly
    Flanagan, Mark F.
    [J]. 2008 5TH INTERNATIONAL SYMPOSIUM ON TURBO CODES AND RELATED TOPICS, 2008, : 426 - +
  • [9] UPPER-BOUNDS FOR Q-ARY COVERING CODES
    OSTERGARD, PRJ
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (03) : 660 - 664
  • [10] Bounds and constructions for q-ary constant composition codes
    Luo, YA
    Fu, FW
    Vinck, AJH
    Chen, WD
    [J]. ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 485 - 485