Open AccessAnalysis of Linear Block Codes as Sources with Memory
Author(s) -
Valeriu Munteanu,
Daniela Tărniceriu,
Gheorghe Zaharia
Publication year - 2010
Publication title -
advances in electrical and computer engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.254
H-Index - 23
eISSN - 1844-7600
pISSN - 1582-7445
DOI - 10.4316/aece.2010.04012
Subject(s) - computer science , block (permutation group theory) , block code , arithmetic , parallel computing , algorithm , mathematics , decoding methods , combinatorics
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|S), H(S|X), I(S,X) are derived. On the base of these quantities, the code performances are analyzed