# On minimal redundancy codes.

Stochastica (1982)

- Volume: 6, Issue: 2, page 85-102
- ISSN: 0210-7821

## Access Full Article

top## Abstract

top## How to cite

topDe Luca, Aldo, and Sessa, Maria I.. "On minimal redundancy codes.." Stochastica 6.2 (1982): 85-102. <http://eudml.org/doc/38873>.

@article{DeLuca1982,

abstract = {A code X over the alphabet A is complete if the submonoid X* generated by X meets all two-sided ideals of A*. If one measures the cost of a finite code X over A, with respect to a given information source S, by the quantity gamma(X) = <X> ln |A|, we say that X is completely optimal for S if it does not exist any code X', over an arbitrary alphabet, such that gamma (X') < gamma (X). One can show that for |X| ≤ 5 a completely optimal code has to be complete. However for |X| > 5 there exist uncomplete codes with the property of having a bounded synchronization delay and a redundancy which is minimal. From the information point of view these uncomplete codes should be preferred to the complete ones, which are such to have, except for the biprefix case, an infinite delay of deciphering in at least one direction. Moreover for some values of |X| complete biprefix codes do not exist.},

author = {De Luca, Aldo, Sessa, Maria I.},

journal = {Stochastica},

keywords = {Teoría de la información; Codificación; Detección de señales; finite code; information source; completely optimal; arbitrary alphabet; uncomplete codes; complete biprefix codes},

language = {eng},

number = {2},

pages = {85-102},

title = {On minimal redundancy codes.},

url = {http://eudml.org/doc/38873},

volume = {6},

year = {1982},

}

TY - JOUR

AU - De Luca, Aldo

AU - Sessa, Maria I.

TI - On minimal redundancy codes.

JO - Stochastica

PY - 1982

VL - 6

IS - 2

SP - 85

EP - 102

AB - A code X over the alphabet A is complete if the submonoid X* generated by X meets all two-sided ideals of A*. If one measures the cost of a finite code X over A, with respect to a given information source S, by the quantity gamma(X) = <X> ln |A|, we say that X is completely optimal for S if it does not exist any code X', over an arbitrary alphabet, such that gamma (X') < gamma (X). One can show that for |X| ≤ 5 a completely optimal code has to be complete. However for |X| > 5 there exist uncomplete codes with the property of having a bounded synchronization delay and a redundancy which is minimal. From the information point of view these uncomplete codes should be preferred to the complete ones, which are such to have, except for the biprefix case, an infinite delay of deciphering in at least one direction. Moreover for some values of |X| complete biprefix codes do not exist.

LA - eng

KW - Teoría de la información; Codificación; Detección de señales; finite code; information source; completely optimal; arbitrary alphabet; uncomplete codes; complete biprefix codes

UR - http://eudml.org/doc/38873

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.