analysis of linear block codes as sources with memory

Clicks: 177
ID: 162847
2010
Article Quality & Performance Metrics
Overall Quality Improving Quality
0.0 /100
Combines engagement data with AI-assessed academic quality
AI Quality Assessment
Not analyzed
Abstract
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.
Reference Key
g.2010advancesanalysis Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;ZAHARIA, G.;TARNICERIU, D.;MUNTEANU, V.
Journal JMIR mHealth and uHealth
Year 2010
DOI
10.4316/AECE.2010.04012
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.