Idioma:

Grammar-based codes: a new class of universal lossless source codes

Kieffer, J.C. ; En-Hui Yang

IEEE transactions on information theory, 2000-05, Vol.46 (3), p.737-754 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Grammar-based codes: a new class of universal lossless source codes
Autor: Kieffer, J.C. ; En-Hui Yang
Assuntos: Codes ; Computer programming ; Grammar ; Redundancy
É parte de: IEEE transactions on information theory, 2000-05, Vol.46 (3), p.737-754
Notas: ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
Descrição: We investigate a type of lossless source code called a grammar-based code, which, in response to any input data string x over a fixed finite alphabet, selects a context-free grammar G/sub x/ representing x in the sense that x is the unique string belonging to the language generated by G/sub x/. Lossless compression of x takes place indirectly via compression of the production rules of the grammar G/sub x/. It is shown that, subject to some mild restrictions, a grammar-based code is a universal code with respect to the family of finite-state information sources over the finite alphabet. Redundancy bounds for grammar-based codes are established. Reduction rules for designing grammar-based codes are presented.
Editor: New York: IEEE
Idioma: Inglês

Voltar para lista de resultados

Anterior Resultado 6 Avançar Ir para próxima página