Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18324550

Redundancy of the context-tree weighting method on renewal and markov renewal processes

Author
GARIVIER, Aunélien1
[1] Université Paris Sud of Orsay, 91405 Orsay, France
Source

IEEE transactions on information theory. 2006, Vol 52, Num 12, pp 5579-5586, 8 p ; ref : 20 ref

CODEN
IETTAW
ISSN
0018-9448
Scientific domain
Telecommunications
Publisher
Institute of Electrical and Electronics Engineers, New York, NY
Publication country
United States
Document type
Article
Language
English
Author keyword
Adaptivity context tree weighting (CTW) method minimax redundancy renewal processes source coding
Keyword (fr)
Codage source Erreur approximation Erreur estimation Estimation erreur Fonction logarithmique Méthode minimax Pondération Processus Markov Processus renouvellement Redondance Signal Markov Arbre contextuel
Keyword (en)
Source coding Approximation error Estimation error Error estimation Logarithmic function Minimax method Weighting Markov process Renewal process Redundancy Markov signal Context tree
Keyword (es)
Error aproximación Error estimación Estimación error Función logarítmica Método minimax Ponderación Proceso Markov Proceso renovación Redundancia Señal Markov Arbol contextual
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04A Information, signal and communications theory / 001D04A04 Signal and communications theory / 001D04A04B Coding, codes

Discipline
Telecommunications and information theory
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
18324550

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web