Notes on the P-content algorithm

N. Ekstrand; B. Smeets

doi:10.1109/ISIT.1998.708626

Notes on the P-content algorithm

N. Ekstrand, B. Smeets

Lund University

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

Abstract

The P-context algorithm as introduced by Weinberger and Seroussi (see IEEE Trans. Inform. Theory, p.1697-1706, 1996) offers a way to reduce the parameter description costs. This paper concerns a possible improvement of the P-context algorithm. By using weighting techniques an accurate redundancy bound is derived and a possible implementation is proposed.

Original language	English
Title of host publication	Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
Publisher	IEEE - Institute of Electrical and Electronics Engineers Inc.
Pages	46-46
Number of pages	1
ISBN (Print)	0780350006, 9780780350007
DOIs	https://doi.org/10.1109/ISIT.1998.708626
Publication status	Published - 1998
Event	1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States Duration: 1998 Aug 16 → 1998 Aug 21

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	1998 IEEE International Symposium on Information Theory, ISIT 1998
Country/Territory	United States
City	Cambridge, MA
Period	1998/08/16 → 1998/08/21

Subject classification (UKÄ)

Computer Sciences
Signal Processing

Access to Document

10.1109/ISIT.1998.708626

Cite this

@inproceedings{b7ea966a59f149f4bbceb0d4fed431e2,

title = "Notes on the P-content algorithm",

abstract = "The P-context algorithm as introduced by Weinberger and Seroussi (see IEEE Trans. Inform. Theory, p.1697-1706, 1996) offers a way to reduce the parameter description costs. This paper concerns a possible improvement of the P-context algorithm. By using weighting techniques an accurate redundancy bound is derived and a possible implementation is proposed.",

author = "N. Ekstrand and B. Smeets",

year = "1998",

doi = "10.1109/ISIT.1998.708626",

language = "English",

isbn = "0780350006",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",

pages = "46--46",

booktitle = "Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998",

address = "United States",

note = "1998 IEEE International Symposium on Information Theory, ISIT 1998 ; Conference date: 16-08-1998 Through 21-08-1998",

}

Ekstrand, N & Smeets, B 1998, Notes on the P-content algorithm. in Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998., 708626, IEEE International Symposium on Information Theory - Proceedings, IEEE - Institute of Electrical and Electronics Engineers Inc., pp. 46-46, 1998 IEEE International Symposium on Information Theory, ISIT 1998, Cambridge, MA, United States, 1998/08/16. https://doi.org/10.1109/ISIT.1998.708626

Notes on the P-content algorithm. / Ekstrand, N.; Smeets, B.
Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998. IEEE - Institute of Electrical and Electronics Engineers Inc., 1998. p. 46-46 708626 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

TY - GEN

T1 - Notes on the P-content algorithm

AU - Ekstrand, N.

AU - Smeets, B.

PY - 1998

Y1 - 1998

N2 - The P-context algorithm as introduced by Weinberger and Seroussi (see IEEE Trans. Inform. Theory, p.1697-1706, 1996) offers a way to reduce the parameter description costs. This paper concerns a possible improvement of the P-context algorithm. By using weighting techniques an accurate redundancy bound is derived and a possible implementation is proposed.

AB - The P-context algorithm as introduced by Weinberger and Seroussi (see IEEE Trans. Inform. Theory, p.1697-1706, 1996) offers a way to reduce the parameter description costs. This paper concerns a possible improvement of the P-context algorithm. By using weighting techniques an accurate redundancy bound is derived and a possible implementation is proposed.

U2 - 10.1109/ISIT.1998.708626

DO - 10.1109/ISIT.1998.708626

M3 - Paper in conference proceeding

AN - SCOPUS:84890359759

SN - 0780350006

SN - 9780780350007

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 46

EP - 46

BT - Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998

PB - IEEE - Institute of Electrical and Electronics Engineers Inc.

T2 - 1998 IEEE International Symposium on Information Theory, ISIT 1998

Y2 - 16 August 1998 through 21 August 1998

ER -

Notes on the P-content algorithm

Abstract

Publication series

Conference

Subject classification (UKÄ)

Access to Document

Fingerprint

Cite this