Analysis of Linear Block Codes as Sources with Memory
Résumé
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.
Domaines
Electronique
Origine : Fichiers produits par l'(les) auteur(s)
Loading...