6533b834fe1ef96bd129d859

RESEARCH PRODUCT

A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay

Laura GiambrunoJean NéraudCarla SelmiSabrina Mantaci

subject

Prefix codeStrongly connected componentTheoretical computer scienceGeneralizationdeciphering delayData_CODINGANDINFORMATIONTHEORY0102 computer and information sciences02 engineering and technology01 natural sciences[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Encoding (memory)0202 electrical engineering electronic engineering information engineeringCode (cryptography)Computer Science (miscellaneous)prefix (free) codeunlabeled graphMathematicsCode[MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]020206 networking & telecommunicationsCode; deciphering delay; prefix (free) code; strongly connected component; transducer; unlabeled graph; Computer Science (miscellaneous)Prefixtransducer[INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT]010201 computation theory & mathematicsGraph (abstract data type)strongly connected componentAlgorithmDecoding methods

description

Girod’s encoding method has been introduced in order to efficiently decode from both directions messages encoded by using finite prefix codes. In the present paper, we generalize this method to finite codes with a finite deciphering delay. In particular, we show that our decoding algorithm can be realized by a deterministic finite transducer. We also investigate some properties of the underlying unlabeled graph.

yearjournalcountryeditionlanguage
2012-08-14
10.1142/s0129054115500410http://www.worldscinet.com/ijfcs/ijfcs.shtml