By Topic

Characterization of linear block codes as cyclic sources with memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zaharia, G. ; INSA, Univ. Europeenne de Bretagne, Rennes, France ; Munteanu, V. ; Tarniceriu, D.

Considering the input data generated by a binary Markov source X, linear, binary, block codes are characterized as cyclic sources with memory. The encoding graph for systematic linear block codes is determined. It is shown the encoded data are the output of a binary, cyclic source with memory. The states of this source Y are organized in n classes of states, where n is the length of the code words. The matrix PY of transition probabilities between states is derived, as well as the matrix πy containing the states probabilities. Finally, the entropy H(Y) is computed and a relationship between H(Y) and H(X) is derived.

Published in:

Signals, Circuits and Systems (ISSCS), 2011 10th International Symposium on

Date of Conference:

June 30 2011-July 1 2011