Analysis of Linear Block Codes as Sources with Memory
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 deri...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Stefan cel Mare University of Suceava
2010-11-01
|
Series: | Advances in Electrical and Computer Engineering |
Subjects: | |
Online Access: | http://dx.doi.org/10.4316/AECE.2010.04012 |
id |
doaj-520aaee32b824618bddd15d2b73af8d7 |
---|---|
record_format |
Article |
spelling |
doaj-520aaee32b824618bddd15d2b73af8d72020-11-24T23:34:55ZengStefan cel Mare University of SuceavaAdvances in Electrical and Computer Engineering1582-74451844-76002010-11-01104778010.4316/AECE.2010.04012Analysis of Linear Block Codes as Sources with MemoryZAHARIA, G.TARNICERIU, D.MUNTEANU, V.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. http://dx.doi.org/10.4316/AECE.2010.04012information quantitieslinearblock codessources with memory |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
ZAHARIA, G. TARNICERIU, D. MUNTEANU, V. |
spellingShingle |
ZAHARIA, G. TARNICERIU, D. MUNTEANU, V. Analysis of Linear Block Codes as Sources with Memory Advances in Electrical and Computer Engineering information quantities linear block codes sources with memory |
author_facet |
ZAHARIA, G. TARNICERIU, D. MUNTEANU, V. |
author_sort |
ZAHARIA, G. |
title |
Analysis of Linear Block Codes as Sources with Memory |
title_short |
Analysis of Linear Block Codes as Sources with Memory |
title_full |
Analysis of Linear Block Codes as Sources with Memory |
title_fullStr |
Analysis of Linear Block Codes as Sources with Memory |
title_full_unstemmed |
Analysis of Linear Block Codes as Sources with Memory |
title_sort |
analysis of linear block codes as sources with memory |
publisher |
Stefan cel Mare University of Suceava |
series |
Advances in Electrical and Computer Engineering |
issn |
1582-7445 1844-7600 |
publishDate |
2010-11-01 |
description |
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. |
topic |
information quantities linear block codes sources with memory |
url |
http://dx.doi.org/10.4316/AECE.2010.04012 |
work_keys_str_mv |
AT zahariag analysisoflinearblockcodesassourceswithmemory AT tarniceriud analysisoflinearblockcodesassourceswithmemory AT munteanuv analysisoflinearblockcodesassourceswithmemory |
_version_ |
1725527117466173440 |