Analysis of Linear Block Codes as Sources with Memory

被引：3
|
作者：
Munteanu, Valeriu [1 ]
Tarniceriu, Daniela [1 ]
Zaharia, Gheorghe [2 ]
机构：
[1] Gheorghe Asachi Tech Univ Iasi, Fac Elect Telecommun & Informat Technol, Iasi 700506, Romania
[2] CNRS, IETR INSA, UMR 6164, Rennes, France
来源：
ADVANCES IN ELECTRICAL AND COMPUTER ENGINEERING | 2010年 / 10卷 / 04期
关键词：
information quantities; linear; block codes; sources with memory;
D O I：
10.4316/AECE.2010.04012
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The linear, binary, block codes with no equally likely probabilities for the binary symbols are analyzed. The encoding graph for systematic linear block codes is proposed. These codes are seen as sources with memory and the information quantities H(S, X), H(S), H(X), H(X vertical bar S), H(S vertical bar X), I(S, X) are derived. On the base of these quantities, the code performances are analyzed.
引用
收藏
页码：77 / 80
页数：4
相关论文
共 50 条
  • [21] On the BCJR trellis for linear block codes
    McEliece, RJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (04) : 1072 - 1092
  • [22] Generalized Tunstall codes for sources with memory
    Savari, SA
    Gallager, RG
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (02) : 658 - 668
  • [23] On importance sampling for linear block codes
    Xia, B
    Ryan, WE
    2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5: NEW FRONTIERS IN TELECOMMUNICATIONS, 2003, : 2904 - 2908
  • [24] The error distribution of linear block codes
    Li, K
    Motani, M
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 464 - 464
  • [25] Turbo decoding of linear block codes
    Yue, DW
    Shwedyk, E
    2001 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING, VOLS I AND II, CONFERENCE PROCEEDINGS, 2001, : 107 - 110
  • [26] The Trapping Redundancy of Linear Block Codes
    Laendner, Stefan
    Hehn, Thorsten
    Milenkovic, Olgica
    Huber, Johannes B.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (01) : 53 - 63
  • [27] Concentration of Magnetization for Linear Block Codes
    Korada, Satish Babu
    Kudekar, Shrinivas
    Macris, Nicolas
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 1433 - 1437
  • [28] Subcode graphs of linear block codes
    Mittelholzer, T
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 116 - 116
  • [29] A memory-efficient optimal APP symbol-elecoding algorithm for linear block codes
    Trofimov, A
    Johansson, T
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (09) : 1429 - 1434
  • [30] LINEAR CODES FOR MASKING MEMORY DEFECTS
    CHEN, CL
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (01) : 105 - 106
12345