SQLite format 3@ 0/X+?indexsqlite_autoindex_bibtab_1bibtabj/tablenamtabnamtabCREATE TABLE namtab (
name TEXT NOT NULL UNIQUE,
count INTEGER
)+?indexsqlite_autoindex_namtab_1namtab{QtablestrtabstrtabCREATE TABLE strtab (
key TEXT,
value TEXT,
entry TEXT NOT NULL UNIQUE
)+?indexsqlite_autoindex_strt+K
,
)ysmga[UOIC=71+%
cackdsDavid Salomon, Professor Emeritus, Department of Computer Science, California State University, Northridge, Northridge, CA 91)ǂ )Ƃ)Â) )){)s)k)d)[)T)J)A);)6)0)))")))))){)u)o)i)c)_)X)T)O)I)B):)3),)$))))
)))fkPy5)D)?@String{jINFRETR = "Information Retrieval"}Y)+@String{jIEEETRANSPATTANALMACHINTEL = "IEEE Transactions on Pattern
Analysis and Machine Intelligence"}R)8u@String{jIEEEMULTIMEDIA = "IEEE MultiMedia"}H)L@String{jFUTGENCOMPSYS = "Future Generation Computer Systems"}<)D@String{jCVGIPGMIP = "Computer Vision, Graphics, and Image
Processing. Graphical Models and Image
Processing"}0)@String{jCOMPVISIMAGE)S'@String{jREVINSTINTSTATIST = "Revue de l'Institut international de
statistique = Review of the International
Statistical Institute"})+@String{jIEEETRANSPATTANALMACHINTEL = "IEEE Transactions on Pattern
Analysis and Machine Intelligence"}R_*~xrlf`ZTNHB<60*$vpjd^XRLF@:4.("
9 Ioannis Papaefstathiou.# WangHua Mo
S. Kwatra
,! N.T. Wang+S. Mitra*% Kee Siong Ng)+Yu. M. Shtarkov( S. Milani'# V. Castelli&# Kent Wai Ng
%M. Fresia
$G. Shavit#5 Kenneth R. McConnell"' Davide Zordan"!IJames A.*U*$*u*E**d*4**P* *n*<*{*xY*u(*tu*rB*o*m`*i*f*bK*_*^f*]7*\*ZU*Y#*Xr*U?*T*R\*P**Ox*LH*K*Hf*D7*@*>P*=*;l*:;*7 *5W*3%*1t*/E*,**e*)5*'*%T* !*n*?**[*+*{*J**f*6**U*$*s*A))])*){)H))e)1))M))j)8))T)߄$)݃s)ۃE)ك)ׂ_)Ղ0)ҁ~)ЁK))h)3*kzdN5m[I0\wZF/xx*
1Michael A. PechuraZ)!Yuan Zhang*
#Xuguang Lan)'WenJyi Hwang*!V. K. Jain*7Thrasyvoulos Tsiatsos)
Tao Tian
)'T. C. Serebro* Shinichi Nakano)'S. Srinivasan)!S. Diggavi*5Rashmi Arun Patankar])/R. N. S. Horspool ))Qingming Huang)%P. Y. Simard@)#P. A. Floor*N. Farbern)'M. Srinivasan*1M. Douglas McIlroy`)#L. Westoverd)+Kenneth C. Barr)
K. Guptaq)
Joel Max )%Jan CornelisP*)J. Niittylahti)!J. Diamondw)'I. Daubechies;)%H. RaittinenR)'Gerd Suss ner)%MFranciscus Henricus Petrus Spaan*)Edward J. Delp*+Diego Arroyuelo{)'Daniel Gajski)%D. J. Fixsenu*%ChiKwun Kan !C)/Bimal Chandra Roy<)'Atsushi Ishiip)*+Y*%S. Agnihotrip*J. Klejsa
M%R~ytoje`[VQLGB=83.)$ysmga[UOIC=71+%
}wqke_YSMGA;5/)#`[YVUTQPO܁NׁLҁJǁIGEDB@>=<98x6u3m2j/g.d_,\*Y)V(R'O&L%9$6 /,(#
فЁ́~}zyvsqonmkjyilgge]cUaR_O^I]D\:Z3X0V)U&TSPONMLJHFC@?><:7643210.+(~'w$k!hfc^YR"d(`dGZs\ ;lˉ v98EZ<Z88=%K
@InProceedings{Desoky:1988:CID,
author = "Ahmed Desoky and Carol O'Connor and Thomas KleinigO
@InProceedings{Lee:1991:DIC,
author = "H. Lee and Y. Kim and A. H. Rowberg and E. A. Riski }}
@PhdThesis{Pasco:1976:S0a
@InProceedings{Cvetkovic:1998:ASC,
author = "Z. Cvetkovic",
title = "Accurate sub3<7o
@MastersThesis{Ye:2001:HTD,
author = "Zhong A. Ye",
title = "Hypothesis Testing ap
@Article{Komogortsev:2008:PRT,
author = "Oleg V. Komogortsev and Javed I. Khan",
title =8q
@InProceedings{Rollins:1992:PHW,
author = "M. Rollins and F. Carden",
title = "Po~&2e
@InProceedings{Hong:2001:GTW,
author = "E. S. Hong and R. E. Ladner and E. A. Riskin",
tqeK
@Book{Bell:1990:TC,
author = "Timothy C. Bell and John G. Cleary and Ian H. Witten",
tit TEXT,
MRclass TEXT,
MRnumber TEXT,
MRreviewer TEXT,
bibdate TEXT,
bibsource TEXT,
bibtimestamp TEXT,
note TEXT,
series TEXT,
URL TEXT,
abstract TEXT,
fjournal TEXT,
keywords TEXT,
language TEXT,
remark TEXT,
subject TEXT,
TOC TEXT,
ZMnumber TEXT,
acknowledgement TEXT,
advisor TEXT,
affiliation TEXT,
affiliationaddress TEXT,
ajournal TEXT,
annote TEXT,
articleno TEXT,
authordates TEXT,
bookDOI TEXT,
bookURL TEXT,
bookpages TEXT,
classcodes TEXT,
corpsource TEXT,
editordates TEXT,
howpublished TEXT,
journalURL TEXT,
journalabr TEXT,
key TEXT,
onlinedate TEXT,
reviewer TEXT,
subjectdates TEXT,
thesaurus TEXT,
treatment TEXT,
ZMclass TEXT,
issue TEXT,
rawabstract TEXT,
rawauthor TEXT,
rawbooktitle TEXT,
raweditor TEXT,
rawnote TEXT,
rawtitle TEXT,
entry TEXT NOT NULL UNIQUE
)
R%+?indexsqlite_autoindex_bibtab_1bibtabj/tablenamtabnamtabCREATE TABLE namtab (
name TEXT NOT NULL UNIQUE,
count INTEGER
)+?indexsqlite_autoindex_namtab_1namtab{QtablestrtabstrtabCREATE TABLE strtab (
key TEXT,
value TEXT,
entry TEXT NOT NULL UNIQUE
)+?indexsqlite_autoindex_strtab_1strtab
U(UT%windexbooktitleidxbibtab+ CREATE INDEX booktitleidx on bibtab (booktitle)Nqindexauthoridxbibtab*CREATE INDEX authoridx on bibtab (author)+?indexsqlite_autoindex_bibtab_1bibtabMutablebibtabbibtabCREATE TABLE bibtab (
authorcount INTEGER,
editorcount INTEGER,
pagecount INTEGER,
bibtype TEXT,
filename TEXT,
label TEXT,
author TEXT,
editor TEXT,
booktitle TEXT,
title TEXT,
crossref TEXT,
chapter TEXT,
journal TEXT,
volume TEXT,
type TEXT,
number TEXT,
institution TEXT,
organization TEXT,
publisher TEXT,
school TEXT,
address TEXT,
edition TEXT,
pages TEXT,
day TEXT,
month TEXT,
monthnumber TEXT,
year TEXT,
CODEN TEXT,
DOI TEXT,
ISBN TEXT,
ISBN13 TEXT,
ISSN TEXT,
ISSNL TEXT,
LCCNuralis",
publisher = "????",
address = "Naples[, Italy]",
pages = "??",
year = "1558",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "First edition, four volumes 1558, second edition, 20
volumes 1589. Translated by Thomas Young and Samuel
Speed, \booktitle{Natural Magick by John Baptista
Porta, a Neopolitane}, London 1658",
acknowledgement = ackds,
rawdata = "della Porta, Giambattista (1558) {\it Magia
Naturalis}, Naples, first edition, four volumes 1558,
second edition, 20 volumes 1589. Translated by Thomas
Young and Samuel Speed, {\it Natural Magick by John
Baptista Porta, a Neopolitane}, London 1658.",
} Porta, a Neopolitane}, London 1658Magia Naturalis
@Book{dellaPorta:1558:MN,
author = "Giambattista della Porta",
title = "Magia Naturalis",
publisher = "????",
address = "Naples[, Italy]",
pages = "??",
year = "1558",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "First edition, four volumes 1558, second edition, 20
volumes 1589. Translated by Thomas Young and Samuel
Speed, \booktitle{Natural Magick by John Baptista
Porta, a Neopolitane}, London 1658",
acknowledgement = ackds,
rawdata = "della Porta, Giambattista (1558) {\it Magia
Naturalis}, Naples, first edition, four volumes 1558,
second edition, 20 volumes 1589. Translated by Thomas
Young and Samuel Speed, {\it Natural Magick by John
Baptista Porta, a Neopolitane}, London 1658.",
} Toute une Aire plane.
({French}) [{On} a Curve that Completely Fills a Planar
Area]",
journal = jMATHANN,
volume = "36",
pages = "157160",
year = "1890",
CODEN = "MAANA3",
ISSN = "00255831 (print), 14321807 (electronic)",
ISSNL = "00255831",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Mathematische Annalen",
language = "French",
rawdata = "Peano, G. (1890) ``Sur Une Courbe Qui Remplit Toute
Une Aire Plaine,'' {\it Math. Annalen},
{\bf36}:157160.",
xxtitle = "Sur Une Courbe Qui Remplit Toute Une Aire Plaine",
}G. PeanoSur une Courbe Qui Remplit Toute une Aire plane. ({French}) [{On} a Curve that Completely Fills a Planar Area]
@Article{Peano:1890:CQR,
author = "G. Peano",
title = "Sur une Courbe Qui Remplit Toute une Aire plane.
({French}) [{On} a Curve that Completely Fills a Planar
Area]",
journal = jMATHANN,
volume = "36",
pages = "157160",
year = "1890",
CODEN = "MAANA3",
ISSN = "00255831 (print), 14321807 (electronic)",
ISSNL = "00255831",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Mathematische Annalen",
language = "French",
rawdata = "Peano, G. (1890) ``Sur Une Courbe Qui Remplit Toute
Une Aire Plaine,'' {\it Math. Annalen},
{\bf36}:157160.",
xxtitle = "Sur Une Courbe Qui Remplit Toute Une Aire Plaine",
}
aaW 31=++E};=+!bookdatacompression.bibdellaPorta:1558:MNGiambattista della PortaMagia NaturalisNaples[, Italy]1558Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTFirst edition, four volumes 1558, second edition, 20 volumes 1589. Translated by Thomas Young and Samuel Speed, booktitle Natural Magick by John Baptista Porta, a Neopolitane, London 1658ackdsGiambattista della PortaFirst edition, four volumes 1558, second edition, 20 volumes 1589. Translated by Thomas Young and Samuel Speed, \booktitle{Natural Magick by John Baptista
X 3)a!57E};7iarticledatacompression.bibPeano:1890:CQRG. PeanoSur une Courbe Qui Remplit Toute une Aire plane. (French) [On a Curve that Completely Fills a Planar Area]jMATHANN361571601890MAANA300255831 (print), 14321807 (electronic) OR 00255831 (print), 14321807 (electronic)00255831 OR 00255831Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTMathematische AnnalenFrenchackds a continuous
map of a line on a surface element]",
journal = jMATHANN,
volume = "38",
pages = "459460",
year = "1891",
CODEN = "MAANA3",
ISSN = "00255831 (print), 14321807 (electronic)",
ISSNL = "00255831",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Mathematische Annalen",
language = "German",
rawdata1 = "Heath, F. G. (1972) ``Origins of the Binary Code,''
{\it Scientific American}, {\bf227}(2):76, August.
Hilbert, D. (1891) ``Ueber stetige Abbildung einer
Linie auf ein Fl{\"a}chenst{\"u}ck,'' {\it Math.
Annalen}, {\bf38}:459460.",
rawdata2 = "Hilbert, D. (1891) ``Ueber stetige Abbildung einer
Linie auf ein Fl{\"a}chenst{\"u}ck,'' {\it Math.
Annalen}, {\bf38}:459460.",
}} a continuous
map of a line on a surface element]",
journal = jMATHANN,
volume = "38",
pages = "459460",
year = "1891",
CODEN = "MAANA3",
ISSN = "00255831 (print), 14321807 (electronic)",
ISSNL = "00255831",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Mathematische Annalen",
language = "German",
rawdata1 = "Heath, F. G. (1972) ``Origins of the Binary Code,''
{\it Scientific American}, {\bf227}(2):76, August.
Hilbert, D. (1891) ``Ueber stetige Abbildung einer
Linie auf ein Fl{\"a}chenst{\"u}ck,'' {\it Math.
Annalen}, {\bf38}:459460.",
rawdata2 = "Hilbert, D. (1891) ``Ueber stetige Abbildung einer
Linie auf ein Fl{\"a}chenst{\"u}ck,'' {\it Math.
Annalen}, {\bf38}:459460.",
}
XX 3!y!57E};7!marticledatacompression.bibHilbert:1891:SALD. HilbertUber stetige Abbildung einer Linie auf ein Flachenstuck. (German) [On a continuous map of a line on a surface element]jMATHANN384594601891MAANA300255831 (print), 14321807 (electronic) OR 00255831 (print), 14321807 (electronic)00255831 OR 00255831Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTMathematische AnnalenGermanackdsD. Hilbert{{\"U}ber stetige Abbildung einer Linie auf ein Fl{\"a}chenst{\"u}ck}. ({German}) [{On} a continuous map of a line on a surface element]
@Article{Hilbert:1891:SAL,
author = "D. Hilbert",
title = "{{\"U}ber stetige Abbildung einer Linie auf ein
Fl{\"a}chenst{\"u}ck}. ({German}) [{Onn Funktionensysteme}.
({German}) [{On} the theory of orthogonal function
systems]",
journal = jMATHANN,
volume = "69",
pages = "331371",
year = "1910",
CODEN = "MAANA3",
ISSN = "00255831 (print), 14321807 (electronic)",
ISSNL = "00255831",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Mathematische Annalen",
language = "German",
rawdata = "Haar, A. (1910) ``Zur Theorie der Orthogonalen
Funktionensysteme,'' {\it Mathematische Annalen} first
part {\bf69}:331371, second part {\bf71}:3853,
1912.",
}anackdsA. Haar{Zur Theorie der Orthogonalen Funktionensysteme}. ({German}) [{On} the theory of orthogonal function systems]
@Article{Haar:1910:TOF,
author = "A. Haar",
title = "{Zur Theorie der Orthogonalen Funktionensysteme}.
({German}) [{On} the theory of orthogonal function
systems]",
journal = jMATHANN,
volume = "69",
pages = "331371",
year = "1910",
CODEN = "MAANA3",
ISSN = "00255831 (print), 14321807 (electronic)",
ISSNL = "00255831",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Mathematische Annalen",
language = "German",
rawdata = "Haar, A. (1910) ``Zur Theorie der Orthogonalen
Funktionensysteme,'' {\it Mathematische Annalen} first
part {\bf69}:331371, second part {\bf71}:3853,
1912.",
}
uX 3'[!57E};7g
)articledatacompression.bibHaar:1910:TOFA. HaarZur Theorie der Orthogonalen Funktionensysteme. (German) [On the theory of orthogonal function systems]jMATHANN693313711910MAANA300255831 (print), 14321807 (electronic) OR 00255831 (print), 14321807 (electronic)00255831 OR 00255831Sat Jan 26 12:46:12 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:12 MSTMathematische AnnalenGermn Funktionensysteme}.
({German}) [{On} the theory of orthogonal function
systems]",
journal = jMATHANN,
volume = "71",
pages = "3853",
year = "1912",
CODEN = "MAANA3",
ISSN = "00255831 (print), 14321807 (electronic)",
ISSNL = "00255831",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Mathematische Annalen",
language = "German",
rawdata = "Haar, A. (1910) ``Zur Theorie der Orthogonalen
Funktionensysteme,'' {\it Mathematische Annalen} first
part {\bf69}:331371, second part {\bf71}:3853,
1912.",
}rmanackdsA. Haar{Zur Theorie der Orthogonalen Funktionensysteme}. ({German}) [{On} the theory of orthogonal function systems]
@Article{Haar:1912:TOF,
author = "A. Haar",
title = "{Zur Theorie der Orthogonalen Funktionensysteme}.
({German}) [{On} the theory of orthogonal function
systems]",
journal = jMATHANN,
volume = "71",
pages = "3853",
year = "1912",
CODEN = "MAANA3",
ISSN = "00255831 (print), 14321807 (electronic)",
ISSNL = "00255831",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Mathematische Annalen",
language = "German",
rawdata = "Haar, A. (1910) ``Zur Theorie der Orthogonalen
Funktionensysteme,'' {\it Mathematische Annalen} first
part {\bf69}:331371, second part {\bf71}:3853,
1912.",
}
qX 3'[!57E};7g articledatacompression.bibHaar:1912:TOFA. HaarZur Theorie der Orthogonalen Funktionensysteme. (German) [On the theory of orthogonal function systems]jMATHANN7138531912MAANA300255831 (print), 14321807 (electronic) OR 00255831 (print), 14321807 (electronic)00255831 OR 00255831Sat Jan 26 12:46:12 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:12 MSTMathematische AnnalenGebe Qui Remplit Toute une Aire plane.
({French}) [{On} a Curve that Completely Fills a Planar
Area]",
journal = "Bull. Acad. Sci. Cracovie, Serie A",
pages = "462478",
year = "1912",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprinted in \cite{Sierpinski:1990:NCQ}.",
acknowledgement = ackds,
language = "French",
rawdata = "Sierpi\'nski, W. (1912) ``Sur Une Nouvelle Courbe Qui
Remplit Toute Une Aire Plaine,'' {\it Bull. Acad. Sci.
Cracovie}, {\bf Serie~A}:462478. Simoncelli, Eero P.,
and Edward. H. Adelson (1990) ``Subband Transforms,''
{\it Subband Coding}, John Woods, ed., Boston, MA,
Kluwer Academic Press, pp. 143192.",
xxtitle = "Sur Une Nouvelle Courbe Qui Remplit Toute Une Aire
Plaine",
}tle = "Sur une Courbe Qui Remplit Toute une Aire plane.
({French}) [{On} a Curve that Completely Fills a Planar
Area]",
journal = "Bull. Acad. Sci. Cracovie, Serie A",
pages = "462478",
year = "1912",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprinted in \cite{Sierpinski:1990:NCQ}.",
acknowledgement = ackds,
language = "French",
rawdata = "Sierpi\'nski, W. (1912) ``Sur Une Nouvelle Courbe Qui
Remplit Toute Une Aire Plaine,'' {\it Bull. Acad. Sci.
Cracovie}, {\bf Serie~A}:462478. Simoncelli, Eero P.,
and Edward. H. Adelson (1990) ``Subband Transforms,''
{\it Subband Coding}, John Woods, ed., Boston, MA,
Kluwer Academic Press, pp. 143192.",
xxtitle = "Sur Une Nouvelle Courbe Qui Remplit Toute Une Aire
Plaine",
}
BB3W 33'aQE};Y/]iarticledatacompression.bibSierpinski:1912:CQRW. SierpinskiSur une Courbe Qui Remplit Toute une Aire plane. (French) [On a Curve that Completely Fills a Planar Area]Bull. Acad. Sci. Cracovie, Serie A4624781912Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTReprinted in cite Sierpinski:1990:NCQ.FrenchackdsW. Sierpi{\'n}skiReprinted in \cite{Sierpinski:1990:NCQ}.Sur une Courbe Qui Remplit Toute une Aire plane. ({French}) [{On} a Curve that Completely Fills a Planar Area]
@Article{Sierpinski:1912:CQR,
author = "W. Sierpi{\'n}ski",
tielegraph Transmission Theory",
journal = jTRANSAMERINSTELECENG,
volume = "47",
pages = "617644",
year = "1928",
CODEN = "TAEEA5",
ISSN = "00963860",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.xiph.org/ogg/flac.html",
acknowledgement = ackds,
fjournal = "Transactions of the American Institute of Electrical
Engineers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6413714",
rawdata = "Nyquist, Harry (1928) ``Certain Topics in Telegraph
Transmission Theory,'' {\it AIEE Transactions},
{\bf47}:617644. Ogg squish (2006)
http://www.xiph.org/ogg/flac.html.",
}yquistCertain Topics in Telegraph Transmission Theory
@Article{Nyquist:1928:CTT,
author = "Harry Nyquist",
title = "Certain Topics in Telegraph Transmission Theory",
journal = jTRANSAMERINSTELECENG,
volume = "47",
pages = "617644",
year = "1928",
CODEN = "TAEEA5",
ISSN = "00963860",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.xiph.org/ogg/flac.html",
acknowledgement = ackds,
fjournal = "Transactions of the American Institute of Electrical
Engineers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6413714",
rawdata = "Nyquist, Harry (1928) ``Certain Topics in Telegraph
Transmission Theory,'' {\it AIEE Transactions},
{\bf47}:617644. Ogg squish (2006)
http://www.xiph.org/ogg/flac.html.",
}
ttUW 31%5!E};%Ygarticledatacomp!W 3'kA7E};O 'karticledatacompression.bibNyquist:1928:CTTHarry NyquistCertain Topics in Telegraph Transmission TheoryjTRANSAMERINSTELECENG476176441928TAEEA500963860 OR 00963860Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSThttp://www.xiph.org/ogg/flac.htmlTransactions of the American Institute of Electrical Engineersackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6413714Harry NLayer of Rods and Cones in the Human
Retina",
journal = "Acta Ophthalmologica",
volume = "(suppl. 6)",
number = "??",
pages = "1103",
month = "????",
year = "1935",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Osterberg, G. (1935) ``Topography of the Layer of Rods
and Cones in the Human Retina,'' {\it Acta
Ophthalmologica}, (suppl. 6):1103.",
}ression.bibOsterberg:1935:TLRG. OsterbergTopography of the Layer of Rods and Cones in the Human RetinaActa Ophthalmologica(suppl. 6)11031935Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsG. OsterbergTopography of the Layer of Rods and Cones in the Human Retina
@Article{Osterberg:1935:TLR,
author = "G. Osterberg",
title = "Topography of the Layer of Rods and Cones in the Human
Retina",
journal = "Acta Ophthalmologica",
volume = "(suppl. 6)",
number = "??",
pages = "1103",
month = "????",
year = "1935",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Osterberg, G. (1935) ``Topography of the Layer of Rods
and Cones in the Human Retina,'' {\it Acta
Ophthalmologica}, (suppl. 6):1103.",
}ry of over 50,000 words without using
the letter ``{E}''",
publisher = "Wetzel Publishing Co., Inc.",
address = "Los Angeles, CA, USA",
pages = "267",
year = "1939",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/master.bib",
note = "Reprinted by University Microfilms, Ann Arbor, MI,
1991.",
URL = "http://gadsby.hypermart.net/",
acknowledgement = ackds # " and " # acknhfb,
rawdata = "Wright, E. V. (1939) {\it Gadsby}, Los Angeles,
Wetzel. Reprinted by University Microfilms, Ann Arbor,
MI, 1991.",
}
^^<8rM
@Article{Abel:2005:UTP,
author = "J.M
@Article{Abel:2010:PBS,
author = "J{\"u}rgen Abel",
title = "Post {BWT} stages of!D
@Article{Abbas:2014:FDC,
author = "Ahmed Mohammed Abbas and Azuraliza Abu Bakar and Mohd
%
@Article{Ageenko:1999:FAM,
author = "Eugene I. Ageenko and Pasi Fr{\"a}nti",
title = "Forwardadaptive method for contextb];
@Article{Agarwal:2006:AGA,
author = "R. C. Agarwal and K. Gupta and S. Jain and S.
DO
@Article{Acharya:1996:LVL,
author = "Tinku Acharya and Joseph F. J{\'a}J{\'a}",
title = A
@Article{Abrahamson:1989:ADS,
author = "David M. Abrahamson",
title = "An Adaptiv]o_
@Article{Abel:2007:IFC,
author = "J{\"u}rgen Abel",
title = "Incremental frequency count  a po$M
@Article{Abel:2005:UTP,
author = "J. Abel and W. Teahan",
title = "Universal text
++&LrZ5
@Article{AlHafeedh:2012:CIB,
author = "Anisa AlHafeedh and Maxime Crochemore and Lucian $fM
@Article{AlShammary:2012:RAS,
author = "Dhiah AlShammary and Ibrahim Khalil",
title = $K
@Article{Amidon:1971:ASB,
author = "E. L. Amidon and G. S. Akin",
title = "AlgoriI
@Article{Altingovde:2008:ICB,
author = "Ismail Sengor Altingovde and Engin Demir and Fazli
@Article{Ahmed:1974:DCT,
author = "N. Ahmed and T. Natarajan and K. R. Rao",
title = @
@Article{Albers:1998:ACA,
author = "Susanne Albers and Michael Mitzenmacher",
title = Ņ
@Article{Albers:1996:ACA,
author = "S. Albers and M. Mitzenmacher",
title = "AverFM
@Article{Alameldeen:2004:ACC,
author = "Alaa R. Alameldeen and David A. Wood",
title = "E
@Article{Ajtai:2002:CEU,
author = "Miklos Ajtai and Randal Burns and Ronald Fagin and
/ackdsErnest Vincent WrightReprinted by University Microfilms, Ann Arbor, MI, 1991.{Gadsby}; a story of over 50,000 words without using the letter ``{E}''
@Book{Wright:1939:GSW,
author = "Ernest Vincent Wright",
title = "{Gadsby}; a story of over 50,000 words without using
the letter ``{E}''",
publisher = "Wetzel Publishing Co., Inc.",
address = "Los Angeles, CA, USA",
pages = "267",
year = "1939",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/master.bib",
note = "Reprinted by University Microfilms, Ann Arbor, MI,
1991.",
URL = "http://gadsby.hypermart.net/",
acknowledgement = ackds # " and " # acknhfb,
rawdata = "Wright, E. V. (1939) {\it Gadsby}, Los Angeles,
Wetzel. Reprinted by University Microfilms, Ann Arbor,
MI, 1991.",
}
@
U3)_?)7E};__?e
articledatacompression.bibHecht:1942:EQVS. Hecht and S. Schlaer and M. H. PirenneEnergy, Quanta and VisionjJOPTSOCAM381962081942JOSAAH00303941 OR 00303941Sat Jan 26 12:46:12 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompres(w X 3+7C5E_;}E7}Obookdatacompression.bibWright:1939:GSWErnest Vincent WrightGadsby; a story of over 50,000 words without using the letter ``E''Wetzel Publishing Co., Inc.Los Angeles, CA, USA2671939Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/master.bib2013.01.26 12:46:16 MSTReprinted by University Microfilms, Ann Arbor, MI, 1991.http://gadsby.hypermart.net% "Energy, Quanta and Vision",
journal = jJOPTSOCAM,
volume = "38",
pages = "196208",
year = "1942",
CODEN = "JOSAAH",
ISSN = "00303941",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Journal of the Optical Society of America",
rawdata = "Heath, F. G. (1972) ``Origins of the Binary Code,''
{\it Scientific American}, {\bf227}(2):76, August.
Hecht, S., S. Schlaer, and M. H. Pirenne (1942)
``Energy, Quanta and Vision,'' {\it Journal of the
Optical Society of America}, {\bf38}:196208.",
}
sion.bib2013.01.26 12:46:12 MSTJournal of the Optical Society of AmericaackdsS. Hecht and S. Schlaer and M. H. PirenneEnergy, Quanta and Vision
@Article{Hecht:1942:EQV,
author = "S. Hecht and S. Schlaer and M. H. Pirenne",
title = "Energy, Quanta and Vision",
journal = jJOPTSOCAM,
volume = "38",
pages = "196208",
year = "1942",
CODEN = "JOSAAH",
ISSN = "00303941",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Journal of the Optical Society of America",
rawdata = "Heath, F. G. (1972) ``Origins of the Binary Code,''
{\it Scientific American}, {\bf227}(2):76, August.
Hecht, S., S. Schlaer, and M. H. Pirenne (1942)
``Energy, Quanta and Vision,'' {\it Journal of the
Optical Society of America}, {\bf38}:196208.",
}rror Criterion in Filter Design
and Prediction",
journal = jJMATHPHYS,
volume = "25",
pages = "261278",
year = "1947",
CODEN = "JMAPAQ",
ISSN = "00222488 (print), 10897658 (electronic), 15272427",
ISSNL = "00222488",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Journal of Mathematical Physics",
journalURL = "http://jmp.aip.org/",
rawdata = "Levinson, N. (1947) ``The Weiner RMS Error Criterion
in Filter Design and Prediction,'' {\it Journal of
Mathematical Physics}, {\bf25}:261278.",
}ompression.bib2013.01.26 12:46:16 MSTJournal of Mathematical Physicsackdshttp://jmp.aip.org/N. LevinsonThe {Weiner} {RMS} Error Criterion in Filter Design and Prediction
@Article{Levinson:1947:WRE,
author = "N. Levinson",
title = "The {Weiner} {RMS} Error Criterion in Filter Design
and Prediction",
journal = jJMATHPHYS,
volume = "25",
pages = "261278",
year = "1947",
CODEN = "JMAPAQ",
ISSN = "00222488 (print), 10897658 (electronic), 15272427",
ISSNL = "00222488",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Journal of Mathematical Physics",
journalURL = "http://jmp.aip.org/",
rawdata = "Levinson, N. (1947) ``The Weiner RMS Error Criterion
in Filter Design and Prediction,'' {\it Journal of
Mathematical Physics}, {\bf25}:261278.",
}
GkU !3%!K]1E};!Ktechreportdatacomp8
X 3//q17/!CG;QO/Uqq"articledatacom4ZZ 3//Y17/!CG;IO/SY#articledatac..X 3/# '_7E};K3#1articledatacompression.bibLevinson:1947:WREN. LevinsonThe Weiner RMS Error Criterion in Filter Design and PredictionjJMATHPHYS252612781947JMAPAQ00222488 (print), 10897658 (electronic), 15272427 OR 00222488 (print), 10897658 (electronic), 1527242700222488 OR 00222488Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datac*ges = "379423",
month = jul,
year = "1948",
CODEN = "BSTJAN",
ISSN = "00058580",
MRclass = "60.0X",
MRnumber = "0026286 (10,133e)",
MRreviewer = "J. L. Doob",
bibdate = "Tue Nov 9 11:15:54 MST 2010",
bibsource = "http://bstj.belllabs.com/oldfiles/year.1948/BSTJ.1948.2703.html;
http://www.alcatellucent.com/bstj/vol271948/bstjvol27issue03.html;
http://www.math.utah.edu/pub/bibnet/authors/s/shannonclaudeelwood.bib;
http://www.math.utah.edu/pub/bibnet/authors/t/tukeyjohnw.bib;
http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
http://www.math.utah.edu/pub/tex/bib/bstj1940.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/mathcw.bib",
note = "Reprinted in \cite{Slepian:1974:KPD}. From the first
page: ``If the base $2$ is used the resulting units may
be called binary digits, or more briefly, {\em bits}, a
word suggested by J. W. Tukey.''. This is the first
known printed instance of the word `bit' with the
meaning of binary digit.",
URL = "http://bstj.belllabs.com/BSTJ/images/Vol27/bstj273379.pdf;
http://www.alcatellucent.com/bstj/vol271948/articles/bstj273379.pdf",
acknowledgement = ackds # " and " # acknhfb,
authordates = "Claude Elwood Shannon (April 30, 1916February 24,
2001)",
fjournal = "The Bell System Technical Journal",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/",
rawdata = "Shannon, Claude E. (1948), ``A Mathematical Theory of
Communication,'' {\it Bell System Technical Journal},
{\bf27}:379423 and 623656, July and October,",
}/ompression.bibShannon:1948:MTCaClaude E. ShannonA Mathematical Theory of CommunicationjBELLSYSTTECHJ273379423jul71948BSTJAN00058580 OR 0005858060.0X0026286 (10,133e)J. L. DoobTue Nov 9 11:15:54 MST 2010http://bstj.belllabs.com/oldfiles/year.1948/BSTJ.1948.2703.html; http://www.alcatellucent.com/bstj/vol271948/bstjvol27issue03.html; http://www.math.utah.edu/pub/bibnet/authors/s/shannonclaudeelwood.bib; http://www.math.utah.edu/pub/bibnet/authors/t/tukeyjohnw.bib; http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib; http://www.math.utah.edu/pub/tex/bib/bstj1940.bib; http://www.math.utah.edu/pub/tex/bib/cryptography.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/mathcw.bib2010.11.09 11:15:54 MSTReprinted in cite Slepian:1974:KPD. From the first page: ``If the base $2$ is used the resulting units may be called binary digits, or more briefly, em bits, a word suggested by J. W. Tukey.''. This is the first known printed instance of the word 0`bit' with the meaning of binary digit.http://bstj.belllabs.com/BSTJ/images/Vol27/bstj273379.pdf; http://www.alcatellucent.com/bstj/vol271948/articles/bstj273379.pdfThe Bell System Technical JournalackdsClaude Elwood Shannon (April 30, 1916February 24, 2001)http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/Claude E. ShannonReprinted in \cite{Slepian:1974:KPD}. From the first page: ``If the base $2$ is used the resulting units may be called binary digits, or more briefly, {\em bits}, a word suggested by J. W. Tukey.''. This is the first known printed instance of the word `bit' with the meaning of binary digit.A Mathematical Theory of Communication
@Article{Shannon:1948:MTCa,
author = "Claude E. Shannon",
title = "A Mathematical Theory of Communication",
journal = jBELLSYSTTECHJ,
volume = "27",
number = "3",
pages = "379423",
month = jul,
year = "1948",
CODEN = "BSTJAN",
ISSN = "000585180",
MRclass = "60.0X",
MRnumber = "0026286 (10,133e)",
MRreviewer = "J. L. Doob",
bibdate = "Tue Nov 9 11:15:54 MST 2010",
bibsource = "http://bstj.belllabs.com/oldfiles/year.1948/BSTJ.1948.2703.html;
http://www.alcatellucent.com/bstj/vol271948/bstjvol27issue03.html;
http://www.math.utah.edu/pub/bibnet/authors/s/shannonclaudeelwood.bib;
http://www.math.utah.edu/pub/bibnet/authors/t/tukeyjohnw.bib;
http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
http://www.math.utah.edu/pub/tex/bib/bstj1940.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/mathcw.bib",
note = "Reprinted in \cite{Slepian:1974:KPD}. From the first
page: ``If the base $2$ is used the resulting units may
be called binary digits, or more briefly, {\em bits}, a
word suggested by J. W. Tukey.''. This is the first
known printed instance of the word `bit' with the
meaning of binary digit.",
URL = "http://bstj.belllabs.com/BSTJ/images/Vol27/bstj273379.pdf;
http://www.alcatellucent.com/bstj/vol271948/articles/bstj273379.pdf",
acknowledgement = ackds # " and " # acknhfb,
authordates = "Claude Elwood Shannon (April 30, 1916February 24,
2001)",
fjournal = "The Bell System Technical Journal",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/",
rawdata = "Shannon, Claude E. (1948), ``A Mathematical Theory of
Communication,'' {\it Bell System Technical Journal},
{\bf27}:379423 and 623656, July and October,",
}3 Theory of Communication (continued)",
journal = jBELLSYSTTECHJ,
volume = "27",
number = "4",
pages = "623656",
month = oct,
year = "1948",
CODEN = "BSTJAN",
ISSN = "00058580",
MRclass = "60.0X",
MRnumber = "0026286 (10,133e)",
MRreviewer = "J. L. Doob",
bibdate = "Tue Nov 9 11:15:54 MST 2010",
bibsource = "http://bstj.belllabs.com/oldfiles/year.1948/BSTJ.1948.2704.html;
http://www.alcatellucent.com/bstj/vol271948/bstjvol27issue04.html;
http://www.math.utah.edu/pub/bibnet/authors/s/shannonclaudeelwood.bib;
http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
http://www.math.utah.edu/pub/tex/bib/bstj1940.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/mathcw.bib",
note = "Reprinted in \cite{Slepian:1974:KPD}",
URL = "http://bstj.belllabs.com/BSTJ/images/Vol27/bstj274623.pdf;
http://www.alcatellucent.com/bstj/vol271948/articles/bstj274623.pdf",
acknowledgement = ackds # " and " # acknhfb,
authordates = "Claude Elwood Shannon (April 30, 1916February 24,
2001)",
fjournal = "The Bell System Technical Journal",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/",
rawdata = "Shannon, Claude E. (1948), ``A Mathematical Theory of
Communication,'' {\it Bell System Technical Journal},
{\bf27}:379423 and 623656, July and October,",
}
5pression.bibShannon:1948:MTCbClaude E. ShannonA Mathematical Theory of Communication (continued)jBELLSYSTTECHJ274623656oct101948BSTJAN00058580 OR 0005858060.0X0026286 (10,133e)J. L. DoobTue Nov 9 11:15:54 MST 2010http://bstj.belllabs.com/oldfiles/year.1948/BSTJ.1948.2704.html; http://www.alcatellucent.com/bstj/vol271948/bstjvol27issue04.html; http://www.math.utah.edu/pub/bibnet/authors/s/shannonclaudeelwood.bib; http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib; http://www.math.utah.edu/pub/tex/bib/bstj1940.bib; http://www.math.utah.edu/pub/tex/bib/cryptography.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/mathcw.bib2010.11.09 11:15:54 MSTReprinted in cite Slepian:1974:KPDhttp://bstj.belllabs.com/BSTJ/images/Vol27/bstj274623.pdf; http://www.alcatellucent.com/bstj/vol271948/articles/bstj274623.pdfThe Bell System Technical JournalackdsClaude Elwood Shannon (April 30, 1916February 24, 2001)http://onlinelibrary.wiley.com/journa6l/10.1002/(ISSN)15387305/issues/Claude E. ShannonReprinted in \cite{Slepian:1974:KPD}A Mathematical Theory of Communication (continued)
@Article{Shannon:1948:MTCb,
author = "Claude E. Shannon",
title = "A Mathematical Theory of Communication (continued)",
journal = jBELLSYSTTECHJ,
volume = "27",
number = "4",
pages = "623656",
month = oct,
year = "1948",
CODEN = "BSTJAN",
ISSN = "00058580",
MRclass = "60.0X",
MRnumber = "0026286 (10,133e)",
MRreviewer = "J. L. Doob",
bibdate = "Tue Nov 9 11:15:54 MST 2010",
bibsource = "http://bstj.belllabs.com/oldfiles/year.1948/BSTJ.1948.2704.html;
http://www.alcatellucent.com/bstj/vol271948/bstjvol27issue04.html;
http://www.math.utah.edu/pub/bibnet/authors/s/shannonclaudeelwood.bib;
http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
http://www.math.utah.edu/pub/tex/bib/bstj1940.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/mathcw.bib",
note = "Reprinted in \cite{Slepian:1974:KPD}",
URL = "http://bstj.belllabs.com/BSTJ/images/Vol27/bstj274623.pdf;
http://www.alcatellucent.com/bstj/vol271948/articles/bstj274623.pdf",
acknowledgement = ackds # " and " # acknhfb,
authordates = "Claude Elwood Shannon (April 30, 1916February 24,
2001)",
fjournal = "The Bell System Technical Journal",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/",
rawdata = "Shannon, Claude E. (1948), ``A Mathematical Theory of
Communication,'' {\it Bell System Technical Journal},
{\bf27}:379423 and 623656, July and October,",
}ormation",
type = "Technical Report",
number = "65",
institution = "Research Laboratory for Electronics, MIT",
address = "Cambridge, MA, USA",
pages = "??",
year = "1949",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Fano, R. M. (1949) ``The Transmission of
Information,'' Research Laboratory for Electronics,
MIT, Tech Rep. No. 65.",
}ression.bibFano:1949:TIR. M. FanoThe Transmission of InformationTechnical Report65Research Laboratory for Electronics, MITCambridge, MA, USA1949Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsR. M. FanoThe Transmission of Information
@TechReport{Fano:1949:TI,
author = "R. M. Fano",
title = "The Transmission of Information",
type = "Technical Report",
number = "65",
institution = "Research Laboratory for Electronics, MIT",
address = "Cambridge, MA, USA",
pages = "??",
year = "1949",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Fano, R. M. (1949) ``The Transmission of
Information,'' Research Laboratory for Electronics,
MIT, Tech Rep. No. 65.",
}tizing, Grouping, and Coding
Amplitude Modulated Pulses",
type = "{Master}'s Thesis",
school = "Department of Electrical Engineering, MIT",
address = "Cambridge, MA, USA",
pages = "??",
year = "1949",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Kraft, L. G. (1949) {\it A Device for Quantizing,
Grouping, and Coding Amplitude Modulated Pulses},
Master's Thesis, Department of Electrical Engineering,
MIT, Cambridge, MA.",
}epartment of Electrical Engineering, MITCambridge, MA, USA1949Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsL. G. KraftA Device for Quantizing, Grouping, and Coding Amplitude Modulated Pulses
@MastersThesis{Kraft:1949:DQG,
author = "L. G. Kraft",
title = "A Device for Quantizing, Grouping, and Coding
Amplitude Modulated Pulses",
type = "{Master}'s Thesis",
school = "Department of Electrical Engineering, MIT",
address = "Cambridge, MA, USA",
pages = "??",
year = "1949",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Kraft, L. G. (1949) {\it A Device for Quantizing,
Grouping, and Coding Amplitude Modulated Pulses},
Master's Thesis, Department of Electrical Engineering,
MIT, Cambridge, MA.",
}
dW '3)#+_1E};#mastersthesisdatacompression.bibKraft:1949:DQGL. G. KraftA Device for Quantizing, Grouping, and Coding Amplitude Modulated PulsesMaster's ThesisD:=Entropy of Printed {English}",
journal = jBELLSYSTTECHJ,
volume = "30",
number = "1",
pages = "5064",
month = jan,
year = "1951",
CODEN = "BSTJAN",
ISSN = "00058580",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://bstj.belllabs.com/oldfiles/year.1951/BSTJ.1951.3001.html;
http://www.alcatellucent.com/bstj/vol301951/bstjvol30issue01.html;
http://www.math.utah.edu/pub/bibnet/authors/s/shannonclaudeelwood.bib;
http://www.math.utah.edu/pub/tex/bib/bstj1950.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprinted in \cite{Slepian:1974:KPD}.",
URL = "http://bstj.belllabs.com/BSTJ/images/Vol30/bstj30150.pdf;
http://www.alcatellucent.com/bstj/vol301951/articles/bstj30150.pdf",
abstract = "A new method of estimating the entropy and redundancy
of a language is described. This method exploits the
knowledge of the language statistics possessed by those
who speak the language, and depends on experimental
results in prediction of the next letter when the
preceding text is known. Results of experiments in
prediction are given, and some properties of an ideal
predictor are developed.",
acknowledgement = ackds # " and " # acknhfb,
attnote = "Included in Part A.",
authordates = "Claude Elwood Shannon (April 30, 1916February 24,
2001)",
fjournal = "The Bell System Technical Journal",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/",
rawdata = "Shannon, Claude (1951) ``Prediction and Entropy of
Printed English,'' {\it Bell System Technical Journal},
{\bf30}(1):5064, January.",
received = "September 15, 1950",
}?age statistics possessed by those who speak the language, and depends on experimental results in prediction of the next letter when the preceding text is known. Results of experiments in prediction are given, and some properties of an ideal predictor are developed.The Bell System Technical JournalackdsClaude Elwood Shannon (April 30, 1916February 24, 2001)http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/A new method of estimating the entropy and redundancy of a language is described. This method exploits the knowledge of the language statistics possessed by those who speak the language, and depends on experimental results in prediction of the next letter when the preceding text is known. Results of experiments in prediction are given, and some properties of an ideal predictor are developed.Claude E. ShannonReprinted in \cite{Slepian:1974:KPD}.Prediction and Entropy of Printed {English}
@Article{Shannon:1951:PEP,
author = "Claude E. Shannon",
title = "Prediction and@ Entropy of Printed {English}",
journal = jBELLSYSTTECHJ,
volume = "30",
number = "1",
pages = "5064",
month = jan,
year = "1951",
CODEN = "BSTJAN",
ISSN = "00058580",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://bstj.belllabs.com/oldfiles/year.1951/BSTJ.1951.3001.html;
http://www.alcatellucent.com/bstj/vol301951/bstjvol30issue01.html;
http://www.math.utah.edu/pub/bibnet/authors/s/shannonclaudeelwood.bib;
http://www.math.utah.edu/pub/tex/bib/bstj1950.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprinted in \cite{Slepian:1974:KPD}.",
URL = "http://bstj.belllabs.com/BSTJ/images/Vol30/bstj30150.pdf;
http://www.alcatellucent.com/bstj/vol301951/articles/bstj30150.pdf",
abstract = "A new method of estimating the entropy and redundancy
of a language is described. This method exploits the
knowledge of the language statistics possessed by those
who speak the language, and depends on experimental
results in prediction of the next letter when the
preceding text is known. Results of experiments in
prediction are given, and some properties of an ideal
predictor are developed.",
acknowledgement = ackds # " and " # acknhfb,
attnote = "Included in Part A.",
authordates = "Claude Elwood Shannon (April 30, 1916February 24,
2001)",
fjournal = "The Bell System Technical Journal",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/",
rawdata = "Shannon, Claude (1951) ``Prediction and Entropy of
Printed English,'' {\it Bell System Technical Journal},
{\bf30}(1):5064, January.",
received = "September 15, 1950",
}
eeZ 3/_17E;S!O!/WcAarticledatacompression.bibShannon:1951:PEPClaude E. ShannonPrediction and Entropy of Printed EnglishjBELLSYSTTECHJ3015064jan11951BSTJAN00058580 OR 00058580Sat Jan 26 12:46:16 MST 2013http://bstj.belllabs.com/oldfiles/year.1951/BSTJ.1951.3001.html; http://www.alcatellucent.com/bstj/vol301951/bstjvol30issue01.html; http://www.math.utah.edu/pub/bibnet/authors/s/shannonclaudeelwood.bib; http://www.math.utah.edu/pub/tex/bib/bstj1950.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTReprinted in cite Slepian:1974:KPD.http://bstj.belllabs.com/BSTJ/images/Vol30/bstj30150.pdf; http://www.alcatellucent.com/bstj/vol301951/articles/bstj30150.pdfA new method of estimating the entropy and redundancy of a language is described. This method exploits the knowledge of the langu>nstruction of Minimum Redundancy
Codes",
journal = jPROCIRE,
volume = "40",
number = "9",
pages = "10981101",
year = "1952",
CODEN = "PIREAE",
ISSN = "00968390",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Proceedings of the Institute of Radio Engineers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10933",
rawdata = "Huffman, David (1952) ``A Method for the Construction
of Minimum Redundancy Codes,'' {\it Proceedings of the
IRE}, {\bf40}(9):10981101.",
}te of Radio Engineersackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10933David HuffmanA Method for the Construction of Minimum Redundancy Codes
@Article{Huffman:1952:MCM,
author = "David Huffman",
title = "A Method for the Construction of Minimum Redundancy
Codes",
journal = jPROCIRE,
volume = "40",
number = "9",
pages = "10981101",
year = "1952",
CODEN = "PIREAE",
ISSN = "00968390",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Proceedings of the Institute of Radio Engineers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10933",
rawdata = "Huffman, David (1952) ``A Method for the Construction
of Minimum Redundancy Codes,'' {\it Proceedings of the
IRE}, {\bf40}(9):10981101.",
}
ww~V 3'!!7E};k'Iarticledatacompression.bibHuffman:1952:MCMDavid HuffmanA Method for the Construction of Minimum Redundancy CodesjPROCIRE409109811011952PIREAE00968390 OR 00968390Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTProceedings of the InstituC pages = "??",
day = "17",
month = mar,
year = "1953",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "United States Patent 2,632,058.",
acknowledgement = ackds,
rawdata = "Gray, Frank (1953) ``Pulse Code Communication,''
United States Patent 2,632,058, March 17.",
}
>&L>r9s
@Article{Anagnostopoulos:2014:APC,
author = "Christos Anagnostopoulos and Stathes
Hadjiefthymiades",
title = "Advanced Principal ComponentBased Compressi&%K
@Article{Andujar:2012:ACT,
author = "C. Andujar",
title = "Adaptive Compression o$$
@Article{Andersson:2013:DDS,
author = "M. Andersson and J. Munkberg and T.
%}`A
@Article{Anderson:1987:BIM,
author = "K. L. Anderson and others",
title = "BinaryfB
@Article{Amsterdam:1986:DCH,
author = "Jonathan Amsterdam",
title = "Data Compres"@
@Article{Amir:2012:QDP,
author = "Amihood Amir and Yonatan Aumann and Avivit Levy and
$$K
@Article{Amidon:1971:ASB,
author = "E. L. Amidon and G. S. Akin",
title = "AlgoriI
@Article{Altingovde:2008:ICB,
author = "Ismail Sengor Altingovde and Engin Demir and Fazli
yyU 3'!=E};K!K=)miscdatacompression.bibGray:1953:PCCFrank GrayPulse Code Communication17mar31953Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTUnited States Patent 2,632,058.ackdsFrank GrayUnited States Patent 2,632,058.Pulse Code Communication
@Misc{Gray:1953:PCC,
author = "Frank Gray",
title = "Pulse Code Communication",
pages = "??",
day = "17",
month = mar,
year = "1953",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "United States Patent 2,632,058.",
acknowledgement = ackds,
rawdata = "Gray, Frank (1953) ``Pulse Code Communication,''
United States Patent 2,632,058, March 17.",
}escription of Language",
journal = jIRETRANSINFTHEORY,
volume = "2",
number = "3",
pages = "113124",
year = "1956",
CODEN = "IRITAY",
ISSN = "00961000",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IRE Transactions on Information Theory",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4547527",
rawdata = "Chomsky, N. (1956) ``Three Models for the Description
of Language,'' {\it IRE Transactions on Information
Theory}, {\bf2}(3):113124.",
}sion.bib2013.01.26 12:46:16 MSTIRE Transactions on Information Theoryackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4547527N. ChomskyThree Models for the Description of Language
@Article{Chomsky:1956:TMD,
author = "N. Chomsky",
title = "Three Models for the Description of Language",
journal = jIRETRANSINFTHEORY,
volume = "2",
number = "3",
pages = "113124",
year = "1956",
CODEN = "IRITAY",
ISSN = "00961000",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IRE Transactions on Information Theory",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4547527",
rawdata = "Chomsky, N. (1956) ``Three Models for the Description
of Language,'' {\it IRE Transactions on Information
Theory}, {\bf2}(3):113124.",
}
$$V 3//q;57E};[/q+articledatacompression.bibMcMillan:1956:TIIBrockway McMillanTwo Inequalities Implied by Unique DecipherabilityjIEEETRANSINFTHEORY24115116dec121956IETTAW00189448 (print), 15579654 (electronic) OR 00189448 (print), 15579654 (electronic)00189448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utL>V 3!e97E};Y!earticledatacompression.bibChomsky:1956:TMDN. ChomskyThree Models for the Description of LanguagejIRETRANSINFTHEORY231131241956IRITAY00961000 OR 00961000Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompresIes Implied by Unique Decipherability",
journal = jIEEETRANSINFTHEORY,
volume = "2",
number = "4",
pages = "115116",
month = dec,
year = "1956",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "McMillan, Brockway (1956) ``Two Inequalities Implied
by Unique Decipherability,'' {\it IEEE Transactions on
Information Theory}, {\bf2}(4):115116, December.",
}ah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information TheoryackdsBrockway McMillanTwo Inequalities Implied by Unique Decipherability
@Article{McMillan:1956:TII,
author = "Brockway McMillan",
title = "Two Inequalities Implied by Unique Decipherability",
journal = jIEEETRANSINFTHEORY,
volume = "2",
number = "4",
pages = "115116",
month = dec,
year = "1956",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "McMillan, Brockway (1956) ``Two Inequalities Implied
by Unique Decipherability,'' {\it IEEE Transactions on
Information Theory}, {\bf2}(4):115116, December.",
}Triangular Form",
journal = jJSIAM,
volume = "6",
number = "1",
pages = "2650",
month = mar,
year = "1958",
CODEN = "JSIMAV",
ISSN = "03684245 (print), 1095712X (electronic)",
ISSNL = "03684245",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/siam.bib; JSTOR
database",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Journal of the Society for Industrial and Applied
Mathematics",
rawdata = "Givens, Wallace (1958) ``Computation of Plane Unitary
Rotations Transforming a General Matrix to Triangular
Form,'' {\it Journal of the Society for Industrial and
Applied Mathematics}, {\bf6}(1):2650, March.",
} Triangular Form",
journal = jJSIAM,
volume = "6",
number = "1",
pages = "2650",
month = mar,
year = "1958",
CODEN = "JSIMAV",
ISSN = "03684245 (print), 1095712X (electronic)",
ISSNL = "03684245",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/siam.bib; JSTOR
database",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Journal of the Society for Industrial and Applied
Mathematics",
rawdata = "Givens, Wallace (1958) ``Computation of Plane Unitary
Rotations Transforming a General Matrix to Triangular
Form,'' {\it Journal of the Society for Industrial and
Applied Mathematics}, {\bf6}(1):2650, March.",
}
LL)Z 3+);57E;);Uarticledatacompression.bibGivens:1958:CPUWallace GivensComputation of Plane Unitary Rotations Transforming a General Matrix to Triangular FormjJSIAM612650mar31958JSIMAV03684245 (print), 1095712X (electronic) OR 03684245 (print), 1095712X (electronic)03684245 OR 03684245Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/siam.bib; JSTOR database2013.01.26 12:46:16 MSTJournal of the Society for Industrial and Applied MathematicsackdsWallace GivensComputation of Plane Unitary Rotations Transforming a General Matrix to Triangular Form
@Article{Givens:1958:CPU,
author = "Wallace Givens",
title = "Computation of Plane Unitary Rotations Transforming a
General Matrix toNRunlength Coding of
Pictures",
journal = jIEEETRANSINFTHEORY,
volume = "5",
number = "4",
pages = "157163",
month = dec,
year = "1959",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Capon, J. (1959) ``A Probabilistic Model for
Runlength Coding of Pictures,'' {\it IEEE Transactions
on Information Theory}, {\bf5}(4):157163, December.",
}.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information TheoryackdsJ. CaponA Probabilistic Model for Runlength Coding of Pictures
@Article{Capon:1959:PMR,
author = "J. Capon",
title = "A Probabilistic Model for Runlength Coding of
Pictures",
journal = jIEEETRANSINFTHEORY,
volume = "5",
number = "4",
pages = "157163",
month = dec,
year = "1959",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Capon, J. (1959) ``A Probabilistic Model for
Runlength Coding of Pictures,'' {\it IEEE Transactions
on Information Theory}, {\bf5}(4):157163, December.",
}
prpsX3GM173%Eu;+OG+MA#articledatacompression.bibGilbert:1959:VLBE. N. Gilbert and E. F. MooreVariable Length Binary EncodingsjBELLSYSTTECHJ384933967jul71959BSTJAN00058580 OR 0005858094.000108413 (21 \#7129)S. W. GolombSat Jan 26 12:46:16 MST 2013http://bstj.belllabs.com/oldfiles/year.1959/BSTJ.1959.3804.html; http://www.alcatellucent.com/bstj/vol381959/bstjvol38issue04.html; http://www.math.utah.edu/pub/tex/bib/bstj1950.bibUV 3){;57E};[{7articledatacompression.bibCapon:1959:PMRJ. CaponA Probabilistic Model for Runlength Coding of PicturesjIEEETRANSINFTHEORY54157163dec121959IETTAW00189448 (print), 15579654 (electronic) OR 00189448 (print), 15579654 (electronic)00189448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utahQTiable Length Binary Encodings",
journal = jBELLSYSTTECHJ,
volume = "38",
number = "4",
pages = "933967",
month = jul,
year = "1959",
CODEN = "BSTJAN",
ISSN = "00058580",
ISSNL = "",
MRclass = "94.00",
MRnumber = "0108413 (21 \#7129)",
MRreviewer = "S. W. Golomb",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://bstj.belllabs.com/oldfiles/year.1959/BSTJ.1959.3804.html;
http://www.alcatellucent.com/bstj/vol381959/bstjvol38issue04.html;
http://www.math.utah.edu/pub/tex/bib/bstj1950.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Monograph 3515.",
URL = "http://bstj.belllabs.com/BSTJ/images/Vol38/bstj384933.pdf;
http://www.alcatellucent.com/bstj/vol381959/articles/bstj384933.pdf",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "The Bell System Technical Journal",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/",
rawdata1 = "Gilbert, E. N., and E. F. Moore (1959) ``Variable
Length Binary Encodings,'' {\it Bell System Technical
Journal, Monograph 3515}, {\bf38}:933967, July.",
rawdata2 = "Gilbert, E. N. and E. F. Moore (1959) ``Variable
Length Binary Encodings,'' {\it Bell System Technical
Journal}, {\bf38}:933967.",
}V; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTMonograph 3515.http://bstj.belllabs.com/BSTJ/images/Vol38/bstj384933.pdf; http://www.alcatellucent.com/bstj/vol381959/articles/bstj384933.pdfThe Bell System Technical Journalackdshttp://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/E. N. Gilbert and E. F. MooreMonograph 3515.Variable Length Binary Encodings
@Article{Gilbert:1959:VLB,
author = "E. N. Gilbert and E. F. Moore",
title = "Variable Length Binary Encodings",
journal = jBELLSYSTTECHJ,
volume = "38",
number = "4",
pages = "933967",
month = jul,
year = "1959",
CODEN = "BSTJAN",
ISSN = "00058580",
ISSNL = "",
MRclass = "94.00",
MRnumber = "0108413 (21 \#7129)",
MRreviewer = "S. W. Golomb",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://bstj.belllabs.com/oldfiles/year.1959/BSTJ.1959.3804.html;
http://www.alcatellucent.com/bstj/vol381959/bstjvol38issue04.html;
http://www.math.utah.edu/pub/tex/bib/bstj1950.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Monograph 3515.",
URL = "http://bstj.belllabs.com/BSTJ/images/Vol38/bstj384933.pdf;
http://www.alcatellucent.com/bstj/vol381959/articles/bstj384933.pdf",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "The Bell System Technical Journal",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/",
rawdata1 = "Gilbert, E. N., and E. F. Moore (1959) ``Variable
Length Binary Encodings,'' {\it Bell System Technical
Journal, Monograph 3515}, {\bf38}:933967, July.",
rawdata2 = "Gilbert, E. N. and E. F. Moore (1959) ``Variable
Length Binary Encodings,'' {\it Bell System Technical
Journal}, {\bf38}:933967.",
}es Models",
journal = jREVINSTINTSTATIST,
volume = "28",
pages = "233344",
year = "1960",
CODEN = "",
ISSN = "03731138",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Revue de l'Institut international de statistique =
Review of the International Statistical Institute",
rawdata = "Durbin J. (1960) ``The Fitting of TimeSeries
Models,'' {\it JSTOR: Revue de l'Institut International
de Statistique}, {\bf28}:233344.",
xxjournal = "JSTOR: Revue de l'Institut International de
Statistique",
}de l'Institut international de statistique = Review of the International Statistical InstituteackdsJ. DurbinThe Fitting of TimeSeries Models
@Article{Durbin:1960:FTS,
author = "J. Durbin",
title = "The Fitting of TimeSeries Models",
journal = jREVINSTINTSTATIST,
volume = "28",
pages = "233344",
year = "1960",
CODEN = "",
ISSN = "03731138",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Revue de l'Institut international de statistique =
Review of the International Statistical Institute",
rawdata = "Durbin J. (1960) ``The Fitting of TimeSeries
Models,'' {\it JSTOR: Revue de l'Institut International
de Statistique}, {\bf28}:233344.",
xxjournal = "JSTOR: Revue de l'Institut International de
Statistique",
}
V 3%O97E};YOSarticledatacompression.bibMax:1960:QMDJoel MaxQuantizing for minimum distortionjIRETRANSINFTHEORYIT6712mar31960IRITAY00961000 OR 00961000Sat Jan 26 12:46:12 MST 2013http://www[PV 3+O97E};UOiparticledatacompression.bibDurbin:1960:FTSJ. DurbinThe Fitting of TimeSeries ModelsjREVINSTINTSTATIST28233344196003731138 OR 03731138Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTRevue Xrtion",
journal = jIRETRANSINFTHEORY,
volume = "IT6",
pages = "712",
month = mar,
year = "1960",
CODEN = "IRITAY",
ISSN = "00961000",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IRE Transactions on Information Theory",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4547527",
rawdata = "Max, Joel (1960) ``Quantizing for minimum
distortion,'' {\it IRE Transactions on Information
Theory}, {\bf IT6}:712, March.",
}.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:12 MSTIRE Transactions on Information Theoryackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4547527Joel MaxQuantizing for minimum distortion
@Article{Max:1960:QMD,
author = "Joel Max",
title = "Quantizing for minimum distortion",
journal = jIRETRANSINFTHEORY,
volume = "IT6",
pages = "712",
month = mar,
year = "1960",
CODEN = "IRITAY",
ISSN = "00961000",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IRE Transactions on Information Theory",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4547527",
rawdata = "Max, Joel (1960) ``Quantizing for minimum
distortion,'' {\it IRE Transactions on Information
Theory}, {\bf IT6}:712, March.",
}f Arbitrary Geometric
Configurations",
journal = jIRETRANSELECCOMPUT,
volume = "EC10",
number = "2",
pages = "260268",
month = jun,
year = "1961",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1961.5219197",
ISSN = "03679950",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219197",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
rawdata = "Freeman, H. (1961) ``On The Encoding of Arbitrary
Geometric Configurations,'' {\it IRE Transactions on
Electronic Computers}, {\bf EC10}(2):260268, June.",
}ng of Arbitrary Geometric
Configurations",
journal = jIRETRANSELECCOMPUT,
volume = "EC10",
number = "2",
pages = "260268",
month = jun,
year = "1961",
CODEN = "IRELAO",
DOI = "http://dx.doi.org/10.1109/TEC.1961.5219197",
ISSN = "03679950",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219197",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "IRE Transactions on Electronic Computers",
rawdata = "Freeman, H. (1961) ``On The Encoding of Arbitrary
Geometric Configurations,'' {\it IRE Transactions on
Electronic Computers}, {\bf EC10}(2):260268, June.",
}
zzjW 3'!#E};;!articledatacompressionaW 3+w;a7E+;]+wC articledatacompression.bibFreeman:1961:EAGHerbert FreemanOn the Encoding of Arbitrary Geometric ConfigurationsjIRETRANSELECCOMPUTEC102260268jun61961IRELAOhttp://dx.doi.org/10.1109/TEC.1961.521919703679950 OR 03679950Sat Jan 26 12:46:16 MST 2013http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2013.01.26 12:46:16 MSThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219197IRE Transactions on Electronic ComputersackdsHerbert FreemanOn the Encoding of Arbitrary Geometric Configurations
@Article{Freeman:1961:EAG,
author = "Herbert Freeman",
title = "On the Encodi] for the Discrete Noiseless
Channel",
journal = jTRANSIRE,
volume = "7",
pages = "2738",
year = "1961",
CODEN = "",
ISSN = "",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Transactions of the IRE",
rawdata = "Karp, R. S. (1961) ``MinimumRedundancy Coding for the
Discrete Noiseless Channel,'' {\it Transactions of the
IRE}, {\bf7}:2738.",
}
&[L$I
@AfM
@Article{Barron:2005:DWP,
author = "David W. Barron",
title = "{David Wheeler}: aǇK
@Article{Barros:2000:VAC,
author = "Jo{\~a}o Paulo Barros and Rui Pais",
title = azu
@Article{Barnsley:1988:BWC,
author = "Michael F. Barnsley and Alan D. Sloan",
title = "A Better Way to C7o
@Article{Barr:2006:EAL,
author = "Kenneth C. Barr and Krste Asanovi{\'c}",
title = n]
@Article{Baron:2005:ASS,
author = "D. Baron and Y. Bresler",
title = "Antisequentć9
@Article{Bartkowiak:2001:SAO,
author = "Maciej Bartkowiak and Adam {\L}uczak",
title = ΆaC
@Article{Baran:2000:NVV,
author = "Nicholas Baran",
title = "News and Views: Volu]F
@Article{Barbay:2014:EFC,
author = "J{\'e}r{\'e}my Barbay and Francisco Claude and Travis
&!.bibKarp:1961:MRCR. S. KarpMinimumRedundancy Coding for the Discrete Noiseless ChanneljTRANSIRE727381961Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTTransactions of the IREackdsR. S. KarpMinimumRedundancy Coding for the Discrete Noiseless Channel
@Article{Karp:1961:MRC,
author = "R. S. Karp",
title = "MinimumRedundancy Coding for the Discrete Noiseless
Channel",
journal = jTRANSIRE,
volume = "7",
pages = "2738",
year = "1961",
CODEN = "",
ISSN = "",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Transactions of the IRE",
rawdata = "Karp, R. S. (1961) ``MinimumRedundancy Coding for the
Discrete Noiseless Channel,'' {\it Transactions of the
IRE}, {\bf7}:2738.",
}eometry of $n$Dimensions",
publisher = "Hafner",
address = "New York, NY, USA",
pages = "??",
year = "1961",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Kendall, Maurice G. (1961) {\it A Course in the
Geometry of nDimensions}, New York, Hafner.",
}
pp
U 31a/E};1a'bookdatacompression.bibKendall:1961:CGDMaurice G. KendallA Course in the Geometry of $n$DimensionsHafnerNew York, NY, USA1961Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsMaurice G. KendallA Course in the Geometry of $n$Dimensions
@Book{Kendall:1961:CGD,
author = "Maurice G. Kendall",
title = "A Course in the Geometry of $n$Dimensions",
publisher = "Hafner",
address = "New York, NY, USA",
pages = "??",
year = "1961",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Kendall, Maurice G. (1961) {\it A Course in the
Geometry of nDimensions}, New York, Hafner.",
} Sneddon",
booktitle = "{Fibonacci} Numbers",
title = "{Fibonacci} Numbers",
volume = "2",
publisher = "Pergamon Press",
address = "Oxford, UK",
pages = "viii + 66",
year = "1961",
ISBN = "0932750036",
ISBN13 = "9780932750037",
LCCN = "QA241 .V613 1961",
bibdate = "Mon Jan 28 18:47:14 MST 2013",
bibsource = "fsz3950.oclc.org:210/WorldCat;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/fibquart.bib",
note = "Translation by Halina Moss. Reprinted in
\cite{Vorobev:1983:FN}.",
series = "Popular lectures in mathematics series",
acknowledgement = ackds # " and " # acknhfb,
rawdata = "Vorobev, Nikolai N. (1983) in Ian N. Sneddon (ed.),
and Halina Moss (translator), {\it Fibonacci Numbers},
New Classics Library.",
xxauthor = "Nikolai N. Vorobiev",
}h Sneddon",
booktitle = "{Fibonacci} Numbers",
title = "{Fibonacci} Numbers",
volume = "2",
publisher = "Pergamon Press",
address = "Oxford, UK",
pages = "viii + 66",
year = "1961",
ISBN = "0932750036",
ISBN13 = "9780932750037",
LCCN = "QA241 .V613 1961",
bibdate = "Mon Jan 28 18:47:14 MST 2013",
bibsource = "fsz3950.oclc.org:210/WorldCat;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/fibquart.bib",
note = "Translation by Halina Moss. Reprinted in
\cite{Vorobev:1983:FN}.",
series = "Popular lectures in mathematics series",
acknowledgement = ackds # " and " # acknhfb,
rawdata = "Vorobev, Nikolai N. (1983) in Ian N. Sneddon (ed.),
and Halina Moss (translator), {\it Fibonacci Numbers},
New Classics Library.",
xxauthor = "Nikolai N. Vorobiev",
}
UX %3+15//)!CQE!; Y135
3MJincollectiondatacompression.bibVorobev:1961:FNNikolai N. VorobevIan Naismith SneddonFibonacci NumbersFibonacci Numbers2Pergamon PressOxford, UKviii + 6619610932750036 OR 09327500369780932750037 OR 9780932750037QA241 .V613 1961Mon Jan 28 18:47:14 MST 2013fsz3950.oclc.org:210/WorldCat; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib2013.01.28 18:47:14 MSTTranslation by Halina Moss. Reprinted in cite Vorobev:1983:FN.Popular lectures in mathematics seriesackdsNikolai N. Vorobev{Fibonacci} NumbersIan Naismith SneddonTranslation by Halina Moss. Reprinted in \cite{Vorobev:1983:FN}.{Fibonacci} Numbers
@InCollection{Vorobev:1961:FN,
author = "Nikolai N. Vorobev",
editor = "Ian NaismiteCoding",
publisher = pubMCGRAWHILL,
address = pubMCGRAWHILL:adr,
pages = "??",
year = "1963",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Abramson, N. (1963) {\it Information Theory and
Coding}, New York, McGrawHill.",
}
XU 3/#G+3E};#Gubookdatacompression.bibAbramson:1963:ITCN. AbramsonInformation Theory and CodingpubMCGRAWHILLpubMCGRAWHILL:adr1963Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsN. AbramsonInformation Theory and Coding
@Book{Abramson:1963:ITC,
author = "N. Abramson",
title = "Information Theory and Coding",
publisher = pubMCGRAWHILL,
address = pubMCGRAWHILL:adr,
pages = "??",
year = "1963",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Abramson, N. (1963) {\it Information Theory and
Coding}, New York, McGrawHill.",
}ata Compression",
type = "{Ph.D.} thesis",
school = "University of California, Los Angeles",
address = "Los Angeles, CA, USA",
pages = "46",
year = "1964",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302143966",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "6502683",
subject = "Electrical engineering",
}isUniversity of California, Los AngelesLos Angeles, CA, USA461964Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302143966Electrical engineeringacknhfbLee David DavissonTheory of Data Compression
@PhdThesis{Davisson:1964:TDC,
author = "Lee David Davisson",
title = "Theory of Data Compression",
type = "{Ph.D.} thesis",
school = "University of California, Los Angeles",
address = "Los Angeles, CA, USA",
pages = "46",
year = "1964",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302143966",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "6502683",
subject = "Electrical engineering",
}
S@Sl![ 31[57Ei;oqeo1earticledatacompression.bibChaitin:1966:LPCGregory J. ChaitinOn the Length of Programs for Computing Finite Binary SequencesjJACM134547569oct101966JACOAHhttp://dx.doi.org/10.1145/321356.32136300045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)0004qi Y35]/57E;_SkW]cg%articledatacm5V 3/1A%W5C7;e91A phdthesisdatacompression.bibDavisson:1964:TDCLee David DavissonTheory of Data CompressionPh.D. thesje = "Systematic Statistics Used for Data Compression in
Space Telemetry",
journal = jJAMSTATASSOC,
volume = "60",
number = "309",
pages = "97133",
month = mar,
year = "1965",
CODEN = "JSTNAL",
ISSN = "01621459 (print), 1537274X (electronic)",
ISSNL = "01621459",
bibdate = "Wed Jan 25 08:05:37 MST 2012",
bibsource = "http://www.jstor.org/journals/01621459.html;
http://www.jstor.org/stable/i314190;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib",
note = "See corrigenda \cite{Eisenberger:1967:CSS}.",
URL = "http://www.jstor.org/stable/2283140",
acknowledgement = acknhfb,
fjournal = "Journal of the American Statistical Association",
journalURL = "http://www.tandfonline.com/loi/uasa20",
} nompression.bibEisenberger:1965:SSUIsidore Eisenberger and Edward C. PosnerSystematic Statistics Used for Data Compression in Space TelemetryjJAMSTATASSOC6030997133mar31965JSTNAL01621459 (print), 1537274X (electronic) OR 01621459 (print), 1537274X (electronic)01621459 OR 01621459Wed Jan 25 08:05:37 MST 2012http://www.jstor.org/journals/01621459.html; http://www.jstor.org/stable/i314190; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib2012.01.25 08:05:37 MSTSee corrigenda cite Eisenberger:1967:CSS.http://www.jstor.org/stable/2283140Journal of the American Statistical Associationacknhfbhttp://www.tandfonline.com/loi/uasa20Isidore Eisenberger and Edward C. PosnerSee corrigenda \cite{Eisenberger:1967:CSS}.Systematic Statistics Used for Data Compression in Space Telemetry
@Article{Eisenberger:1965:SSU,
author = "Isidore Eisenberger and Edward C. Posner",
title = "Systematic Statistics Used for Data Compression in
Space Telemetry",
journal = jJAMSTATASSOC,
volume = "60",
number = "309",
pages = "97133",
month = mar,
year = "1965",
CODEN = "JSTNAL",
ISSN = "01621459 (print), 1537274X (electronic)",
ISSNL = "01621459",
bibdate = "Wed Jan 25 08:05:37 MST 2012",
bibsource = "http://www.jstor.org/journals/01621459.html;
http://www.jstor.org/stable/i314190;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib",
note = "See corrigenda \cite{Eisenberger:1967:CSS}.",
URL = "http://www.jstor.org/stable/2283140",
acknowledgement = acknhfb,
fjournal = "Journal of the American Statistical Association",
journalURL = "http://www.tandfonline.com/loi/uasa20",
}pof Programs for Computing Finite Binary
Sequences",
journal = jJACM,
volume = "13",
number = "4",
pages = "547569",
month = oct,
year = "1966",
CODEN = "JACOAH",
DOI = "http://dx.doi.org/10.1145/321356.321363",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jacm.bib;
http://www.math.utah.edu/pub/tex/bib/prng.bib",
abstract = "The use of Turing machines for calculating finite
binary sequences is studied from the point of view of
information theory and the theory of recursive
functions. Various results are obtained concerning the
number of:instructions ia programs. A modified form of
Turing machine is studied from the same point of view.
Aa application to the problem of defining a patternless
sequence is proposed in terms of the concepts here
developed.",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
rawdata = "Chaitin, Gregory J. (1966) ``On the Lengths of
Programs for Computing Finite Binary Sequences,'' {\it
Journal of the ACM}, {\bf13}(4):547569, October.",
}!r5411 OR 00045411Sat Jan 26 12:46:16 MST 2013http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib; http://www.math.utah.edu/pub/tex/bib/prng.bib2013.01.26 12:46:16 MSTThe use of Turing machines for calculating finite binary sequences is studied from the point of view of information theory and the theory of recursive functions. Various results are obtained concerning the number of:instructions ia programs. A modified form of Turing machine is studied from the same point of view. Aa application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed.Journal of the Association for Computing Machineryackdshttp://portal.acm.org/browse_dl.cfm?idx=J401The use of Turing machines for calculating finite binary sequences is studied from the point of view of information theory and the theory of recursive functions. Various results are obtained concerning the number of:instructions ia programs. A mosdified form of Turing machine is studied from the same point of view. Aa application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed.Gregory J. ChaitinOn the Length of Programs for Computing Finite Binary Sequences
@Article{Chaitin:1966:LPC,
author = "Gregory J. Chaitin",
title = "On the Length of Programs for Computing Finite Binary
Sequences",
journal = jJACM,
volume = "13",
number = "4",
pages = "547569",
month = oct,
year = "1966",
CODEN = "JACOAH",
DOI = "http://dx.doi.org/10.1145/321356.321363",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jacm.bib;
http://www.math.utah.edu/pub/tex/bib/prng.bib",
abstract = "The use of Turing machines for calculating finite
binary sequences is studied from the point of view of
information theory and the theory of recursive
functions. Various results are obtained concerning the
number of:instructions ia programs. A modified form of
Turing machine is studied from the same point of view.
Aa application to the problem of defining a patternless
sequence is proposed in terms of the concepts here
developed.",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
rawdata = "Chaitin, Gregory J. (1966) ``On the Lengths of
Programs for Computing Finite Binary Sequences,'' {\it
Journal of the ACM}, {\bf13}(4):547569, October.",
}ence Time Coding for Data
Compression'",
journal = jPROCIEEE,
volume = "54",
pages = "2010",
month = dec,
year = "1966",
CODEN = "IEEPAD",
ISSN = "00189219 (print), 15582256 (electronic)",
ISSNL = "00189219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Proceedings of the IEEE",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Davisson, I. D. (1966) ``Comments on `Sequence Time
Coding for Data Compression','' {\it Proceedings of the
IEEE}, {\bf54}:2010, December.",
}"
&2y2Xvm
@Article{DeMarchi:2001:AAN,
author = "Stefano {De Marchi} and Marco Vianello",
title = U+
@Article{DeVore:1992:ICT,
author = "R. DeVore and others",
title = "Image Compres
@Article{DePrisco:1998:DEH,
author = "Roberto {De Prisco} and Alfredo {De Santis}",
titlApa
@Article{DeCanne:1994:ERC,
author = "B. {De Canne}",
title = "Errorrecovery code WI
@Article{DeAgostino:2000:EPC,
author = "Sergio {De Agostino}",
title = "Erratum to {``Pcomplete Problems in Data
Compression'' [Theoret. Comput. Sci. 127 (1994)
xq
@Article{DeAgostino:1996:LVL,
author = "Sergio {De Agostino} and James A. Storer",
title2k
@Article{DeAgostino:1994:PCP,
author = =
@Article{Degener:1994:DSC,
author = "Jutta Degener",
title = "Digital Speech Compression",
journal = jDDJ,
volume = "19",
Zdings of the IEEEackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5I. D. DavissonComments on `Sequence Time Coding for Data Compression'
@Article{Davisson:1966:CST,
author = "I. D. Davisson",
title = "Comments on `Sequence Time Coding for Data
Compression'",
journal = jPROCIEEE,
volume = "54",
pages = "2010",
month = dec,
year = "1966",
CODEN = "IEEPAD",
ISSN = "00189219 (print), 15582256 (electronic)",
ISSNL = "00189219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Proceedings of the IEEE",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Davisson, I. D. (1966) ``Comments on `Sequence Time
Coding for Data Compression','' {\it Proceedings of the
IEEE}, {\bf54}:2010, December.",
}
9t$V 3+/5;57E};[/5articledatacompression.bibGolomb:1966:RLESolomon W. GolombRunLength EncodingsjIEEETRANSINFTHEORYIT1233994011966IETTAW00189448 (print), 15579654 (electr{@#U 3'a#7E};5uIarticledatacomprey<"V 3/){#57E};;){[articledatacompression.bibDavisson:1966:CSTI. D. DavissonComments on `Sequence Time Coding for Data Compression'jPROCIEEE542010dec121966IEEPAD00189219 (print), 15582256 (electronic) OR 00189219 (print), 15582256 (electronic)00189219 OR 00189219Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTProceev{It}'s {ETAONI} {RSHDLC}",
journal = jJOURNALQ,
volume = "43",
pages = "761762",
year = "1966",
CODEN = "JOQUAX",
ISSN = "01963031",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Journalism Quarterly",
rawdata = "Fang I. (1966) ``It Isn't ETAOIN SHRDLU; It's ETAONI
RSHDLC,'' {\it Journalism Quarterly},
{\bf43}:761762.",
}#ssion.bibFang:1966:IIEI. FangIt Isn't ETAOIN SHRDLU; It's ETAONI RSHDLCjJOURNALQ437617621966JOQUAX01963031 OR 01963031Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTJournalism QuarterlyackdsI. FangIt Isn't {ETAOIN} {SHRDLU}; {It}'s {ETAONI} {RSHDLC}
@Article{Fang:1966:IIE,
author = "I. Fang",
title = "It Isn't {ETAOIN} {SHRDLU}; {It}'s {ETAONI} {RSHDLC}",
journal = jJOURNALQ,
volume = "43",
pages = "761762",
year = "1966",
CODEN = "JOQUAX",
ISSN = "01963031",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Journalism Quarterly",
rawdata = "Fang I. (1966) ``It Isn't ETAOIN SHRDLU; It's ETAONI
RSHDLC,'' {\it Journalism Quarterly},
{\bf43}:761762.",
}ings",
journal = jIEEETRANSINFTHEORY,
volume = "IT12",
number = "3",
pages = "399401",
year = "1966",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Golomb, Solomon W. (1966) ``RunLength Encodings,''
{\it IEEE Transactions on Information Theory}, {\bf
IT12}(3):399401.",
}$onic) OR 00189448 (print), 15579654 (electronic)00189448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information TheoryackdsSolomon W. GolombRunLength Encodings
@Article{Golomb:1966:RLE,
author = "Solomon W. Golomb",
title = "RunLength Encodings",
journal = jIEEETRANSINFTHEORY,
volume = "IT12",
number = "3",
pages = "399401",
year = "1966",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Golomb, Solomon W. (1966) ``RunLength Encodings,''
{\it IEEE Transactions on Information Theory}, {\bf
IT12}(3):399401.",
}ion with ErrorControl Coding for Space
Telemetry",
type = "{Ph.D.} thesis",
school = "University of Maryland",
address = "College Park, MD, USA",
pages = "130",
year = "1966",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302201464",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "6702337",
subject = "Electrical engineering",
}%09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/302201464Electrical engineeringacknhfbThomas Joseph LynchData Compression with ErrorControl Coding for Space Telemetry
@PhdThesis{Lynch:1966:DCE,
author = "Thomas Joseph Lynch",
title = "Data Compression with ErrorControl Coding for Space
Telemetry",
type = "{Ph.D.} thesis",
school = "University of Maryland",
address = "College Park, MD, USA",
pages = "130",
year = "1966",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302201464",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "6702337",
subject = "Electrical engineering",
}
`r'Y 35])/!57E;ISkW]M)oarticledatacos&V 3)#_#!57E};;#_articledatacompression.bibLynch:1966:STCT. J. LynchSequence Time Coding for Data CompressionjPROCIEEE5414901491oct101966IEEPAD00189219 (print), 15582256 (electronic) OR 00189219 (print), 15582256 (electronic)00189219 OR 00189219Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/%X 3)3 %97C7;e93 Uphdthesisdatacompression.bibLynch:1966:DCEThomas Joseph LynchData Compression with ErrorControl Coding for Space TelemetryPh.D. thesisUniversity of MarylandCollege Park, MD, USA1301966Fri Feb 1 }r Data Compression",
journal = jPROCIEEE,
volume = "54",
pages = "14901491",
month = oct,
year = "1966",
CODEN = "IEEPAD",
ISSN = "00189219 (print), 15582256 (electronic)",
ISSNL = "00189219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Proceedings of the IEEE",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Lynch, T. J. (1966) ``Sequence Time Coding for Data
Compression,'' {\it Proceedings of the IEEE},
{\bf54}:14901491, October.",
}&pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTProceedings of the IEEEackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5T. J. LynchSequence Time Coding for Data Compression
@Article{Lynch:1966:STC,
author = "T. J. Lynch",
title = "Sequence Time Coding for Data Compression",
journal = jPROCIEEE,
volume = "54",
pages = "14901491",
month = oct,
year = "1966",
CODEN = "IEEPAD",
ISSN = "00189219 (print), 15582256 (electronic)",
ISSNL = "00189219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Proceedings of the IEEE",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Lynch, T. J. (1966) ``Sequence Time Coding for Data
Compression,'' {\it Proceedings of the IEEE},
{\bf54}:14901491, October.",
}e = "Corrigenda: Systematic Statistics used for Data
Compression in Space Telemetry",
journal = jJAMSTATASSOC,
volume = "62",
number = "320",
pages = "15181518",
month = dec,
year = "1967",
CODEN = "JSTNAL",
ISSN = "01621459 (print), 1537274X (electronic)",
ISSNL = "01621459",
bibdate = "Wed Jan 25 08:05:39 MST 2012",
bibsource = "http://www.jstor.org/journals/01621459.html;
http://www.jstor.org/stable/i314202;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib",
note = "See \cite{Eisenberger:1965:SSU}.",
URL = "http://www.jstor.org/stable/2283812",
acknowledgement = acknhfb,
fjournal = "Journal of the American Statistical Association",
journalURL = "http://www.tandfonline.com/loi/uasa20",
}'mpression.bibEisenberger:1967:CSSIsidore Eisenberger and Edward C. PosnerCorrigenda: Systematic Statistics used for Data Compression in Space TelemetryjJAMSTATASSOC6232015181518dec121967JSTNAL01621459 (print), 1537274X (electronic) OR 01621459 (print), 1537274X (electronic)01621459 OR 01621459Wed Jan 25 08:05:39 MST 2012http://www.jstor.org/journals/01621459.html; http://www.jstor.org/stable/i314202; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib2012.01.25 08:05:39 MSTSee cite Eisenberger:1965:SSU.http://www.jstor.org/stable/2283812Journal of the American Statistical Associationacknhfbhttp://www.tandfonline.com/loi/uasa20Isidore Eisenberger and Edward C. PosnerSee \cite{Eisenberger:1965:SSU}.Corrigenda: Systematic Statistics used for Data Compression in Space Telemetry
@Article{Eisenberger:1967:CSS,
author = "Isidore Eisenberger and Edward C. Posner",
title = "Corrigenda: Systematic Statistics used for Data
Compression in Space Telemetry",
journal = jJAMSTATASSOC,
volume = "62",
number = "320",
pages = "15181518",
month = dec,
year = "1967",
CODEN = "JSTNAL",
ISSN = "01621459 (print), 1537274X (electronic)",
ISSNL = "01621459",
bibdate = "Wed Jan 25 08:05:39 MST 2012",
bibsource = "http://www.jstor.org/journals/01621459.html;
http://www.jstor.org/stable/i314202;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib",
note = "See \cite{Eisenberger:1965:SSU}.",
URL = "http://www.jstor.org/stable/2283812",
acknowledgement = acknhfb,
fjournal = "Journal of the American Statistical Association",
journalURL = "http://www.tandfonline.com/loi/uasa20",
}Automatic Programming",
journal = jCOMPJ,
volume = "10",
number = "2",
pages = "165167",
month = aug,
year = "1967",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/10.2.165",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:47:38 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/10/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1960.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/10/2/165.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/100165.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/165.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/166.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/167.tif",
acknowledgement = acknhfb,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
}(
+L+r&H
@Article{Do:2014:FRL,
author = "Huy Hoang Do and Jesper Jansson and Kunihiko Sadakane
&P
@Article{Drinic:2007:PPC,
author = "Milenko Drini{\'c} and Darko Kirovski and Hoi Vo",
t~R%
@Article{Dickman:1992:PCS,
author = "Chris Dickman",
title = "The {President} andG
@Article{Du:2008:LCP,
author = "Qian Du and James E. Fowler",
title = "LowComplesi
@Article{Durbin:1960:FTS,
author = "J. Durbin",
title = "The Fitting of TimeSeriW={
@Article{Disque:1988:SCT,
author = "Tom Disque",
title = "Simple Compression TechX1
@Article{Dion:1993:CPC,
author = "Pierre J. Dion",
title = "CrossPlatform Compre$1c
@Article{Dunlavey:1981:LES,
author = "Michael R. Dunlavey",
title = "Letter to th>}
@Article{Dunham:1980:AAS,
author = "James G. Dunham",
title = "Abstract Alphabet compression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/2012.12.04 14:47:38 MSThttp://comjnl.oxfordjournals.org/content/10/2/165.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/100165.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/165.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/166.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/167.tifThe Computer Journalacknhfbhttp://comjnl.oxfordjournals.org/A. G. FraserData Compression and Automatic Programming
@Article{Fraser:1967:DCA,
author = "A. G. Fraser",
title = "Data Compression and Automatic Programming",
journal = jCOMPJ,
volume = "10",
number = "2",
pages = "165167",
month = aug,
year = "1967",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/10.2.165",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:47:38 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/10/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1960.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/10/2/165.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/100165.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/165.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/166.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/167.tif",
acknowledgement = acknhfb,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
}
>(X 3+%a_57C+;y5O%a_articledatacompression.bibFraser:1967:DCAA. G. FraserData Compression and Automatic ProgrammingjCOMPJ102165167aug81967CMPJA6http://dx.doi.org/10.1093/comjnl/10.2.16500104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Tue Dec 4 14:47:38 MST 2012http://comjnl.oxfordjournals.org/content/10/2.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1960.bib; http://www.math.utah.edu/pub/tex/bib/data"Automatic Data Compression",
journal = jCACM,
volume = "10",
number = "11",
pages = "711715",
month = nov,
year = "1967",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Fri Nov 25 18:20:16 MST 2005",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Also published in/as: File Organization, Siwerts and
Zeitlinge (Amsterdam), 1969.",
abstract = "The ``information explosion'' noted in recent years
makes it essential that storage requirements for all
information be kept to a minimum. A fully automatic and
rapid threepart compressor which can be used with
``any'' body of information to greatly reduce slow
external storage requirements and to increase the rate
of information transmission through a computer is
described in this paper. The system will also
automatically decode the compressed information on an
itembyitem basis when it is required. The three
component compressors, which can be used separately to
accomplish their specific tasks, are discussed: NUPAK
for the automatic compression of numerical data, ANPAK
for the automatic compression of ``any'' information,
and IOPAK for further compression of information to be
stored on tape or cards.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
})th.utah.edu/pub/tex/bib/datacompression.bib2005.11.25 18:20:16 MSTAlso published in/as: File Organization, Siwerts and Zeitlinge (Amsterdam), 1969.The ``information explosion'' noted in recent years makes it essential that storage requirements for all information be kept to a minimum. A fully automatic and rapid threepart compressor which can be used with ``any'' body of information to greatly reduce slow external storage requirements and to increase the rate of information transmission through a computer is described in this paper. The system will also automatically decode the compressed information on an itembyitem basis when it is required. The three component compressors, which can be used separately to accomplish their specific tasks, are discussed: NUPAK for the automatic compression of numerical data, ANPAK for the automatic compression of ``any'' information, and IOPAK for further compression of information to be stored on tape or cards.Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79The ``information explosion'' noted in recent years makes it essential that storage requirements for all information be kept to a minimum. A fully automatic and rapid threepart compressor which can be used with ``any'' body of information to greatly reduce slow external storage requirements and to increase the rate of information transmission through a computer is described in this paper. The system will also automatically decode the compressed information on an itembyitem basis when it is required. The three component compressors, which can be used separately to accomplish their specific tasks, are discussed: NUPAK for the automatic compression of numerical data, ANPAK for the automatic compression of ``any'' information, and IOPAK for further compression of information to be stored on tape or cards.B. A. Marron and P. A. D. de MaineAlso published in/as: File Organization, Siwerts and Zeitlinge (Amsterdam), 1969.Automatic Data Compression
@Article{Marron:1967:ADC,
author = "B. A. Marron and P. A. D. de Maine",
title = "Automatic Data Compression",
journal = jCACM,
volume = "10",
number = "11",
pages = "711715",
month = nov,
year = "1967",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Fri Nov 25 18:20:16 MST 2005",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/contents/journals/cacm/;
http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Also published in/as: File Organization, Siwerts and
Zeitlinge (Amsterdam), 1969.",
abstract = "The ``information explosion'' noted in recent years
makes it essential that storage requirements for all
information be kept to a minimum. A fully automatic and
rapid threepart compressor which can be used with
``any'' body of information to greatly reduce slow
external storage requirements and to increase the rate
of information transmission through a computer is
described in this paper. The system will also
automatically decode the compressed information on an
itembyitem basis when it is required. The three
component compressors, which can be used separately to
accomplish their specific tasks, are discussed: NUPAK
for the automatic compression of numerical data, ANPAK
for the automatic compression of ``any'' information,
and IOPAK for further compression of information to be
stored on tape or cards.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
7.+U 3/)]1KE};)]!phdthesisdatacompr*V 39A%51C7;e99Eophdthesisdatacompression.bibStanley:1967:CMDThomas Patrick StanleyCompression)[3+QA57EC;/k?ckQ/AYarticledatacompression.bibMarron:1967:ADCB. A. Marron and P. A. D. de MaineAutomatic Data CompressionjCACM1011711715nov111967CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Fri Nov 25 18:20:16 MST 2005ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.maion of {Markov} Data",
type = "{Ph.D.} thesis",
school = "Princeton University",
address = "Princeton, NJ, USA",
pages = "106",
year = "1967",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302264732",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "6802519",
subject = "Electrical engineering",
}* of Markov DataPh.D. thesisPrinceton UniversityPrinceton, NJ, USA1061967Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302264732Electrical engineeringacknhfbThomas Patrick StanleyCompression of {Markov} Data
@PhdThesis{Stanley:1967:CMD,
author = "Thomas Patrick Stanley",
title = "Compression of {Markov} Data",
type = "{Ph.D.} thesis",
school = "Princeton University",
address = "Princeton, NJ, USA",
pages = "106",
year = "1967",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302264732",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "6802519",
subject = "Electrical engineering",
}iseless Compression Codes",
type = "{Ph.D.} Dissertation",
school = "Georgia Institute of Technology",
address = "Atlanta, GA, USA",
pages = "??",
year = "1967",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Tunstall, B. P., (1967) ``Synthesis of Noiseless
Compression Codes,'' Ph.D. dissertation, Georgia
Institute of Technology, Atlanta, GA.",
}+ession.bibTunstall:1967:SNCB. P. TunstallSynthesis of Noiseless Compression CodesPh.D. DissertationGeorgia Institute of TechnologyAtlanta, GA, USA1967Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsB. P. TunstallSynthesis of Noiseless Compression Codes
@PhdThesis{Tunstall:1967:SNC,
author = "B. P. Tunstall",
title = "Synthesis of Noiseless Compression Codes",
type = "{Ph.D.} Dissertation",
school = "Georgia Institute of Technology",
address = "Atlanta, GA, USA",
pages = "??",
year = "1967",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Tunstall, B. P., (1967) ``Synthesis of Noiseless
Compression Codes,'' Ph.D. dissertation, Georgia
Institute of Technology, Atlanta, GA.",
}and SubOptimum Compression of Second Order
{Markov} Data",
type = "{Ph.D.} thesis",
school = "University of Maryland",
address = "College Park, MD, USA",
pages = "155",
year = "1969",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302460376",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7011656",
subject = "Electrical engineering",
}, 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302460376Electrical engineeringacknhfbArthur Jay BruckheimOptimum and SubOptimum Compression of Second Order {Markov} Data
@PhdThesis{Bruckheim:1969:OSO,
author = "Arthur Jay Bruckheim",
title = "Optimum and SubOptimum Compression of Second Order
{Markov} Data",
type = "{Ph.D.} thesis",
school = "University of Maryland",
address = "College Park, MD, USA",
pages = "155",
year = "1969",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302460376",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7011656",
subject = "Electrical engineering",
}
s.W '3+7==/5E1;7=mastersthesisdatacompression.bibHusson:1970:DCSGeorges Eugene HussonData compression systemsDip.Eng. (Elec.), M.Eng.McGill UniversityMontreal, QC, Canadaiii ++V 3+3O%75C7;e93Owphdthesisdatacompression.bibBowyer:1970:DCTDuane Ernest BowyerData Compression and Transm),X 315%97C7;e95ephdthesisdatacompression.bibBruckheim:1969:OSOArthur Jay BruckheimOptimum and SubOptimum Compression of Second Order Markov DataPh.D. thesisUniversity of MarylandCollege Park, MD, USA1551969Fri Feb 1 09:20:32 MSTsion and Transmission",
type = "{Ph.D.} thesis",
school = "University of Florida",
address = "Gainesville, FL, USA",
pages = "146",
year = "1970",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302406194",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7116765",
subject = "Electrical engineering",
}issionPh.D. thesisUniversity of FloridaGainesville, FL, USA1461970Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302406194Electrical engineeringacknhfbDuane Ernest BowyerData Compression and Transmission
@PhdThesis{Bowyer:1970:DCT,
author = "Duane Ernest Bowyer",
title = "Data Compression and Transmission",
type = "{Ph.D.} thesis",
school = "University of Florida",
address = "Gainesville, FL, USA",
pages = "146",
year = "1970",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302406194",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7116765",
subject = "Electrical engineering",
}ompression systems",
type = "{Dip.Eng. (Elec.), M.Eng.}",
school = "McGill University",
address = "Montr{\'e}al, QC, Canada",
pages = "iii + 125",
year = "1970",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlcbnc.ca:210/NL;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://digitool.library.mcgill.ca/thesisfile49103.pdf;
http://www.collectionscanada.ca/obj/thesescanada/vol1/QMM/TCQMM49103.pdf",
acknowledgement = acknhfb,
}. 1251970Mon Jan 28 15:10:29 MST 2013amicus.nlcbnc.ca:210/NL; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.28 15:10:29 MSThttp://digitool.library.mcgill.ca/thesisfile49103.pdf; http://www.collectionscanada.ca/obj/thesescanada/vol1/QMM/TCQMM49103.pdfacknhfbGeorges Eugene HussonData compression systems
@MastersThesis{Husson:1970:DCS,
author = "Georges Eugene Husson",
title = "Data compression systems",
type = "{Dip.Eng. (Elec.), M.Eng.}",
school = "McGill University",
address = "Montr{\'e}al, QC, Canada",
pages = "iii + 125",
year = "1970",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlcbnc.ca:210/NL;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://digitool.library.mcgill.ca/thesisfile49103.pdf;
http://www.collectionscanada.ca/obj/thesescanada/vol1/QMM/TCQMM49103.pdf",
acknowledgement = acknhfb,
}able Data Compression of Constant Rate {Markov}
Sources for Fixed Rate Channels",
type = "{Ph.D.} thesis",
school = "Cornell University",
address = "Ithaca, NY, USA",
pages = "343",
year = "1970",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302518830",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7101075",
subject = "Electrical engineering",
}/http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302518830Electrical engineeringacknhfbKenneth Stuart SchneiderReliable Data Compression of Constant Rate {Markov} Sources for Fixed Rate Channels
@PhdThesis{Schneider:1970:RDC,
author = "Kenneth Stuart Schneider",
title = "Reliable Data Compression of Constant Rate {Markov}
Sources for Fixed Rate Channels",
type = "{Ph.D.} thesis",
school = "Cornell University",
address = "Ithaca, NY, USA",
pages = "343",
year = "1970",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302518830",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7101075",
subject = "Electrical engineering",
}
;0X 35e%/;C7;e95m[phdthesisdatacompression.bibWilkins:1970:SDCLarry Clarke WilkinsStudies on Data Compression. Part I: Picture Coding By Contours. Part II: Error Analysis of RunLength CodesPh.D. thesisPurdue UniversityWest Lafayette, IN, USA3181970Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20W/X 31=/%1+C7;e9=3}phdthesisdatacompression.bibSchneider:1970:RDCKenneth Stuart SchneiderReliable Data Compression of Constant Rate Markov Sources for Fixed Rate ChannelsPh.D. thesisCornell UniversityIthaca, NY, USA3431970Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; Data Compression. {Part I}: Picture Coding
By Contours. {Part II}: Error Analysis of RunLength
Codes",
type = "{Ph.D.} thesis",
school = "Purdue University",
address = "West Lafayette, IN, USA",
pages = "318",
year = "1970",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302522243",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7109481",
subject = "Electrical engineering",
}0:32 MSThttp://search.proquest.com/docview/302522243Electrical engineeringacknhfbLarry Clarke WilkinsStudies on Data Compression. {Part I}: Picture Coding By Contours. {Part II}: Error Analysis of RunLength Codes
@PhdThesis{Wilkins:1970:SDC,
author = "Larry Clarke Wilkins",
title = "Studies on Data Compression. {Part I}: Picture Coding
By Contours. {Part II}: Error Analysis of RunLength
Codes",
type = "{Ph.D.} thesis",
school = "Purdue University",
address = "West Lafayette, IN, USA",
pages = "318",
year = "1970",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302522243",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7109481",
subject = "Electrical engineering",
}thmic Selection of the Best Method for
Compressing Map Data Strings",
journal = jCACM,
volume = "14",
number = "12",
pages = "769774",
month = dec,
year = "1971",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Mon Jan 22 06:21:16 MST 2001",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm14.html#AmidonA71;
http://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "The best of a dozen different methods for compressing
map data is illustrated. The choices are generated by
encoding data stringssequence of like codesby three
methods and in four directions. Relationships are
developed between compression alternatives to avoid
comparing all of them. The technique has been used to
compress data from forest resource maps, but is widely
applicable to map and photographic data reduction.",
acknowledgement = acknhfb,
classcodes = "C6130 (Data handling techniques); C7890 (Other special
applications of computing)",
corpsource = "Pacific Southwest Forest and Range Experiment Station,
Berkeley, CA, USA",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "data compression; data reduction; data reduction and
analysis; data strings; forest resource maps;
information retrieval; input/output; map; map storage;
run coding; storage",
oldlabel = "AmidonA71",
treatment = "P Practical",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AmidonA71",
}1cable to map and photographic data reduction.Communications of the ACMdata compression; data reduction; data reduction and analysis; data strings; forest resource maps; information retrieval; input/output; map; map storage; run coding; storageacknhfbC6130 (Data handling techniques); C7890 (Other special applications of computing)Pacific Southwest Forest and Range Experiment Station, Berkeley, CA, USAhttp://portal.acm.org/browse_dl.cfm?idx=J79P PracticalThe best of a dozen different methods for compressing map data is illustrated. The choices are generated by encoding data stringssequence of like codesby three methods and in four directions. Relationships are developed between compression alternatives to avoid comparing all of them. The technique has been used to compress data from forest resource maps, but is widely applicable to map and photographic data reduction.E. L. Amidon and G. S. AkinAlgorithmic Selection of the Best Method for Compressing Map Data Strings
@Article{Amidon:1971:ASB,
author = "E. L. Amidon and G. S. Akin",
title = "Algorithmic Selection of the Best Method for
Compressing Map Data Strings",
journal = jCACM,
volume = "14",
number = "12",
pages = "769774",
month = dec,
year = "1971",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Mon Jan 22 06:21:16 MST 2001",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm14.html#AmidonA71;
http://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "The best of a dozen different methods for compressing
map data is illustrated. The choices are generated by
encoding data stringssequence of like codesby three
methods and in four directions. Relationships are
developed between compression alternatives to avoid
comparing all of them. The technique has been used to
compress data from forest resource maps, but is widely
applicable to map and photographic data reduction.",
acknowledgement = acknhfb,
classcodes = "C6130 (Data handling techniques); C7890 (Other special
applications of computing)",
corpsource = "Pacific Southwest Forest and Range Experiment Station,
Berkeley, CA, USA",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "data compression; data reduction; data reduction and
analysis; data strings; forest resource maps;
information retrieval; input/output; map; map storage;
run coding; storage",
oldlabel = "AmidonA71",
treatment = "P Practical",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AmidonA71",
}
))D1^3+C57Ee;[?g/c#[CKarticledatacompression.bibAmidon:1971:ASBE. L. Amidon and G. S. AkinAlgorithmic Selection of the Best Method for Compressing Map Data StringsjCACM1412769774dec121971CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Mon Jan 22 06:21:16 MST 2001http://dblp.unitrier.de/db/journals/cacm/cacm14.html#AmidonA71; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2001.01.22 06:21:16 MSTThe best of a dozen different methods for compressing map data is illustrated. The choices are generated by encoding data stringssequence of like codesby three methods and in four directions. Relationships are developed between compression alternatives to avoid comparing all of them. The technique has been used to compress data from forest resource maps, but is widely appli mathematical basis for data
compression",
publisher = pubPH,
address = pubPH:adr,
pages = "xiii + 311",
year = "1971",
ISBN = "0137531036",
ISBN13 = "9780137531035",
LCCN = "Q385 .B47",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "PrenticeHall series in information and system
sciences; PrenticeHall electrical engineering series",
acknowledgement = acknhfb,
subject = "Rate distortion theory; Coding theory; Information
theory",
}2ormation and system sciences; PrenticeHall electrical engineering seriesRate distortion theory; Coding theory; Information theoryacknhfbToby BergerRate distortion theory; a mathematical basis for data compression
@Book{Berger:1971:RDT,
author = "Toby Berger",
title = "Rate distortion theory; a mathematical basis for data
compression",
publisher = pubPH,
address = pubPH:adr,
pages = "xiii + 311",
year = "1971",
ISBN = "0137531036",
ISBN13 = "9780137531035",
LCCN = "Q385 .B47",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "PrenticeHall series in information and system
sciences; PrenticeHall electrical engineering series",
acknowledgement = acknhfb,
subject = "Rate distortion theory; Coding theory; Information
theory",
}
&&O2Y 3+#!!CQE5;U#YDbookdatacompression.bibBerger:1971:RDTToby BergerRate distortion theory; a mathematical basis for data compressionpubPHpubPH:adrxiii + 31119710137531036 OR 01375310369780137531035 OR 9780137531035Q385 .B47Mon Jan 28 15:19:07 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; z3950.loc.gov:7090/Voyager2013.01.28 15:19:07 MSTPrenticeHall series in inf "Epsilon Entropy and Data Compression",
journal = jANNMATHSTAT,
volume = "42",
number = "6",
pages = "20792125",
month = dec,
year = "1971",
CODEN = "AASTAD",
DOI = "http://dx.doi.org/10.1214/aoms/1177693077",
ISSN = "00034851",
ISSNL = "00034851",
bibdate = "Sat May 31 09:11:21 MDT 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/annmathstat.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://projecteuclid.org/euclid.aoms/1177693077",
acknowledgement = acknhfb,
fjournal = "Annals of Mathematical Statistics",
journalURL = "http://projecteuclid.org/all/euclid.aoms/",
}37Annals of Mathematical Statisticsacknhfbhttp://projecteuclid.org/all/euclid.aoms/Edward C. Posner and Eugene R. RodemichEpsilon Entropy and Data Compression
@Article{Posner:1971:EED,
author = "Edward C. Posner and Eugene R. Rodemich",
title = "Epsilon Entropy and Data Compression",
journal = jANNMATHSTAT,
volume = "42",
number = "6",
pages = "20792125",
month = dec,
year = "1971",
CODEN = "AASTAD",
DOI = "http://dx.doi.org/10.1214/aoms/1177693077",
ISSN = "00034851",
ISSNL = "00034851",
bibdate = "Sat May 31 09:11:21 MDT 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/annmathstat.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://projecteuclid.org/euclid.aoms/1177693077",
acknowledgement = acknhfb,
fjournal = "Annals of Mathematical Statistics",
journalURL = "http://projecteuclid.org/all/euclid.aoms/",
}
3V3+[U+!_77Ei;kO_[UI/articledatacompression.bibPosner:1971:EEDEdward C. Posner and Eugene R. RodemichEpsilon Entropy and Data CompressionjANNMATHSTAT42620792125dec121971AASTADhttp://dx.doi.org/10.1214/aoms/117769307700034851 OR 0003485100034851 OR 00034851Sat May 31 09:11:21 MDT 2014http://www.math.utah.edu/pub/tex/bib/annmathstat.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2014.05.31 09:11:21 MDThttp://projecteuclid.org/euclid.aoms/117769307Redundancy Codes with an
Optimum Synchronization Property",
journal = jIEEETRANSINFTHEORY,
volume = "17",
number = "4",
pages = "478487",
month = jul,
year = "1971",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Rudner, B. (1971) ``Construction of MinimumRedundancy
Codes with an Optimum Synchronization Property,'' {\it
IEEE Transactions on Information Theory},
{\bf17}(4):478487, July.",
}4yackdsB. RudnerConstruction of MinimumRedundancy Codes with an Optimum Synchronization Property
@Article{Rudner:1971:CMR,
author = "B. Rudner",
title = "Construction of MinimumRedundancy Codes with an
Optimum Synchronization Property",
journal = jIEEETRANSINFTHEORY,
volume = "17",
number = "4",
pages = "478487",
month = jul,
year = "1971",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Rudner, B. (1971) ``Construction of MinimumRedundancy
Codes with an Optimum Synchronization Property,'' {\it
IEEE Transactions on Information Theory},
{\bf17}(4):478487, July.",
}
4X 3+/;57E};[/C
articledatacompression.bibRudner:1971:CMRB. RudnerConstruction of MinimumRedundancy Codes with an Optimum Synchronization PropertyjIEEETRANSINFTHEORY174478487jul71971IETTAW00189448 (print), 15579654 (electronic) OR 00189448 (print), 15579654 (electronic)00189448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theor "??",
year = "1972",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/G.711",
acknowledgement = ackds,
rawdata = "G.711 (1972) http://en.wikipedia.org/wiki/G.711.",
}5
q0q46V 3)'u%9/C7;e)'ukphdthesisdatacompression.bibDosik:1972:OBCPaul H. DosikAn Optimal Buffer Controlled Data CompressiM5U 3E};QEmiscdatacompression.bibAnonymous:1972:GAnonymousG.7111972Sat Jan 26 12:46:12 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:12 MSThttp://en.wikipedia.org/wiki/G.711ackdsAnonymous{G.711}
@Misc{Anonymous:1972:G,
author = "Anonymous",
title = "{G.711}",
pages = "??",
year = "1972",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/G.711",
acknowledgement = ackds,
rawdata = "G.711 (1972) http://en.wikipedia.org/wiki/G.711.",
}ontrolled Data Compression System",
type = "{Ph.D.} thesis",
school = "Polytechnic University",
address = "New York, NY, USA",
pages = "190",
year = "1972",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302676863",
acknowledgement = acknhfb,
classification = "0790: Systems design",
dissertationthesisnumber = "7228226",
subject = "Systems design",
}6on SystemPh.D. thesisPolytechnic UniversityNew York, NY, USA1901972Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302676863Systems designacknhfbPaul H. DosikAn Optimal Buffer Controlled Data Compression System
@PhdThesis{Dosik:1972:OBC,
author = "Paul H. Dosik",
title = "An Optimal Buffer Controlled Data Compression System",
type = "{Ph.D.} thesis",
school = "Polytechnic University",
address = "New York, NY, USA",
pages = "190",
year = "1972",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302676863",
acknowledgement = acknhfb,
classification = "0790: Systems design",
dissertationthesisnumber = "7228226",
subject = "Systems design",
},
year = "1972",
CODEN = "SCAMAC",
ISSN = "00368733 (print), 19467087 (electronic)",
ISSNL = "00368733",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.gemstartvguide.com;
http://www.macrovision.com/products/ce_manufacturers/ipg_ce/vcr_plus.htm",
acknowledgement = ackds,
fjournal = "Scientific American",
journalURL = "http://www.nature.com/scientificamerican",
rawdata1 = "Gardner, Martin (1972) ``Mathematical Games,'' {\it
Scientific American}, {\bf227}(2):106, August. Gemstar
(2006) is\hfil\break
http://www.macrovision.com/products/ce_manufacturers/ipg_ce/vcr_plus.htm.",
rawdata2 = "Gardner, Martin (1972) ``Mathematical Games,'' {\it
Scientific American}, {\bf227}(2):106, August. Gemstar
(2007) http://www.gemstartvguide.com.",
}7
+L+r&gO
@Article{Jahnke:2010:SCM,
author = "Tobias Jahnke and Tudor Udrescu",
title = "So"4aC
@Article{Jena:1999:ILZ,
author = "S. K. Jena",
title = "An Improved {LempelZiv}/bE
@Article{Jayant:1995:ACT,
author = "Nikil S. Jayant and Edward Y. Chen",
title = Ay
@Article{Jakobsson:1985:CCS,
author = "Matti Jakobsson",
title = "Compression of =}
@Article{Jakobsson:1978:HCB,
author = "M. Jakobsson",
title = "{Huffman} coding i
@Article{Jagadish:1990:CTM,
author = "H. V. Jagadish",
title = "A Compression TecJ
@Article{Jenkins:2012:ADL,
author = "John Jenkins and Isha Arkatkar and Sriram
$4i
@Article{Jang:2013:PSP,
author = "Hakbeom Jang and Channoh Kim and Jae W. Lee",
title = %
@Article{Jacquet:2001:APL,
author = "P. Jacquet and W. Szpankowski and J. Tang",
title =)g,
year = "1972",
CODEN = "SCAMAC",
ISSN = "00368733 (print), 19467087 (electronic)",
ISSNL = "00368733",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.gemstartvguide.com;
http://www.macrovision.com/products/ce_manufacturers/ipg_ce/vcr_plus.htm",
acknowledgement = ackds,
fjournal = "Scientific American",
journalURL = "http://www.nature.com/scientificamerican",
rawdata1 = "Gardner, Martin (1972) ``Mathematical Games,'' {\it
Scientific American}, {\bf227}(2):106, August. Gemstar
(2006) is\hfil\break
http://www.macrovision.com/products/ce_manufacturers/ipg_ce/vcr_plus.htm.",
rawdata2 = "Gardner, Martin (1972) ``Mathematical Games,'' {\it
Scientific American}, {\bf227}(2):106, August. Gemstar
(2007) http://www.gemstartvguide.com.",
}
<7W 3+)1!57E};[3])1Earticledatacompression.bibGardner:1972:MGMartin GardnerMathematical GamesjSCIAMER2272106106aug81972SCAMAC00368733 (print), 19467087 (electronic) OR 00368733 (print), 19467087 (electronic)00368733 OR 00368733Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSThttp://www.gemstartvguide.com; http://www.macrovision.com/products/ce_manufacturers/ipg_ce/vcr_plus.htmScientific Americanackdshttp://www.nature.com/scientificamericanMartin GardnerMathematical Games
@Article{Gardner:1972:MG,
author = "Martin Gardner",
title = "Mathematical Games",
journal = jSCIAMER,
volume = "227",
number = "2",
pages = "106106",
month = au,
journal = jIEEETRANSINFTHEORY,
volume = "IT12",
number = "3",
pages = "399401",
year = "1972",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Gardner, Martin (1972) ``Mathematical Games,'' {\it
Scientific American}, {\bf227}(2):106, August. Golomb,
S. W. (1966) ``RunLength Encodings,'' {\it IEEE
Transactions on Information Theory}
IT12(3):399401.",
}8h.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:09 MSTIEEE Transactions on Information TheoryackdsS. W. GolombRunLength Encodings
@Article{Golomb:1972:RLE,
author = "S. W. Golomb",
title = "RunLength Encodings",
journal = jIEEETRANSINFTHEORY,
volume = "IT12",
number = "3",
pages = "399401",
year = "1972",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Gardner, Martin (1972) ``Mathematical Games,'' {\it
Scientific American}, {\bf227}(2):106, August. Golomb,
S. W. (1966) ``RunLength Encodings,'' {\it IEEE
Transactions on Information Theory}
IT12(3):399401.",
}
ww
:X 3/;%=+C7;e!;7phdthesisdatacompression.bibKohlhaas:1972:CFCCharles Albert KohlhaasCalculation of Formation Compression From Core and WellTested DataPh.D. thesisColorado School of MinesGolden, CO,9V 3)#A!57E};3]#Aarticledatacompression.bibHeath:1972:OBCF. G. HeathOrigins of the Binary CodejSCIAMER22727676aug81972SCAMAC00368733 (print), 19467087 (electronic) OR 00368733 (print), ^8V 3+%5;57E};[%5iarticledatacompression.bibGolomb:1972:RLES. W. GolombRunLength EncodingsjIEEETRANSINFTHEORYIT1233994011972IETTAW00189448 (print), 15579654 (electronic) OR 00189448 (print), 15579654 (electronic)00189448 OR 00189448Sat Jan 26 12:46:09 MST 2013http://www.matode",
journal = jSCIAMER,
volume = "227",
number = "2",
pages = "7676",
month = aug,
year = "1972",
CODEN = "SCAMAC",
ISSN = "00368733 (print), 19467087 (electronic)",
ISSNL = "00368733",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Scientific American",
journalURL = "http://www.nature.com/scientificamerican",
rawdata = "Heath, F. G. (1972) ``Origins of the Binary Code,''
{\it Scientific American}, {\bf227}(2):76, August.",
}919467087 (electronic)00368733 OR 00368733Sat Jan 26 12:46:09 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:09 MSTScientific Americanackdshttp://www.nature.com/scientificamericanF. G. HeathOrigins of the Binary Code
@Article{Heath:1972:OBC,
author = "F. G. Heath",
title = "Origins of the Binary Code",
journal = jSCIAMER,
volume = "227",
number = "2",
pages = "7676",
month = aug,
year = "1972",
CODEN = "SCAMAC",
ISSN = "00368733 (print), 19467087 (electronic)",
ISSNL = "00368733",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Scientific American",
journalURL = "http://www.nature.com/scientificamerican",
rawdata = "Heath, F. G. (1972) ``Origins of the Binary Code,''
{\it Scientific American}, {\bf227}(2):76, August.",
}ation of Formation Compression From Core and
WellTested Data",
type = "{Ph.D.} thesis",
school = "Colorado School of Mines",
address = "Golden, CO, USA",
pages = "????",
year = "1972",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302554471",
acknowledgement = acknhfb,
classification = "0373: Geophysics",
dissertationthesisnumber = "0231563",
subject = "Geophysics",
}: USA1972Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302554471GeophysicsacknhfbCharles Albert KohlhaasCalculation of Formation Compression From Core and WellTested Data
@PhdThesis{Kohlhaas:1972:CFC,
author = "Charles Albert Kohlhaas",
title = "Calculation of Formation Compression From Core and
WellTested Data",
type = "{Ph.D.} thesis",
school = "Colorado School of Mines",
address = "Golden, CO, USA",
pages = "????",
year = "1972",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302554471",
acknowledgement = acknhfb,
classification = "0373: Geophysics",
dissertationthesisnumber = "0231563",
subject = "Geophysics",
} Mean Squared Error Quantization in Speech
{PCM} and {DPCM} Systems",
journal = jIEEETRANSCOMM,
volume = "COM20",
number = "2",
pages = "225230",
year = "1972",
CODEN = "IECMBT",
ISSN = "00906778 (print), 15580857 (electronic)",
ISSNL = "00906778",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Paez, M. D. and T. H. Glisson (1972) ``Minimum Mean
Squared Error Quantization in Speech PCM and DPCM
Systems,'' {\it IEEE Transactions on Communications},
{\bf COM20}(2):225230,",
};ionsackdsM. D. Paez and T. H. GlissonMinimum Mean Squared Error Quantization in Speech {PCM} and {DPCM} Systems
@Article{Paez:1972:MMS,
author = "M. D. Paez and T. H. Glisson",
title = "Minimum Mean Squared Error Quantization in Speech
{PCM} and {DPCM} Systems",
journal = jIEEETRANSCOMM,
volume = "COM20",
number = "2",
pages = "225230",
year = "1972",
CODEN = "IECMBT",
ISSN = "00906778 (print), 15580857 (electronic)",
ISSNL = "00906778",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Paez, M. D. and T. H. Glisson (1972) ``Minimum Mean
Squared Error Quantization in Speech PCM and DPCM
Systems,'' {\it IEEE Transactions on Communications},
{\bf COM20}(2):225230,",
}
>Y '3'1 {5E1;1 mastersthesisdatacompression.bibTsui:1972:DCPStephen S. T. TsuiData Compression with Particular Applications to Video SignalsM.Eng.Department of Electrical Engineering, McGill UniversityMontreal, QC, Canadaiii + 151dec121972Mon Jan 28 15:10:29 MST 2013amicus.nlcbnc.ca:210/NL; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.28 15:10:29 MSThttp://digitool.library.mcgill.ca/thesisfiȋ3=V 33;I;a57E};[;Iaarticledatacompression.bibSchalkwijk:1972:ASCJ. Pieter M. SchalkwijkAn Algorithm for Source CodingjIEEETRANSINFTHEORY183395399may51972IETTAWhttp://dx.doi.org/10.1109/TIT.1972.105483200189448 (print), 15579654 (electronic) OR 00189448 (print), 15579654 (electronic)00189448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tession with Particular Applications to Video
Signals",
type = "{M.Eng.}",
school = "Department of Electrical Engineering, McGill
University",
address = "Montr{\'e}al, QC, Canada",
pages = "iii + 151",
month = dec,
year = "1972",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlcbnc.ca:210/NL;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://digitool.library.mcgill.ca/thesisfile51654.pdf;
http://www.collectionscanada.ca/obj/thesescanada/vol1/QMM/TCQMM51654.pdf",
acknowledgement = acknhfb,
advisor = "M. Fukada",
}>le51654.pdf; http://www.collectionscanada.ca/obj/thesescanada/vol1/QMM/TCQMM51654.pdfacknhfbM. FukadaStephen S. T. TsuiData Compression with Particular Applications to Video Signals
@MastersThesis{Tsui:1972:DCP,
author = "Stephen S. T. Tsui",
title = "Data Compression with Particular Applications to Video
Signals",
type = "{M.Eng.}",
school = "Department of Electrical Engineering, McGill
University",
address = "Montr{\'e}al, QC, Canada",
pages = "iii + 151",
month = dec,
year = "1972",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlcbnc.ca:210/NL;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://digitool.library.mcgill.ca/thesisfile51654.pdf;
http://www.collectionscanada.ca/obj/thesescanada/vol1/QMM/TCQMM51654.pdf",
acknowledgement = acknhfb,
advisor = "M. Fukada",
} month = nov,
year = "1972",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/15.4.308",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:47:50 MST 2012",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://comjnl.oxfordjournals.org/content/15/4.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/",
note = "See correspondence \cite{Gibbons:1973:CFC}.",
URL = "http://comjnl.oxfordjournals.org/content/15/4/308.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/150308.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/308.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/309.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/310.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/311.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/312.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/313.tif",
acknowledgement = acknhfb,
classcodes = "C6130 (Data handling techniques)",
classification = "723; 911",
corpsource = "Univ. Leeds, UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "codes; computer programming languages; computers,
digital; data handling; data processing; decoding;
encoding; file compression; hardware; software
techniques; variable length encodings",
treatment = "P Practical",
}?/tiff/308.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/309.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/310.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/311.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/312.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/313.tifThe Computer Journalcodes; computer programming languages; computers, digital; data handling; data processing; decoding; encoding; file compression; hardware; software techniques; variable length encodingsacknhfbC6130 (Data handling techniques)Univ. Leeds, UKhttp://comjnl.oxfordjournals.org/P PracticalM. WellsSee correspondence \cite{Gibbons:1973:CFC}.File Compression Using Variable Length Encodings
@Article{Wells:1972:FCU,
author = "M. Wells",
title = "File Compression Using Variable Length Encodings",
journal = jCOMPJ,
volume = "15",
number = "4",
pages = "308313",
month = nov,
year = "1972",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/15.4.308",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:47:50 MST 2012",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://comjnl.oxfordjournals.org/content/15/4.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/",
note = "See correspondence \cite{Gibbons:1973:CFC}.",
URL = "http://comjnl.oxfordjournals.org/content/15/4/308.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/150308.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/308.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/309.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/310.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/311.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/312.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/313.tif",
acknowledgement = acknhfb,
classcodes = "C6130 (Data handling techniques)",
classification = "723; 911",
corpsource = "Univ. Leeds, UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "codes; computer programming languages; computers,
digital; data handling; data processing; decoding;
encoding; file compression; hardware; software
techniques; variable length encodings",
treatment = "P Practical",
}
##J?Y 3)m_57C;_A5M+O#cm=articledatacompression.bibWells:1972:FCUM. WellsFile Compression Using Variable Length EncodingsjCOMPJ154308313nov111972CMPJA6http://dx.doi.org/10.1093/comjnl/15.4.30800104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Tue Dec 4 14:47:50 MST 2012Compendex database; Database/Wiederhold.bib; http://comjnl.oxfordjournals.org/content/15/4.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/2012.12.04 14:47:50 MSTSee correspondence cite Gibbons:1973:CFC.http://comjnl.oxfordjournals.org/content/15/4/308.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/150308.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04 une Somme
de Nombres de {Fibonacci} ou de Nombres de {Lucas}.
({French}) [{Representation} of the natural numbers by
a sum of {Fibonacci} or {Lucas} numbers]",
journal = jBULLSOCRSCILIEGE,
volume = "41",
pages = "179182",
year = "1972",
CODEN = "BSRSA6",
ISSN = "00379565",
ISSNL = "00379565",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/fibquart.bib",
acknowledgement = ackds,
fjournal = "Bulletin de la Soci{\'e}t{\'e} royale des sciences de
Li{\`e}ge",
language = "French",
rawdata = "Zeckendorf, E. (1972) ``Repr\'esentation des Nombres
Naturels par Une Somme de Nombres de Fibonacci ou de
Nombres de Lucas,'' {\it Bull. Soc. Roy. Sci. Li\`ege},
{\bf41}:179182.",
}@
M&LrM+6o
@Article{Rubin:1976:ETF,
.]
@Article{Rossling:2009:VCA,
author = "Guido R{\"o}{\ss}ling and Florian Lindner",
title = "Visualizing compression algorithms onthefly",
journal = !S)
@Article{Ross:1994:ROD,
author = "John W. Ross",
title = "RecordOriented Data Co ل)
@Article{Ross:1992:SDC,
author = "Ed Ross",
title = "A Simple DataCompression Te'O
@Article{Rokicki:1985:PPF,
author = "Tomas Rokicki",
title = "Packed ({{\tt PK}})9
@Article{Roger:1996:LCA,
author = "R. E. Roger and M. C. Cavenor",
title = "Lossl
/
@Article{Roetling:1977:BAC,
author = "P. G. Roetling",
title = "Binary Approximat'
@Article{Roetling:1976:HME,
author = "P. G. Roetling",
title = "Halftone Method w^)S
@Article{Rodriguez:1995:GFF,
author = "Karen Rodriguez",
title = "Graphics File Fr une Somme
de Nombres de {Fibonacci} ou de Nombres de {Lucas}.
({French}) [{Representation} of the natural numbers by
a sum of {Fibonacci} or {Lucas} numbers]",
journal = jBULLSOCRSCILIEGE,
volume = "41",
pages = "179182",
year = "1972",
CODEN = "BSRSA6",
ISSN = "00379565",
ISSNL = "00379565",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/fibquart.bib",
acknowledgement = ackds,
fjournal = "Bulletin de la Soci{\'e}t{\'e} royale des sciences de
Li{\`e}ge",
language = "French",
rawdata = "Zeckendorf, E. (1972) ``Repr\'esentation des Nombres
Naturels par Une Somme de Nombres de Fibonacci ou de
Nombres de Lucas,'' {\it Bull. Soc. Roy. Sci. Li\`ege},
{\bf41}:179182.",
}
))L@X 33'977Ec;s'articledatacompression.bibZeckendorf:1972:RNNE. ZeckendorfRepresentation des Nombres naturels par une Somme de Nombres de Fibonacci ou de Nombres de Lucas. (French) [Representation of the natural numbers by a sum of Fibonacci or Lucas numbers]jBULLSOCRSCILIEGE411791821972BSRSA600379565 OR 0037956500379565 OR 00379565Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib2013.01.26 12:46:16 MSTBulletin de la Societe royale des sciences de LiegeFrenchackdsE. ZeckendorfRepr{\'e}sentation des Nombres naturels par une Somme de Nombres de {Fibonacci} ou de Nombres de {Lucas}. ({French}) [{Representation} of the natural numbers by a sum of {Fibonacci} or {Lucas} numbers]
@Article{Zeckendorf:1972:RNN,
author = "E. Zeckendorf",
title = "Repr{\'e}sentation des Nombres naturels paAsilomar Conference on Circuits,
Systems, and Computers",
title = "An Adaptive System for Data Compression",
publisher = pubIEEE,
address = pubIEEE:adr,
pages = "593597",
year = "1973",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Faller N. (1973) ``An Adaptive System for Data
Compression,'' {\it Record of the 7th Asilomar
Conference on Circuits, Systems, and Computers}, pp.
593597.",
}Astem for Data CompressionpubIEEEpubIEEE:adr5935971973Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsN. FallerRecord of the 7th Asilomar Conference on Circuits, Systems, and ComputersAn Adaptive System for Data Compression
@InProceedings{Faller:1973:ASD,
author = "N. Faller",
booktitle = "Record of the 7th Asilomar Conference on Circuits,
Systems, and Computers",
title = "An Adaptive System for Data Compression",
publisher = pubIEEE,
address = pubIEEE:adr,
pages = "593597",
year = "1973",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Faller N. (1973) ``An Adaptive System for Data
Compression,'' {\it Record of the 7th Asilomar
Conference on Circuits, Systems, and Computers}, pp.
593597.",
}
RRGCV 3)U#77E%;e3!9Ygarticledatacompression.bibGrimm:1973:ALPRichard E. GrimmThe Autobiography of Leonardo PisanojFIBQUART11199104feb21973FIBQAU00150517 OR 0015051700150517 OR 00150517Sat Jan 26 12:46:16 MST 2013http://www.fq.math.ca/111.html; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib2013.01.26 12:46:16 MSThttp://www.fq.math.ca/Scanned/111/grimm.pdfFibonacci QuarterlyackdsFib. Quarthttp://www.fq.math.ca/Richard E. GrimmThe Autobiography of {Lݐ/BZ 3K_57=E;=!5OKAWarticledataccAW '3+[%E};[?inproceedingsdatacompression.bibFaller:1973:ASDN. FallerRecord of the 7th Asilomar Conference on Circuits, Systems, and ComputersAn Adaptive Syndence: On {``File Compression Using Variable
Length Encodings''}",
journal = jCOMPJ,
volume = "16",
number = "3",
pages = "287287",
month = aug,
year = "1973",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/16.3.287",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Sat Oct 07 17:13:59 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/",
note = "See \cite{Wells:1972:FCU}.",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/287.tif",
acknowledgement = acknhfb,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
}Bompression.bibGibbons:1973:CFCCharles J. Gibbons and M. WellsCorrespondence: On ``File Compression Using Variable Length Encodings''jCOMPJ163287287aug81973CMPJA6http://dx.doi.org/10.1093/comjnl/16.3.28700104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Sat Oct 07 17:13:59 2000http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/2000.10.07 17:13:59 ???See cite Wells:1972:FCU.http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/287.tifThe Computer Journalacknhfbhttp://comjnl.oxfordjournals.org/Charles J. Gibbons and M. WellsSee \cite{Wells:1972:FCU}.Correspondence: On {``File Compression Using Variable Length Encodings''}
@Article{Gibbons:1973:CFC,
author = "Charles J. Gibbons and M. Wells",
title = "Correspondence: On {``File Compression Using Variable
Length Encodings''}",
journal = jCOMPJ,
volume = "16",
number = "3",
pages = "287287",
month = aug,
year = "1973",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/16.3.287",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Sat Oct 07 17:13:59 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/",
note = "See \cite{Wells:1972:FCU}.",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/287.tif",
acknowledgement = acknhfb,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
}of {Leonardo Pisano}",
journal = jFIBQUART,
volume = "11",
number = "1",
pages = "99104",
month = feb,
year = "1973",
CODEN = "FIBQAU",
ISSN = "00150517",
ISSNL = "00150517",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.fq.math.ca/111.html;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/fibquart.bib",
URL = "http://www.fq.math.ca/Scanned/111/grimm.pdf",
acknowledgement = ackds # " and " # acknhfb,
ajournal = "Fib. Quart",
fjournal = "Fibonacci Quarterly",
journalURL = "http://www.fq.math.ca/",
rawdata = "Grimm, R. E. (1973) ``The Autobiography of Leonardo
Pisano,'' {\it Fibonacci Quarterly},
{\bf11}(1):99104, February.",
}C
&Lr+X1
@Article{Dion:1993:CPC,
author = "Pierre J. Dion",
title = "CrossPlatfohQ
@Article{Deligiannis:2014:PRW,
author = "Nikos Deligiannis and Frederik Verbist and J{\"u}rgen
&FeK
@Article{Deng:2012:VIA,
author = "Aidong Deng and Jianeng Tang and Li Zhao and Cairong
$Zsg
@Article{Deorowicz:2002:SSA,
author = "Sebastian Deorowicz",
title = "Second step7
@Article{Diamantini:2001:EDC,
author = "Claudia Diamantini and Maurizio Panti",
title = )S
@Article{Deorowicz:2000:IBW,
author = "Sebastian Deorowicz",
title = "Improvement
@Article{Dhem:1997:LCA,
author = "J. F. Dhem and J. J. Quisquater",
title = "Loss5k
@Article{Demko:1985:CFO,
author = "Stephen Demko and Laurie Hodges and Bruce Naylor",
tiӇ%K
@Article{Deng:2012:OAC,
author = "Xi Deng and Yuanyuan Yang",
title = "Online Ada$WL$%.L5&;
@Article{Anonymous:1991:DDC,
author = "Anonymous",
title = "The {DDJ} Data Compreq#
@Article{Anonymous:2000:BRPa,
author = "Anonymous",
title = "Book Reviews: {PNG: HF6m
@Article{Anedda:1988:CQI,
author = "C. Anedda and L. Felician",
title = "{$P$}Co%
@Article{Baran:2000:NVNb,
&
@Article{Bakulina:2007:AZL,
author = "M. P. Bakulina",
title = "Application of {ZCB[7
@Article{B:1999:DIF,
author = "Praveen B. and Deepak Gupta and Rajat Moona",
title = "Design and implementation of a file system with
onthefly data compression for {GNU/Linux}",
jo$H
@Article{Aleh:1981:DUB,
author = "Avner Aleh and K. Dan Levin",
title = "The dete##G
@Article{Ahlswede:1997:UCI,
author = "Rudolf Ahlswede and Te Sun Han and Kingo Kobayashi",N0lN_
@Article{Brisaboa:2010:DLT,
_hQ
@Article{Breinholt:1998:AGH,
author = "Greg Breinholt and Christoph Schierz",
title = ^B
@Article{Bianchi:1989:DCH,
author = "Mark J. Bianchi and Jeffery J. Kato and David J. {Vant l3
@Article{Burroughs:1998:DCT,
author = "S. H. Burroughs and T. R. Lattrell",
title = q3g
@Article{Benini:2002:ODP,
author = "Luca Benini and Alberto Macii and Enrico Macii",
titǚ
@Article{Bell:1994:RBG,
author = "Timothy C. Bell and Ian H. Witten",
title = "Th `0a
@Article{Bekesi:1996:FGA,
author = "J. B{\'e}k{\'e}si and G. Galambos and U. Pferschy and
a<:u
@Article{Bookstein:1990:CIT,
author = "Abraham Bookstein and Shmuel T. Klein",
title = "Compression, Information Theory, and Grammars: a
Unified Approach",
jeonardo Pisano}
@Article{Grimm:1973:ALP,
author = "Richard E. Grimm",
title = "The Autobiography of {Leonardo Pisano}",
journal = jFIBQUART,
volume = "11",
number = "1",
pages = "99104",
month = feb,
year = "1973",
CODEN = "FIBQAU",
ISSN = "00150517",
ISSNL = "00150517",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.fq.math.ca/111.html;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/fibquart.bib",
URL = "http://www.fq.math.ca/Scanned/111/grimm.pdf",
acknowledgement = ackds # " and " # acknhfb,
ajournal = "Fib. Quart",
fjournal = "Fibonacci Quarterly",
journalURL = "http://www.fq.math.ca/",
rawdata = "Grimm, R. E. (1973) ``The Autobiography of Leonardo
Pisano,'' {\it Fibonacci Quarterly},
{\bf11}(1):99104, February.",
}pression In Recursive Estimation with
Applications to Navigation Systems",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "149",
year = "1973",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302696388",
acknowledgement = acknhfb,
classification = "0538: Aerospace materials",
dissertationthesisnumber = "7406491",
subject = "Aerospace materials",
}Drch.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/302696388Aerospace materialsacknhfbAnil Narayan JoglekarData Compression In Recursive Estimation with Applications to Navigation Systems
@PhdThesis{Joglekar:1973:DCR,
author = "Anil Narayan Joglekar",
title = "Data Compression In Recursive Estimation with
Applications to Navigation Systems",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "149",
year = "1973",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302696388",
acknowledgement = acknhfb,
classification = "0538: Aerospace materials",
dissertationthesisnumber = "7406491",
subject = "Aerospace materials",
}
P%FV 3'1k%7C7;e#1kYphdthesisdatacompression.bibPore:1973:FADMichael David PoreFactor Analysis as a DatXEX 3)+!CQE;+Wbookdatacompression.bibKnuth:1973:ACPDonald E. KnuthThe Art of Computer Programming, Volume 1, Fundamental AlgorithmspubAWpubAW:adrSecondxxi + 63419730201038218 OR 02010382189780201038217 OR 9780201038217Sat Jan 26 12:46:16 MST 2013http://www.math.uBDX 3/7%3/C7;e37iphdthesisdatacompression.bibJoglekar:1973:DCRAnil Narayan JoglekarData Compression In Recursive Estimation with Applications to Navigation SystemsPh.D. thesisStanford UniversityStanford, CA, USA1491973Fri Feb 1 09:20:36 MST 2013http://seaogramming, Volume 1, Fundamental
Algorithms",
publisher = pubAW,
address = pubAW:adr,
edition = "Second",
pages = "xxi + 634",
year = "1973\noopsort{a}",
ISBN = "0201038218",
ISBN13 = "9780201038217",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds # " and " # acknhfb,
rawdata = "Knuth, Donald E. (1973) {\it The Art of Computer
Programming}, Vol. 1, 2nd Ed., Reading, MA,
AddisonWesley.",
}Etah.edu/pub/bibnet/subjects/accstabnumalg.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsDonald E. KnuthThe Art of Computer Programming, Volume 1, Fundamental Algorithms
@Book{Knuth:1973:ACP,
author = "Donald E. Knuth",
title = "The Art of Computer Programming, Volume 1, Fundamental
Algorithms",
publisher = pubAW,
address = pubAW:adr,
edition = "Second",
pages = "xxi + 634",
year = "1973\noopsort{a}",
ISBN = "0201038218",
ISBN13 = "9780201038217",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds # " and " # acknhfb,
rawdata = "Knuth, Donald E. (1973) {\it The Art of Computer
Programming}, Vol. 1, 2nd Ed., Reading, MA,
AddisonWesley.",
} as a Data Compression Technique",
type = "{Ph.D.} thesis",
school = "Texas Tech University",
address = "Lubbock, TX, USA",
pages = "381",
year = "1973",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302771096",
acknowledgement = acknhfb,
classification = "0405: Mathematics",
dissertationthesisnumber = "7405821",
subject = "Mathematics",
}Fa Compression TechniquePh.D. thesisTexas Tech UniversityLubbock, TX, USA3811973Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302771096MathematicsacknhfbMichael David PoreFactor Analysis as a Data Compression Technique
@PhdThesis{Pore:1973:FAD,
author = "Michael David Pore",
title = "Factor Analysis as a Data Compression Technique",
type = "{Ph.D.} thesis",
school = "Texas Tech University",
address = "Lubbock, TX, USA",
pages = "381",
year = "1973",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302771096",
acknowledgement = acknhfb,
classification = "0405: Mathematics",
dissertationthesisnumber = "7405821",
subject = "Mathematics",
}e Structure of Television Pictures as
Applied to Practical Data Compression Techniques",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "106",
year = "1973",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302674792",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7314996",
subject = "Electrical engineering",
}Gdu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302674792Electrical engineeringacknhfbRobert Tien Pei WangA Study of the Structure of Television Pictures as Applied to Practical Data Compression Techniques
@PhdThesis{Wang:1973:SST,
author = "Robert Tien Pei Wang",
title = "A Study of the Structure of Television Pictures as
Applied to Practical Data Compression Techniques",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "106",
year = "1973",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302674792",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7314996",
subject = "Electrical engineering",
}
ttyHY3)[=3_57E3;WI[[Aarticledatacompression.bibAhmed:1974:DCTN. Ahmed and T. Natarajan and K. R. RaoDiscrete Cosine TransfomjIEEETRANSCOMPUTC2319093jan11974ITCOB4http://dx.doi.org/1yGX 3'5S%3/C7;e95Sphdthesisdatacompression.bibWang:1973:SSTRobert Tien Pei WangA Study of the Structure of Television Pictures as Applied to Practical Data Compression TechniquesPh.D. thesisStanford UniversityStanford, CA, USA1061973Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.e "{Discrete Cosine Transfom}",
journal = jIEEETRANSCOMPUT,
volume = "C23",
number = "1",
pages = "9093",
month = jan,
year = "1974",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1974.223784",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib",
note = "See comments \cite{Shanmugam:1975:CDC}.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672377",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
rawdata1 = "Ahmed, N., T. Natarajan, and R. K. Rao (1974)
``Discrete Cosine Transform,'' {\it IEEE Transactions
on Computers}, {\bf C23}:9093.",
rawdata2 = "Ahmed, N., T. Natarajan, and R. K. Rao (1974)
``Discrete Cosine Transform,'' {\it IEEE Transactions
on Computers} C23:9093.",
}H0.1109/TC.1974.22378400189340 (print), 15579956 (electronic) OR 00189340 (print), 15579956 (electronic)00189340 OR 00189340Sat Jan 26 12:46:16 MST 2013http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib2013.01.26 12:46:16 MSTSee comments cite Shanmugam:1975:CDC.http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672377IEEE Transactions on Computersackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12N. Ahmed and T. Natarajan and K. R. RaoSee comments \cite{Shanmugam:1975:CDC}.{Discrete Cosine Transfom}
@Article{Ahmed:1974:DCT,
author = "N. Ahmed and T. Natarajan and K. R. Rao",
title = "{Discrete Cosine Transfom}",
journal = jIEEETRANSCOMPUT,
volume = "C23",
number = "1",
pages = "9093",
month = jan,
year = "1974",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1974.223784",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib",
note = "See comments \cite{Shanmugam:1975:CDC}.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672377",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
rawdata1 = "Ahmed, N., T. Natarajan, and R. K. Rao (1974)
``Discrete Cosine Transform,'' {\it IEEE Transactions
on Computers}, {\bf C23}:9093.",
rawdata2 = "Ahmed, N., T. Natarajan, and R. K. Rao (1974)
``Discrete Cosine Transform,'' {\it IEEE Transactions
on Computers} C23:9093.",
}ta compression by predictive coding. {II}.
Encoding algorithms",
journal = jIBMJRD,
volume = "18",
number = "2",
pages = "172179",
month = mar,
year = "1974",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "Predictive coding techniques for efficient
transmission or storage of twolevel (black and white)
digital images are examined. Algorithms for prediction
are discussed as well as coding techniques for encoding
the prediction error pattern. First, the authors survey
some schemes for encoding if the error pattern is
assumed to be memoryless. Then a method is developed
for encoding certain runlength distributions. Finally,
some experimental results for sample documents are
presented.",
acknowledgement = acknhfb,
classcodes = "B6120B (Codes); B6140 (Signal processing and
detection); C1260 (Information theory); C7410F
(Communications computing)",
classification = "723; 731",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "algorithms; applications of computers; codes,
symbolic; communication; communications applications of
computers; data compression; digital signals; encoding;
image data compression; information theory 
Filtering and Prediction Theory; predictive coding; two
level digital images; video signals",
treatment = "P Practical; X Experimental",
}Ib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib1997.03.25 14:26:59 MSTPredictive coding techniques for efficient transmission or storage of twolevel (black and white) digital images are examined. Algorithms for prediction are discussed as well as coding techniques for encoding the prediction error pattern. First, the authors survey some schemes for encoding if the error pattern is assumed to be memoryless. Then a method is developed for encoding certain runlength distributions. Finally, some experimental results for sample documents are presented.IBM Journal of Research and Developmentalgorithms; applications of computers; codes, symbolic; communication; communications applications of computers; data compression; digital signals; encoding; image data compression; information theory  Filtering and Prediction Theory; predictive coding; two level digital images; video signalsacknhfbB6120B (Codes); B6140 (Signal processing and detection); C1260 (Information theory); C7410F (Communications computing)IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USAhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520IBM J Res DevP Practical; X ExperimentalPredictive coding techniques for efficient transmission or storage of twolevel (black and white) digital images are examined. Algorithms for prediction are discussed as well as coding techniques for encoding the prediction error pattern. First, the authors survey some schemes for encoding if the error pattern is assumed to be memoryless. Then a method is developed for encoding certain runlength distributions. Finally, some experimental results for sample documents are presented.L. R. Bahl and H. KobayashiImage data compression by predictive coding. {II}. Encoding algorithms
@Article{Bahl:1974:IDC,
author = "L. R. Bahl and H. Kobayashi",
title = "Image data compression by predictive coding. {II}.
Encoding algorithms",
journal = jIBMJRD,
volume = "18",
number = "2",
pages = "172179",
month = mar,
year = "1974",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "Predictive coding techniques for efficient
transmission or storage of twolevel (black and white)
digital images are examined. Algorithms for prediction
are discussed as well as coding techniques for encoding
the prediction error pattern. First, the authors survey
some schemes for encoding if the error pattern is
assumed to be memoryless. Then a method is developed
for encoding certain runlength distributions. Finally,
some experimental results for sample documents are
presented.",
acknowledgement = acknhfb,
classcodes = "B6120B (Codes); B6140 (Signal processing and
detection); C1260 (Information theory); C7410F
(Communications computing)",
classification = "723; 731",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "algorithms; applications of computers; codes,
symbolic; communication; communications applications of
computers; data compression; digital signals; encoding;
image data compression; information theory 
Filtering and Prediction Theory; predictive coding; two
level digital images; video signals",
treatment = "P Practical; X Experimental",
}
4$JX 3'5%CC7;e5Qphdthesisdatacompression.bibFelt:1974:DCTDouglas Charles FeltDataCompression Techniques Using Adaptive TranslationPermutation CodesPh.D. thesisWashington State UniversityPullman, WA, USA1131974Fri Feb 1 09:5I_3'C57E;W[]y'CWCarticledatacompression.bibBahl:1974:IDCL. R. Bahl and H. KobayashiImage data compression by predictive coding. II. Encoding algorithmsjIBMJRD182172179mar31974IBMJAE00188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 00188646Tue Mar 25 14:26:59 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/biion Techniques Using Adaptive
TranslationPermutation Codes",
type = "{Ph.D.} thesis",
school = "Washington State University",
address = "Pullman, WA, USA",
pages = "113",
year = "1974",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302713192",
acknowledgement = acknhfb,
classification = "0984: Computer science",
dissertationthesisnumber = "7416362",
subject = "Computer science",
}J20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/302713192Computer scienceacknhfbDouglas Charles FeltDataCompression Techniques Using Adaptive TranslationPermutation Codes
@PhdThesis{Felt:1974:DCT,
author = "Douglas Charles Felt",
title = "DataCompression Techniques Using Adaptive
TranslationPermutation Codes",
type = "{Ph.D.} thesis",
school = "Washington State University",
address = "Pullman, WA, USA",
pages = "113",
year = "1974",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302713192",
acknowledgement = acknhfb,
classification = "0984: Computer science",
dissertationthesisnumber = "7416362",
subject = "Computer science",
}ession and Storage of Data",
journal = jCACM,
volume = "17",
number = "8",
pages = "434436",
month = aug,
year = "1974",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Mon Jan 22 06:47:50 MST 2001",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://dblp.unitrier.de/db/journals/cacm/cacm17.html#Hahn74;
http://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "This paper describes techniques that can, in most
cases, decrease storage size by a factor of from two to
four. The techniques involve special handling of
leading and trailing blanks, and the encoding of other
symbols in groups of fixed size as unique fixed point
numbers. The efficiency of the system is considered and
pertinent statistics are given and compared with
statistics for other information coding techniques.",
acknowledgement = acknhfb,
annote = "Generation of a character dictionary and its use to
minimize space.",
classcodes = "C6120 (File organisation); C6130 (Data handling
techniques)",
classification = "731",
corpsource = "Univ. Waterloo, Ont., Canada",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
journalabr = "Commun ACM",
keywords = "coding techniques; compression; data handling; data
management; data storage; efficiency; encoding; file
maintenance; file organisation; fixed point numbers;
information coding techniques; information theory;
programs; text compression; utility",
oldlabel = "Hahn74",
treatment = "A Application; P Practical",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hahn74",
}K0010782 (print), 15577317 (electronic)00010782 OR 00010782Mon Jan 22 06:47:50 MST 2001Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://dblp.unitrier.de/db/journals/cacm/cacm17.html#Hahn74; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2001.01.22 06:47:50 MSTThis paper describes techniques that can, in most cases, decrease storage size by a factor of from two to four. The techniques involve special handling of leading and trailing blanks, and the encoding of other symbols in groups of fixed size as unique fixed point numbers. The efficiency of the system is considered and pertinent statistics are given and compared with statistics for other information coding techniques.Communications of the ACMcoding techniques; compression; data handling; data management; data storage; efficiency; encoding; file maintenance; file organisation; fixed point numbers; information coding techniques; information theory; programs; text compression; utilityacknhfbGeneration of a character dictionary and its use to minimize space.C6120 (File organisation); C6130 (Data handling techniques)Univ. Waterloo, Ont., Canadahttp://portal.acm.org/browse_dl.cfm?idx=J79Commun ACMA Application; P PracticalThis paper describes techniques that can, in most cases, decrease storage size by a factor of from two to four. The techniques involve special handling of leading and trailing blanks, and the encoding of other symbols in groups of fixed size as unique fixed point numbers. The efficiency of the system is considered and pertinent statistics are given and compared with statistics for other information coding techniques.Bruce HahnA New Technique for Compression and Storage of Data
@Article{Hahn:1974:NTC,
author = "Bruce Hahn",
title = "A New Technique for Compression and Storage of Data",
journal = jCACM,
volume = "17",
number = "8",
pages = "434436",
month = aug,
year = "1974",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Mon Jan 22 06:47:50 MST 2001",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://dblp.unitrier.de/db/journals/cacm/cacm17.html#Hahn74;
http://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "This paper describes techniques that can, in most
cases, decrease storage size by a factor of from two to
four. The techniques involve special handling of
leading and trailing blanks, and the encoding of other
symbols in groups of fixed size as unique fixed point
numbers. The efficiency of the system is considered and
pertinent statistics are given and compared with
statistics for other information coding techniques.",
acknowledgement = acknhfb,
annote = "Generation of a character dictionary and its use to
minimize space.",
classcodes = "C6120 (File organisation); C6130 (Data handling
techniques)",
classification = "731",
corpsource = "Univ. Waterloo, Ont., Canada",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
journalabr = "Commun ACM",
keywords = "coding techniques; compression; data handling; data
management; data storage; efficiency; encoding; file
maintenance; file organisation; fixed point numbers;
information coding techniques; information theory;
programs; text compression; utility",
oldlabel = "Hahn74",
treatment = "A Application; P Practical",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hahn74",
}
QQL[3+So57E
;o?EWc!#oWo%articledatacompression.bibJordan:1974:CORB. W. Jordan, Jr. and R. C. BarrettA Cell Organized Raster Display for Line DrawingsjCACM1727077feb21974CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Sat Jan 26 12:46:16 MST 2013Compendex database; htt~K\ 3'!s57E;U?uEc!AU!sarticledatacompression.bibHahn:1974:NTCBruce HahnA New Technique for Compression and Storage of DatajCACM178434436aug81974CACMA200010782 (print), 15577317 (electronic) OR 0 "A Cell Organized Raster Display for Line Drawings",
journal = jCACM,
volume = "17",
number = "2",
pages = "7077",
month = feb,
year = "1974",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
http://dblp.unitrier.de/db/journals/cacm/cacm17.html#JordanB74;
http://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Raster scan computer graphics displays with ``real
time'' character generators have previously been
limited to alphanumeric characters. A display is
described which extends the capabilities of this
organization to include general graphics. The
feasibility of such a display is shown by deriving the
minimum number of patterns required in the read only
memory of the character generator to synthesize an
arbitrary line. The synthesis process does not
compromise picture quality, since the resulting dot
patterns are identical with those of a conventional
raster display. The time constraints of a raster
display are shown to be satisfied for a typical design
for very complex line drawings.",
acknowledgement = ackds # " and " # acknhfb,
classcodes = "C5540 (Terminals and graphic displays); C6130 (Data
handling techniques)",
classification = "722",
corpsource = "Northwestern Univ., Evanston, IL, USA",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
journalabr = "Commun ACM",
keywords = "arbitrary line; cell organized raster display; complex
line drawings; computer; computer graphic equipment;
computer graphics; computer peripheral equipment;
discrete; dot; dot generation; graphics displays;
image; line drawing; line drawings; matrix displays;
minimum; number of patterns; patterns; read only
memory; real time character generators",
oldlabel = "JordanB74",
rawdata = "Jordan, B. W., and R. C. Barrett (1974) ``A Cell
Organized Raster Display for Line Drawings,'' {\it
Communications of the ACM}, {\bf17}(2):7077.",
treatment = "P Practical",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/JordanB74",
}Lp://dblp.unitrier.de/db/journals/cacm/cacm17.html#JordanB74; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTRaster scan computer graphics displays with ``real time'' character generators have previously been limited to alphanumeric characters. A display is described which extends the capabilities of this organization to include general graphics. The feasibility of such a display is shown by deriving the minimum number of patterns required in the read only memory of the character generator to synthesize an arbitrary line. The synthesis process does not compromise picture quality, since the resulting dot patterns are identical with those of a conventional raster display. The time constraints of a raster display are shown to be satisfied for a typical design for very complex line drawings.Communications of the ACMarbitrary line; cell organized raster display; complex line drawings; computer; computer graphic equipment; computer graphics; computer peripheral equipment; discrete; dot; dot generation; graphics displays; image; line drawing; line drawings; matrix displays; minimum; number of patterns; patterns; read only memory; real time character generatorsackdsC5540 (Terminals and graphic displays); C6130 (Data handling techniques)Northwestern Univ., Evanston, IL, USAhttp://portal.acm.org/browse_dl.cfm?idx=J79Commun ACMP PracticalRaster scan computer graphics displays with ``real time'' character generators have previously been limited to alphanumeric characters. A display is described which extends the capabilities of this organization to include general graphics. The feasibility of such a display is shown by deriving the minimum number of patterns required in the read only memory of the character generator to synthesize an arbitrary line. The synthesis process does not compromise picture quality, since the resulting dot patterns are identical with those of a conventional raster display. The time constraints of a raster display are shown to be satisfied for a typical design for very complex line drawings.B. W. {Jordan, Jr.} and R. C. BarrettA Cell Organized Raster Display for Line Drawings
@Article{Jordan:1974:COR,
author = "B. W. {Jordan, Jr.} and R. C. Barrett",
title = "A Cell Organized Raster Display for Line Drawings",
journal = jCACM,
volume = "17",
number = "2",
pages = "7077",
month = feb,
year = "1974",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
http://dblp.unitrier.de/db/journals/cacm/cacm17.html#JordanB74;
http://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Raster scan computer graphics displays with ``real
time'' character generators have previously been
limited to alphanumeric characters. A display is
described which extends the capabilities of this
organization to include general graphics. The
feasibility of such a display is shown by deriving the
minimum number of patterns required in the read only
memory of the character generator to synthesize an
arbitrary line. The synthesis process does not
compromise picture quality, since the resulting dot
patterns are identical with those of a conventional
raster display. The time constraints of a raster
display are shown to be satisfied for a typical design
for very complex line drawings.",
acknowledgement = ackds # " and " # acknhfb,
classcodes = "C5540 (Terminals and graphic displays); C6130 (Data
handling techniques)",
classification = "722",
corpsource = "Northwestern Univ., Evanston, IL, USA",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
journalabr = "Commun ACM",
keywords = "arbitrary line; cell organized raster display; complex
line drawings; computer; computer graphic equipment;
computer graphics; computer peripheral equipment;
discrete; dot; dot generation; graphics displays;
image; line drawing; line drawings; matrix displays;
minimum; number of patterns; patterns; read only
memory; real time character generators",
oldlabel = "JordanB74",
rawdata = "Jordan, B. W., and R. C. Barrett (1974) ``A Cell
Organized Raster Display for Line Drawings,'' {\it
Communications of the ACM}, {\bf17}(2):7077.",
treatment = "P Practical",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/JordanB74",
}ge data compression by predictive coding. {I}.
Prediction algorithms",
journal = jIBMJRD,
volume = "18",
number = "2",
pages = "164171",
month = mar,
year = "1974",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "Predictive coding techniques for efficient
transmission or storage of twolevel (black and white)
digital images are dealt with.",
acknowledgement = acknhfb,
classcodes = "B6120B (Codes); B6140 (Signal processing and
detection); C1260 (Information theory); C7410F
(Communications computing)",
classification = "723; 731",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "adaptive linear predictor; adaptive predictor with
finite; algorithms; codes, symbolic; communications
applications of computers; data compression; digital
signals; encoding; fixed predictor; image data
compression; information theory  Filtering and
Prediction Theory; memory; prediction; predictive
coding; two level digital images; video signals",
treatment = "P Practical; X Experimental",
}M e; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib1997.03.25 14:26:59 MSTPredictive coding techniques for efficient transmission or storage of twolevel (black and white) digital images are dealt with.IBM Journal of Research and Developmentadaptive linear predictor; adaptive predictor with finite; algorithms; codes, symbolic; communications applications of computers; data compression; digital signals; encoding; fixed predictor; image data compression; information theory  Filtering and Prediction Theory; memory; prediction; predictive coding; two level digital images; video signalsacknhfbB6120B (Codes); B6140 (Signal processing and detection); C1260 (Information theory); C7410F (Communications computing)IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USAhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520IBM J Res DevP Practical; X ExperimentalPredictive coding techniques for efficient transmission or storage of twolevel (bla
ck and white) digital images are dealt with.H. Kobayashi and L. R. BahlImage data compression by predictive coding. {I}. Prediction algorithms
@Article{Kobayashi:1974:IDC,
author = "H. Kobayashi and L. R. Bahl",
title = "Image data compression by predictive coding. {I}.
Prediction algorithms",
journal = jIBMJRD,
volume = "18",
number = "2",
pages = "164171",
month = mar,
year = "1974",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "Predictive coding techniques for efficient
transmission or storage of twolevel (black and white)
digital images are dealt with.",
acknowledgement = acknhfb,
classcodes = "B6120B (Codes); B6140 (Signal processing and
detection); C1260 (Information theory); C7410F
(Communications computing)",
classification = "723; 731",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "adaptive linear predictor; adaptive predictor with
finite; algorithms; codes, symbolic; communications
applications of computers; data compression; digital
signals; encoding; fixed predictor; image data
compression; information theory  Filtering and
Prediction Theory; memory; prediction; predictive
coding; two level digital images; video signals",
treatment = "P Practical; X Experimental",
}
TTM_31C57E;
[Iy'C
Caarticledatacompression.bibKobayashi:1974:IDCH. Kobayashi and L. R. BahlImage data compression by predictive coding. I. Prediction algorithmsjIBMJRD182164171mar31974IBMJAE00188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 00188646Tue Mar 25 14:26:59 MST 1997Compendex databaslopment of information theory",
publisher = pubIEEE,
address = pubIEEE:adr,
pages = "vi + 463",
year = "1974",
ISBN = "0879420278, 0879420286 (paperback)",
ISBN13 = "9780879420277, 9780879420284 (paperback)",
LCCN = "Q360 .S54",
bibdate = "Sat Nov 20 11:29:48 MST 2010",
bibsource = "catalog.princeton.edu:7090/voyager;
http://www.math.utah.edu/pub/bibnet/authors/s/shannonclaudeelwood.bib;
http://www.math.utah.edu/pub/bibnet/authors/t/tukeyjohnw.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "IEEE Press selected reprint series",
acknowledgement = acknhfb,
subject = "Information theory",
}N11.20 11:29:48 MSTIEEE Press selected reprint seriesInformation theoryacknhfbDavid SlepianKey papers in the development of information theory
@Book{Slepian:1974:KPD,
editor = "David Slepian",
title = "Key papers in the development of information theory",
publisher = pubIEEE,
address = pubIEEE:adr,
pages = "vi + 463",
year = "1974",
ISBN = "0879420278, 0879420286 (paperback)",
ISBN13 = "9780879420277, 9780879420284 (paperback)",
LCCN = "Q360 .S54",
bibdate = "Sat Nov 20 11:29:48 MST 2010",
bibsource = "catalog.princeton.edu:7090/voyager;
http://www.math.utah.edu/pub/bibnet/authors/s/shannonclaudeelwood.bib;
http://www.math.utah.edu/pub/bibnet/authors/t/tukeyjohnw.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "IEEE Press selected reprint series",
acknowledgement = acknhfb,
subject = "Information theory",
}
__NX 3's%)EEW;Q1'sibookdatacompression.bibSlepian:1974:KPDDavid SlepianKey papers in the development of information theorypubIEEEpubIEEE:adrvi + 46319740879420278, 0879420286 (paperback) OR 0879420278, 0879420286 (paperback)9780879420277, 9780879420284 (paperback) OR 9780879420277, 9780879420284 (paperback)Q360 .S54Sat Nov 20 11:29:48 MST 2010catalog.princeton.edu:7090/voyager; http://www.math.utah.edu/pub/bibnet/authors/s/shannonclaudeelwood.bib; http://www.math.utah.edu/pub/bibnet/authors/t/tukeyjohnw.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2010.
d Representations of the
Integers",
journal = jIEEETRANSINFTHEORY,
volume = "IT21",
number = "2",
pages = "194203",
month = mar,
year = "1975",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata1 = "Elias, P. (1975) ``Universal Codeword Sets and
Representations of the Integers,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT21}(2):194203, March.",
rawdata2 = "Elias, P. (1975) ``Universal Codeword Sets and
Representations of the Integers,'' {\it IEEE
Transactions on Information Theory},
{\bf21}(2):194203, March.",
}OSets and Representations of the
Integers",
journal = jIEEETRANSINFTHEORY,
volume = "IT21",
number = "2",
pages = "194203",
month = mar,
year = "1975",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata1 = "Elias, P. (1975) ``Universal Codeword Sets and
Representations of the Integers,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT21}(2):194203, March.",
rawdata2 = "Elias, P. (1975) ``Universal Codeword Sets and
Representations of the Integers,'' {\it IEEE
Transactions on Information Theory},
{\bf21}(2):194203, March.",
}
bbOX 3);57E};[=
articledatacompression.bibElias:1975:UCSP. EliasUniversal Codeword Sets and Representations of the IntegersjIEEETRANSINFTHEORYIT212194203mar31975IETTAW00189448 (print), 15579654 (electronic) OR 00189448 (print), 15579654 (electronic)00189448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information TheoryackdsP. EliasUniversal Codeword Sets and Representations of the Integers
@Article{Elias:1975:UCS,
author = "P. Elias",
title = "Universal Codeword e = "Optimal Source Codes for Geometrically Distributed
Integer Alphabets",
journal = jIEEETRANSINFTHEORY,
volume = "IT21",
number = "3",
pages = "228230",
month = mar,
year = "1975",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Gallager, Robert G., and David C. van Voorhis (1975)
``Optimal Source Codes for Geometrically Distributed
Integer Alphabets,'' {\it IEEE Transactions on
Information Theory}, {\bf IT21}(3):228230, March.",
}P
+rL+&_?
@Article{Laney:2014:AED,
author = "Daniel Laney and Steven Langer and Christopher Weber
&_;
@Article{Langdon:1981:CBW,
author = "Glen G. Langdon and ~and J. Rissanen",
title = ?
@Article{Lam:1996:ESC,
author = "WaiMan Lam and Sanjeev R. Kulkarni",
title = "E
D1
@Article{Lakovic:2002:DEC,
author = "Ksenija Lakovi{\'c} and John Villasenor",
title = e
@Article{Larmore:1995:CHT,
author = "Lawrence L. Larmore and Teresa M. Przytycka",
titlet
@Article{Lakovic:2003:ACE,
author = "Ksenija Lakovi{\'c} and John Villasenor",
title = ,Y
@Article{Lamparter:1994:ECC,
author = "B. Lamparter and W. Effelsberg",
title = " ;
@Article{Langdon:1983:NZL,
author = "Glen G. Langdon",
title = "A Note on the {Ziq
@Article{Langdon:1983:ARL,
author = "Glenn G. Langdon",
title = "An Adaptive Run n Geometrically Distributed Integer Alphabets
@Article{Gallager:1975:OSC,
author = "Robert G. Gallager and David C. van Voorhis",
title = "Optimal Source Codes for Geometrically Distributed
Integer Alphabets",
journal = jIEEETRANSINFTHEORY,
volume = "IT21",
number = "3",
pages = "228230",
month = mar,
year = "1975",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Gallager, Robert G., and David C. van Voorhis (1975)
``Optimal Source Codes for Geometrically Distributed
Integer Alphabets,'' {\it IEEE Transactions on
Information Theory}, {\bf IT21}(3):228230, March.",
}
gPX3/c;57E};[carticledatacompression.bibGallager:1975:OSCRobert G. Gallager and David C. van VoorhisOptimal Source Codes for Geometrically Distributed Integer AlphabetsjIEEETRANSINFTHEORYIT213228230mar31975IETTAW00189448 (print), 15579654 (electronic) OR 00189448 (print), 15579654 (electronic)00189448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information TheoryackdsRobert G. Gallager and David C. van VoorhisOptimal Source Codes forceedings of the National Computer Conference, May
1922, 1975, Anaheim, California.",
title = "A Classification of Compression Methods and their
Usefulness for a Large Data Processing Center",
volume = "44",
publisher = pubAFIPS,
address = pubAFIPS:adr,
pages = "453458",
year = "1975",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Gottlieb, D., et al. (1975) {\it A Classification of
Compression Methods and their Usefulness for a Large
Data Processing Center}, Proceedings of National
Computer Conference, {\bf44}:453458.",
}Q22, 1975, Anaheim, California.A Classification of Compression Methods and their Usefulness for a Large Data Processing Center
@InProceedings{Gottlieb:1975:CCM,
author = "D. Gottlieb and others",
booktitle = "Proceedings of the National Computer Conference, May
1922, 1975, Anaheim, California.",
title = "A Classification of Compression Methods and their
Usefulness for a Large Data Processing Center",
volume = "44",
publisher = pubAFIPS,
address = pubAFIPS:adr,
pages = "453458",
year = "1975",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Gottlieb, D., et al. (1975) {\it A Classification of
Compression Methods and their Usefulness for a Large
Data Processing Center}, Proceedings of National
Computer Conference, {\bf44}:453458.",
}
RRS\3'?Y57E;[k=A'G?YiarticledatRV 35g%O5C7;e95q7phdthesisdatacompression.bibHilbert:1975:JCSEdward Erwin HilbertA Joint Clustering / Data Compression ConceptPh.D. thesisUniversity of Southern CaliforniaLos Ange6QY'3/9;K'E};9;Kinproceedingsdatacompression.bibGottlieb:1975:CCMD. Gottlieb and othersProceedings of the National Computer Conference, May 1922, 1975, Anaheim, California.A Classification of Compression Methods and their Usefulness for a Large Data Processing Center44pubAFIPSpubAFIPS:adr4534581975Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsD. Gottlieb and othersProceedings of the National Computer Conference, May 19ustering \slash Data Compression Concept",
type = "{Ph.D.} thesis",
school = "University of Southern California",
address = "Los Angeles, CA, USA",
pages = "????",
year = "1975",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302793284",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "0510317",
subject = "Electrical engineering",
}Rles, CA, USA1975Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/302793284Electrical engineeringacknhfbEdward Erwin HilbertA Joint Clustering \slash Data Compression Concept
@PhdThesis{Hilbert:1975:JCS,
author = "Edward Erwin Hilbert",
title = "A Joint Clustering \slash Data Compression Concept",
type = "{Ph.D.} thesis",
school = "University of Southern California",
address = "Los Angeles, CA, USA",
pages = "????",
year = "1975",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302793284",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "0510317",
subject = "Electrical engineering",
}nted Information Compression",
journal = jIBMJRD,
volume = "19",
number = "2",
pages = "141145",
month = mar,
year = "1975",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "A new scheme is presented for information compression
that does not use information statistics. Each
information block is represented by two subblocks
called the alphabet and the generator. The alphabet
contains the linearly independent elements; the
generator is computed through the linear combination of
the linearly dependent elements. The total length of
these two subblocks is generally shorter (never
greater) than the original block.",
acknowledgement = acknhfb,
classcodes = "B6110 (Information theory); C1260 (Information
theory); C6130 (Data handling techniques)",
classification = "723",
corpsource = "IBM, White Plains, NY, USA",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "binary; binary number compression; CPUs; data base;
data bases; data compression; data processing;
information block; information compression; information
statistics; information theory; information theory 
Data Compression; number reconstruction; one pass
algorithm; statistical analysis; statistics",
treatment = "T Theoretical or Mathematical",
}Stacompression.bibLing:1975:BOIH. Ling and F. P. PalermoBlockOriented Information CompressionjIBMJRD192141145mar31975IBMJAE00188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 00188646Tue Mar 25 14:26:59 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib1997.03.25 14:26:59 MSTA new scheme is presented for information compression that does not use information statistics. Each information block is represented by two subblocks called the alphabet and the generator. The alphabet contains the linearly independent elements; the generator is computed through the linear combination of the linearly dependent elements. The total length of these two subblocks is generally shorter (never greater) than the original block.IBM Journal of Research and Developmentbinary; binary number compression; CPUs; data base; data bases; data compression; data processing; information block; information compression; information statistics; information theory; information theory  Data Compression; number reconstruction; one pass algorithm; statistical analysis; statisticsacknhfbB6110 (Information theory); C1260 (Information theory); C6130 (Data handling techniques)IBM, White Plains, NY, USAhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520IBM J Res DevT Theoretical or MathematicalA new scheme is presented for information compression that does not use information statistics. Each information block is represented by two subblocks called the alphabet and the generator. The alphabet contains the linearly independent elements; the generator is computed through the linear combination of the linearly dependent elements. The total length of these two subblocks is generally shorter (never greater) than the original block.H. Ling and F. P. PalermoBlockOriented Information Compression
@Article{Ling:1975:BOI,
author = "H. Ling and F. P. Palermo",
title = "BlockOriented Informatio n Compression",
journal = jIBMJRD,
volume = "19",
number = "2",
pages = "141145",
month = mar,
year = "1975",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "A new scheme is presented for information compression
that does not use information statistics. Each
information block is represented by two subblocks
called the alphabet and the generator. The alphabet
contains the linearly independent elements; the
generator is computed through the linear combination of
the linearly dependent elements. The total length of
these two subblocks is generally shorter (never
greater) than the original block.",
acknowledgement = acknhfb,
classcodes = "B6110 (Information theory); C1260 (Information
theory); C6130 (Data handling techniques)",
classification = "723",
corpsource = "IBM, White Plains, NY, USA",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "binary; binary number compression; CPUs; data base;
data bases; data compression; data processing;
information block; information compression; information
statistics; information theory; information theory 
Data Compression; number reconstruction; one pass
algorithm; statistical analysis; statistics",
treatment = "T Theoretical or Mathematical",
}"ompression by Factorising Common
Strings",
journal = jCOMPJ,
volume = "18",
number = "2",
pages = "157160",
month = may,
year = "1975",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/18.2.157",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:47:55 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/18/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/18/2/157.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/157.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/158.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/159.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/160.tif",
acknowledgement = acknhfb,
classcodes = "C6120 (File organisation); C6130 (Data handling
techniques)",
classification = "723",
corpsource = "Dept. of Computing and Control, Imperial Coll. of Sci.
and Technol., London, UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "bases; codes, symbolic; common factors; data; data
compression; data processing; data transmission time;
economy; factorising common strings; file organisation;
information compression; recoded; security; sequences
of characters; storage space; string processing",
treatment = "P Practical",
}T$MSThttp://comjnl.oxfordjournals.org/content/18/2/157.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/157.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/158.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/159.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/160.tifThe Computer Journalbases; codes, symbolic; common factors; data; data compression; data processing; data transmission time; economy; factorising common strings; file organisation; information compression; recoded; security; sequences of characters; storage space; string processingacknhfbC6120 (File organisation); C6130 (Data handling techniques)Dept. of Computing and Control, Imperial Coll. of Sci. and Technol., London, UKhttp://comjnl.oxfordjournals.org/P PracticalA. Mayne and E. B. JamesInformation Compression by Factorising Common Strings
@Article{Mayne:1975:ICF,
author = "A. Mayne and E. B. James",
title = "Information %Compression by Factorising Common
Strings",
journal = jCOMPJ,
volume = "18",
number = "2",
pages = "157160",
month = may,
year = "1975",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/18.2.157",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:47:55 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/18/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/18/2/157.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/157.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/158.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/159.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/160.tif",
acknowledgement = acknhfb,
classcodes = "C6120 (File organisation); C6130 (Data handling
techniques)",
classification = "723",
corpsource = "Dept. of Computing and Control, Imperial Coll. of Sci.
and Technol., London, UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "bases; codes, symbolic; common factors; data; data
compression; data processing; data transmission time;
economy; factorising common strings; file organisation;
information compression; recoded; security; sequences
of characters; storage space; string processing",
treatment = "P Practical",
}
""KT[3)=w_57CS;k5+O#=wGarticledatacompression.bibMayne:1975:ICFA. Mayne and E. B. JamesInformation Compression by Factorising Common StringsjCOMPJ182157160may51975CMPJA6http://dx.doi.org/10.1093/comjnl/18.2.15700104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Tue Dec 4 14:47:55 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/18/2.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/2012.12.04 14:47:55 #Discrete Cosine Transform''}",
journal = jIEEETRANSCOMPUT,
volume = "C24",
number = "7",
pages = "759759",
month = jul,
year = "1975",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1975.224301",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Tue Jul 12 07:57:55 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib",
note = "See \cite{Ahmed:1974:DCT}.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672894",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}Urm''}
@Article{Shanmugam:1975:CDC,
author = "K. S. Shanmugam",
title = "Comments on {``Discrete Cosine Transform''}",
journal = jIEEETRANSCOMPUT,
volume = "C24",
number = "7",
pages = "759759",
month = jul,
year = "1975",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.1975.224301",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Tue Jul 12 07:57:55 MDT 2011",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib",
note = "See \cite{Ahmed:1974:DCT}.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672894",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
EUY 31+_3_57E3;=I+Ac{articledatacompression.bibShanmugam:1975:CDCK. S. ShanmugamComments on ``Discrete Cosine Transform''jIEEETRANSCOMPUTC247759759jul71975ITCOB4http://dx.doi.org/10.1109/TC.1975.22430100189340 (print), 15579956 (electronic) OR 00189340 (print), 15579956 (electronic)00189340 OR 00189340Tue Jul 12 07:57:55 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib2011.07.12 07:57:55 MDTSee cite Ahmed:1974:DCT.http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672894IEEE Transactions on Computersacknhfbhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12K. S. ShanmugamSee \cite{Ahmed:1974:DCT}.Comments on {``Discrete Cosine Transfo(+",
number = "3",
pages = "243247",
month = aug,
year = "1975",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/18.3.243",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:47:56 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/18/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/18/3/243.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/243.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/244.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/245.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/246.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/247.tif",
acknowledgement = acknhfb,
classcodes = "B6140 (Signal processing and detection); C1260
(Information theory); C7490 (Computing in other
engineering fields)",
classification = "655; 716; 717; 718",
corpsource = "Electrical Engng. Dept., Imperial Coll. of Sci. and
Technol., London, UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "aerospace applications of computers; data compression;
ESRO 1; Hadamard; information theory; on ground
compression; Run length method; satellite data;
satellites; Shannon Fano method; transformation",
treatment = "A Application; P Practical",
}V
+rL+&J
@InProceedings{Bernardini:1996:ATT,
author = "R. Bernardini and J. Kovacevic",
title = m9
@InProceedings{Bentley:1999:DCU,
author = "J. Bentley and D. McIlroy",
title = "D1
@InProceedings{Bernardini:2006:DCF,
author = "R. Bernardini and R. Rinaldo",
title = 9s
@InProceedings{Benschop:1996:MPS,
author = "L. C. Benschop",
title = "{100 Mbit pk+
@InProceedings{Bergman:2005:FDP,
author = "E. Bergman and S. T. Klein",
title = "҅
@InProceedings{Berke:1999:CAP,
author = "J. Berke",
title = "Comparison and applim!
@InProceedings{Bhaskaran:1993:OPL,
author = "V. Bhaskaran and B. K. Natarajan and K.
ӄY3
@InProceedings{Bernardini:1997:OSF,
author = "R. Bernardini and J. Kovacevic",
title = BL
@InProceedings{Berkovich:1998:REC,
author = "S. Berkovich and E. ElQawasmeh",
title = ._03/tiff/243.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/244.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/245.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/246.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/247.tifThe Computer Journalaerospace applications of computers; data compression; ESRO 1; Hadamard; information theory; on ground compression; Run length method; satellite data; satellites; Shannon Fano method; transformationacknhfbB6140 (Signal processing and detection); C1260 (Information theory); C7490 (Computing in other engineering fields)Electrical Engng. Dept., Imperial Coll. of Sci. and Technol., London, UKhttp://comjnl.oxfordjournals.org/A Application; P PracticalL. F. TurnerThe `onground' compression of satellite data
@Article{Turner:1975:GCS,
author = "L. F. Turner",
title = "The `onground' compression of satellite data",
journal = jCOMPJ,
volume = "1/8",
number = "3",
pages = "243247",
month = aug,
year = "1975",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/18.3.243",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:47:56 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/18/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/18/3/243.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/243.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/244.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/245.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/246.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/247.tif",
acknowledgement = acknhfb,
classcodes = "B6140 (Signal processing and detection); C1260
(Information theory); C7490 (Computing in other
engineering fields)",
classification = "655; 716; 717; 718",
corpsource = "Electrical Engng. Dept., Imperial Coll. of Sci. and
Technol., London, UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "aerospace applications of computers; data compression;
ESRO 1; Hadamard; information theory; on ground
compression; Run length method; satellite data;
satellites; Shannon Fano method; transformation",
treatment = "A Application; P Practical",
}
5V[ 3+%g_57CS;5qOA%gUarticledatacompression.bibTurner:1975:GCSL. F. TurnerThe `onground' compression of satellite datajCOMPJ183243247aug81975CMPJA6http://dx.doi.org/10.1093/comjnl/18.3.24300104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Tue Dec 4 14:47:56 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/18/3.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/2012.12.04 14:47:56 MSThttp://comjnl.oxfordjournals.org/content/18/3/243.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue Code Data Compression: a Rate Distortion
Theoretic Approach",
type = "{Ph.D.} thesis",
school = "University of Southern California",
address = "Los Angeles, CA, USA",
pages = "????",
year = "1976",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302800779",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "0513287",
subject = "Electrical engineering",
}Wch.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302800779Electrical engineeringacknhfbDonald Dean AchterbergBlock Code Data Compression: a Rate Distortion Theoretic Approach
@PhdThesis{Achterberg:1976:BCD,
author = "Donald Dean Achterberg",
title = "Block Code Data Compression: a Rate Distortion
Theoretic Approach",
type = "{Ph.D.} thesis",
school = "University of Southern California",
address = "Los Angeles, CA, USA",
pages = "????",
year = "1976",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302800779",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "0513287",
subject = "Electrical engineering",
}
FXY3Os57Ek;I?wGOs5articledatacompression.bibBentley:1976:AOAJ. L. Bentley and A. ChiChih YaoAn Almost Optimal Algorithm for Unbounde6EWX 339%O5C7;e99phdthesisdatacompression.bibAchterberg:1976:BCDDonald Dean AchterbergBlock Code Data Compression: a Rate Distortion Theoretic ApproachPh.D. thesisUniversity of Southern CaliforniaLos Angeles, CA, USA1976Fri Feb 1 09:20:32 MST 2013http://sear25"An Almost Optimal Algorithm for Unbounded Searching",
journal = jINFOPROCLETT,
volume = "5",
number = "3",
pages = "8287",
day = "??",
month = aug,
year = "1976",
CODEN = "IFPLAT",
ISSN = "00200190 (print), 18726119 (electronic)",
ISSNL = "00200190",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib",
acknowledgement = ackds # " and " # acknhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of North Carolina,
Chapel Hill, NC, USA",
fjournal = "Information Processing Letters",
journalURL = "http://www.sciencedirect.com/science/journal/00200190",
keywords = "algorithm; almost optimal; comparison searching;
table; table lookup; unbounded searching",
rawdata = "Bentley, J. L. and A. C. Yao (1976) ``An Almost
Optimal Algorithm for Unbounded Searching,'' {\it
Information Processing Letters}, {\bf5}(3):8287.",
treatment = "T Theoretical or Mathematical",
}X7d SearchingjINFOPROCLETT538287aug81976IFPLAT00200190 (print), 18726119 (electronic) OR 00200190 (print), 18726119 (electronic)00200190 OR 00200190Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib2013.01.26 12:46:16 MSTInformation Processing Lettersalgorithm; almost optimal; comparison searching; table; table lookup; unbounded searchingackdsDept. of Computer Sci., Univ. of North Carolina, Chapel Hill, NC, USAhttp://www.sciencedirect.com/science/journal/00200190T Theoretical or MathematicalJ. L. Bentley and A. ChiChih YaoAn Almost Optimal Algorithm for Unbounded Searching
@Article{Bentley:1976:AOA,
author = "J. L. Bentley and A. ChiChih Yao",
title = "An Almost Optimal Algorithm for Unbounded Searching",
journal = jINFOPROCLETT,
volume = "5",
number = "3",
pages = "8287",
day = "??",
month = aug,
year = "1976",
CODEN = "IFPLAT",
ISSN = "00200190 (print), 18726119 (electronic)",
ISSNL = "00200190",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib",
acknowledgement = ackds # " and " # acknhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of North Carolina,
Chapel Hill, NC, USA",
fjournal = "Information Processing Letters",
journalURL = "http://www.sciencedirect.com/science/journal/00200190",
keywords = "algorithm; almost optimal; comparison searching;
table; table lookup; unbounded searching",
rawdata = "Bentley, J. L. and A. C. Yao (1976) ``An Almost
Optimal Algorithm for Unbounded Searching,'' {\it
Information Processing Letters}, {\bf5}(3):8287.",
treatment = "T Theoretical or Mathematical",
}a Compression Algorithms for Encoding of Digital
Sources",
type = "[unknown]",
school = "Computer Communications Network Group, University of
Waterloo",
address = "Waterloo, ON, Canada",
pages = "xii + 152",
year = "1976",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "amicus.nlcbnc.ca:210/NL; http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Report E69.",
URL = "http://search.proquest.com/docview/302833917",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "NK28592",
subject = "Electrical engineering",
xxpages = "xiv [i.e., xv] + 153",
xxyear = "1977",
}Yrt E69.Data Compression Algorithms for Encoding of Digital Sources
@PhdThesis{Budihardjo:1976:DCA,
author = "Peter Setiadi Budihardjo",
title = "Data Compression Algorithms for Encoding of Digital
Sources",
type = "[unknown]",
school = "Computer Communications Network Group, University of
Waterloo",
address = "Waterloo, ON, Canada",
pages = "xii + 152",
year = "1976",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "amicus.nlcbnc.ca:210/NL; http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Report E69.",
URL = "http://search.proquest.com/docview/302833917",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "NK28592",
subject = "Electrical engineering",
xxpages = "xiv [i.e., xv] + 153",
xxyear = "1977",
}
WW4ZZ3)Cc_57CS;c5[O#Cck articledatacompression.bibDance:1976:ALDD. L. Dance and U. W. PoochAn adaptive on line data compression systemjCOMPJ193216224aug81976CMPJA6http://dx.doi.org/10.1093/comjnl/19.3.21600104620 (print), 14602067 (electronic) OR 001>SYY 33=5Ck;%e9=%phdthesisdatacompression.bibBudihardjo:1976:DCAPeter Setiadi BudihardjoData Compression Algorithms for Encoding of Digital Sources[unknown]Computer Communications Network Group, University of WaterlooWaterloo, ON, Canadaxii + 1521976Fri Feb 1 09:20:32 MST 2013amicus.nlcbnc.ca:210/NL; http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSTReport E69.http://search.proquest.com/docview/302833917Electrical engineeringacknhfbPeter Setiadi BudihardjoRepo9}
@Article{Valette:2009:HCP,
author = "S{\'e}bastien Valette and Rapha{\"e}lle Chaine and
ݑ)U
@Article{Turner:1975:GCS,
author = "L. F. Turner",
title = "The `onground' compression of satellite data",
journal = jCOMPJ,
volume = "18*fM
@Article{Uhl:1996:PAU,
author = "A. Uhl",
title = "Parallel Algorithms for Using
A
@Article{Udell:1993:FIE,
author = "Jon Udell",
title = "First Impressions: Easy D4i
@Article{Turner:1996:ELI,
author = "Martin J. Turner and Neil E. Wiseman",
title =
܈!C
@Article{Turpin:1998:CEH,
author = "Andrew Turpin and Alistair Moffat",
title = "oowse_dl.cfm?idx=J79Michael A. PechuraFile Archival Techniques Using Data Compression
@Article{Pechura:1982:FAT,
author = "Michael A. Pechura",
title = "File Archival Techniques Using Data Compression",
journal = jCACM,
volume = "25",
number = "9",
pages = "605609",
year = "1982",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Mon Jan 22 07:11:57 MST 2001",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm25.html#Pechura82;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Pechura82",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Pechura82",
}
[(W 31k57Ee;?c1k]articledatacompression.bibPechura:1982:FATMichael A. PechuraFile Archival Techniques Using Data CompressionjCACM2596056091982CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Mon Jan 22 07:11:57 MST 2001http://dblp.unitrier.de/db/journals/cacm/cacm25.html#Pechura82; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2001.01.22 07:11:57 MSTCommunications of the ACMacknhfbhttp://portal.acm.org/brUceedings of the IEEE International Conference on
Acoustics, Speech, and Signal Processing",
title = "Adaptive Block Truncation Coding Scheme Using an Edge
Following Algorithm",
publisher = pubIEEE,
address = pubIEEE:adr,
pages = "12351238",
year = "1982",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Ronson, J. and J. Dewitte (1982) ``Adaptive Block
Truncation Coding Scheme Using an Edge Following
Algorithm,'' {\it Proceedings of the IEEE International
Conference on Acoustics, Speech, and Signal
Processing}, Piscataway, NJ, IEEE Press, pp.
12351238.",
}aptive Block Truncation Coding Scheme Using an Edge Following Algorithm
@InProceedings{Ronson:1982:ABT,
author = "J. Ronson and J. Dewitte",
booktitle = "Proceedings of the IEEE International Conference on
Acoustics, Speech, and Signal Processing",
title = "Adaptive Block Truncation Coding Scheme Using an Edge
Following Algorithm",
publisher = pubIEEE,
address = pubIEEE:adr,
pages = "12351238",
year = "1982",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Ronson, J. and J. Dewitte (1982) ``Adaptive Block
Truncation Coding Scheme Using an Edge Following
Algorithm,'' {\it Proceedings of the IEEE International
Conference on Acoustics, Speech, and Signal
Processing}, Piscataway, NJ, IEEE Press, pp.
12351238.",
}
L)Y'3+=E%!E};=Ewinproceedingsdatacompression.bibRonson:1982:ABTJ. Ronson and J. DewitteProceedings of the IEEE International Conference on Acoustics, Speech, and Signal ProcessingAdaptive Block Truncation Coding Scheme Using an Edge Following AlgorithmpubIEEEpubIEEE:adr123512381982Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsJ. Ronson and J. DewitteProceedings of the IEEE International Conference on Acoustics, Speech, and Signal ProcessingAdX "29",
number = "4",
pages = "928951",
month = oct,
year = "1982",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jacm.bib",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
rawdata1 = "Storer, James A. and T. G. Szymanski (1982) ``Data
Compression via Textual Substitution,'' {\it Journal of
the ACM}, {\bf29}:928951.",
rawdata2 = "Storer, J. A., and T. G. Szymanski (1982) ``Data
Compression via Textual Substitution,'' {\it Journal of
the ACM} {\bf29}:928951.",
} "29",
number = "4",
pages = "928951",
month = oct,
year = "1982",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jacm.bib",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
rawdata1 = "Storer, James A. and T. G. Szymanski (1982) ``Data
Compression via Textual Substitution,'' {\it Journal of
the ACM}, {\bf29}:928951.",
rawdata2 = "Storer, J. A., and T. G. Szymanski (1982) ``Data
Compression via Textual Substitution,'' {\it Journal of
the ACM} {\bf29}:928951.",
}
{{y*W3+[_57E;qe[_{articledatacompression.bibStorer:1982:DCTJames A. Storer and Thomas G. SzymanskiData Compression via Textual SubstitutionjJACM294928951oct101982JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 00045411Sat Jan 26 12:46:16 MST 2013http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib2013.01.26 12:46:16 MSTJournal of the Association for Computing Machineryackdshttp://portal.acm.org/browse_dl.cfm?idx=J401James A. Storer and Thomas G. SzymanskiData Compression via Textual Substitution
@Article{Storer:1982:DCT,
author = "James A. Storer and Thomas G. Szymanski",
title = "Data Compression via Textual Substitution",
journal = jJACM,
volume = [ech Data Compression System Based Upon
Vector Quantization",
type = "{M.S.} thesis",
school = "California State University, Long Beach",
address = "Long Beach, CA, USA",
pages = "189",
year = "1982",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303109401",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "1319587",
subject = "Electrical engineering",
}.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303109401Electrical engineeringacknhfbBertram P. M. TaoRealTime Speech Data Compression System Based Upon Vector Quantization
@MastersThesis{Tao:1982:RTS,
author = "Bertram P. M. Tao",
title = "RealTime Speech Data Compression System Based Upon
Vector Quantization",
type = "{M.S.} thesis",
school = "California State University, Long Beach",
address = "Long Beach, CA, USA",
pages = "189",
year = "1982",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303109401",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "1319587",
subject = "Electrical engineering",
}
mm/,V3#=g77C;YgwG=g articledatacompression.bibWu:1982:ABAJ. K. Wu and R. E. BurgeAdaptive Bit Allocation for Image CompressionjCGIP194392400aug81982CGIPBG0146664X OR 0146664X0146664X OR 0146664XFri Feb 7 08:36:21 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/cvgip.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.02.07 08:36:21 MSTComputer Graphics and Image Processingimage processing; pattern recognition systemsacknhfbhttp://www.sciencedirect.com/scaL+X '3%/#[3C7;e9/mastersthesisdatacompression.bibTao:1982:RTSBertram P. M. TaoRealTime Speech Data Compression System Based Upon Vector QuantizationM.S. thesisCalifornia State University, Long BeachLong Beach, CA, USA1891982Fri Feb 1 09:20:32 MST 2013http://search^Allocation for Image Compression",
journal = jCGIP,
volume = "19",
number = "4",
pages = "392400",
month = aug,
year = "1982",
CODEN = "CGIPBG",
ISSN = "0146664X",
ISSNL = "0146664X",
bibdate = "Fri Feb 7 08:36:21 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/cvgip.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "723",
fjournal = "Computer Graphics and Image Processing",
journalURL = "http://www.sciencedirect.com/science/journal/0146664X",
journalabr = "Comput Graphics Image Process",
keywords = "image processing; pattern recognition systems",
}ience/journal/0146664XComput Graphics Image ProcessJ. K. Wu and R. E. BurgeAdaptive Bit Allocation for Image Compression
@Article{Wu:1982:ABA,
author = "J. K. Wu and R. E. Burge",
title = "Adaptive Bit Allocation for Image Compression",
journal = jCGIP,
volume = "19",
number = "4",
pages = "392400",
month = aug,
year = "1982",
CODEN = "CGIPBG",
ISSN = "0146664X",
ISSNL = "0146664X",
bibdate = "Fri Feb 7 08:36:21 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/cvgip.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "723",
fjournal = "Computer Graphics and Image Processing",
journalURL = "http://www.sciencedirect.com/science/journal/0146664X",
journalabr = "Comput Graphics Image Process",
keywords = "image processing; pattern recognition systems",
}The {Laplacian} Pyramid as a Compact Image Code",
journal = jIEEETRANSCOMM,
volume = "COM31",
number = "4",
pages = "532540",
month = apr,
year = "1983",
CODEN = "IECMBT",
ISSN = "00906778 (print), 15580857 (electronic)",
ISSNL = "00906778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Burt, Peter J., and Edward H. Adelson (1983) ``The
Laplacian Pyramid as a Compact Image Code,'' {\it IEEE
Transactions on Communications}, {\bf
COM31}(4):532540, April.",
}6 12:46:16 MSTIEEE Transactions on CommunicationsackdsPeter J. Burt and Edward H. AdelsonThe {Laplacian} Pyramid as a Compact Image Code
@Article{Burt:1983:LPC,
author = "Peter J. Burt and Edward H. Adelson",
title = "The {Laplacian} Pyramid as a Compact Image Code",
journal = jIEEETRANSCOMM,
volume = "COM31",
number = "4",
pages = "532540",
month = apr,
year = "1983",
CODEN = "IECMBT",
ISSN = "00906778 (print), 15580857 (electronic)",
ISSNL = "00906778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Burt, Peter J., and Edward H. Adelson (1983) ``The
Laplacian Pyramid as a Compact Image Code,'' {\it IEEE
Transactions on Communications}, {\bf
COM31}(4):532540, April.",
}
55?V3'Sg/57E};SSks articledatacompression.bibBurt:1983:LPCPeter J. Burt and Edward H. AdelsonThe Laplacian Pyramid as a Compact Image CodejIEEETRANSCOMMCOM314532540apr41983IECMBT00906778 (print), 15580857 (electronic) OR 00906778 (print), 15580857 (electronic)00906778 OR 00906778Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.2c W. Schussler",
booktitle = "Signal Processing II: Theories and
ApplicationsProceedings of EUSIPCO 83",
title = "Original Block Coding Scheme for Low Bit Rate Image
Transmission",
publisher = pubELSEVIERSCIENCE,
address = pubELSEVIERSCIENCE:adr,
pages = "143146",
year = "1983",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Dewitte, J., and J. Ronson (1983) ``Original Block
Coding Scheme for Low Bit Rate Image Transmission,''
{\it Signal Processing II: Theories and
ApplicationsProceedings of EUSIPCO 83}, H. W.
Schussler, ed., Amsterdam, Elsevier Science Publishers
B. V. (NorthHolland), pp. 143146.",
}nsmission
@InProceedings{Dewitte:1983:OBC,
author = "J. Dewitte and J. Ronson",
editor = "H. W. Schussler",
booktitle = "Signal Processing II: Theories and
ApplicationsProceedings of EUSIPCO 83",
title = "Original Block Coding Scheme for Low Bit Rate Image
Transmission",
publisher = pubELSEVIERSCIENCE,
address = pubELSEVIERSCIENCE:adr,
pages = "143146",
year = "1983",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Dewitte, J., and J. Ronson (1983) ``Original Block
Coding Scheme for Low Bit Rate Image Transmission,''
{\it Signal Processing II: Theories and
ApplicationsProceedings of EUSIPCO 83}, H. W.
Schussler, ed., Amsterdam, Elsevier Science Publishers
B. V. (NorthHolland), pp. 143146.",
}
ii.Y '3=+#
5=E};=#+
sinproceedingsdatacompression.bibDewitte:1983:OBCJ. Dewitte and J. RonsonH. W. SchusslerSignal Processing II: Theories and ApplicationsProceedings of EUSIPCO 83Original Block Coding Scheme for Low Bit Rate Image TransmissionpubELSEVIERSCIENCEpubELSEVIERSCIENCE:adr1431461983Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsJ. Dewitte and J. RonsonSignal Processing II: Theories and ApplicationsProceedings of EUSIPCO 83H. W. SchusslerOriginal Block Coding Scheme for Low Bit Rate Image Traftle = "Is Text Compression by Prefixes and Suffixes
Practical?",
journal = jACTAINFO,
volume = "20",
number = "4",
pages = "371389",
month = dec,
year = "1983",
CODEN = "AINFA2",
DOI = "http://dx.doi.org/10.1007/BF00264280",
ISSN = "00015903 (print), 14320525 (electronic)",
ISSNL = "00015903",
MRclass = "68U15 (94A29)",
MRnumber = "732312 (85c:68084)",
bibdate = "Mon May 26 18:16:34 2014",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
http://www.math.utah.edu/pub/tex/bib/actainfo.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
MathSciNet database",
series = "Monographs in Visual Communication",
acknowledgement = acknhfb,
fjournal = "Acta Informatica",
journalURL = "http://link.springer.com/journal/236",
}zri S. Fraenkel and Moshe Mor and Y. Perl",
title = "Is Text Compression by Prefixes and Suffixes
Practical?",
journal = jACTAINFO,
volume = "20",
number = "4",
pages = "371389",
month = dec,
year = "1983",
CODEN = "AINFA2",
DOI = "http://dx.doi.org/10.1007/BF00264280",
ISSN = "00015903 (print), 14320525 (electronic)",
ISSNL = "00015903",
MRclass = "68U15 (94A29)",
MRnumber = "732312 (85c:68084)",
bibdate = "Mon May 26 18:16:34 2014",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
http://www.math.utah.edu/pub/tex/bib/actainfo.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
MathSciNet database",
series = "Monographs in Visual Communication",
acknowledgement = acknhfb,
fjournal = "Acta Informatica",
journalURL = "http://link.springer.com/journal/236",
}
aa/W3/g{#U57'1=;QUg{karticledatacompression.bibFraenkel:1983:TCPAviezri S. Fraenkel and Moshe Mor and Y. PerlIs Text Compression by Prefixes and Suffixes Practical?jACTAINFO204371389dec121983AINFA2http://dx.doi.org/10.1007/BF0026428000015903 (print), 14320525 (electronic) OR 00015903 (print), 14320525 (electronic)00015903 OR 0001590368U15 (94A29)732312 (85c:68084)Mon May 26 18:16:34 2014ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; http://www.math.utah.edu/pub/tex/bib/actainfo.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; MathSciNet database2014.05.26 18:16:34 ???Monographs in Visual CommunicationActa Informaticaacknhfbhttp://link.springer.com/journal/236Aviezri S. Fraenkel and Moshe Mor and Y. PerlIs Text Compression by Prefixes and Suffixes Practical?
@Article{Fraenkel:1983:TCP,
author = "Aviei Compression Algorithm",
type = "{Ph.D.} thesis",
school = "The University of Connecticut",
address = "Storrs, CT, USA",
pages = "167",
year = "1983",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303265149",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8319202",
subject = "Electrical engineering",
}.D. thesisThe University of ConnecticutStorrs, CT, USA1671983Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303265149Electrical engineeringacknhfbThomas KurienA Partitioned Data Compression Algorithm
@PhdThesis{Kurien:1983:PDC,
author = "Thomas Kurien",
title = "A Partitioned Data Compression Algorithm",
type = "{Ph.D.} thesis",
school = "The University of Connecticut",
address = "Storrs, CT, USA",
pages = "167",
year = "1983",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303265149",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8319202",
subject = "Electrical engineering",
}
{@}{v2X 3+;57E};[+;articledatacompression.bibLangdon:1983:NZLGlen G. LangdonA Note on the ZivLempel Model for Compressing Individual SequencesjIEEETRANSINFTHEORYIT292284287mar31983IETTAW00189448 (print), 15579654 (electronic) OR 00189448 (print), 15579654 (electronic)00189448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Informatr71U 3[!7E};O[articledatacompression.bibLangdon:1983:ARLGlenn G. LangdonAn Adaptive Run Length Coding AlgorithmjIBp40V 3+']%G+C7;e9']phdthesisdatacompression.bibKurien:1983:PDCThomas KurienA Partitioned Data Compression AlgorithmPhlLength Coding Algorithm",
journal = jIBMTDB,
volume = "26",
number = "7B",
pages = "37833785",
month = dec,
year = "1983",
CODEN = "IBMTAA",
ISSN = "00188689",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IBM Technical Disclosure Bulletin",
rawdata = "Langdon, Glenn G. (1983a) ``An Adaptive Run Length
Coding Algorithm,'' {\it IBM Technical Disclosure
Bulletin}, {\bf26}(7B):37833785, December.",
}
GX2G&9u
@Article{McCreight:1976:SES,
5
@Article{Liu:1997:NTS,
author = "C. P. Liu",
title = "A New Two Successive Process Image Compression
Technique Using Su;
@Article{Lindley:1995:JLIb,
author = "Craig A. Lindley",
title = "{JPEGLike} Ima}{
@Article{Lindley:1995:JLIa,
author = "Craig A. Lindley",
title = "{JPEG}like ImaaC
@Article{Lippert:1997:CDV,
author = "L. Lippert and M. H. Gross and C. Kurmann",
title =qc
@Article{Liou:1991:OPK,
author = "Ming Liou",
title = "Overview of the p$ \times $u
@Article{LouisGave;
@Article{Liu:2010:GDH,
author = "Yang Liu and Balakrishnan Prabhakaran and Xiaohu Guo",
"a+
@Article{Liu:2005:DBV,
author = "Hongmei Liu and Jiwu Huang and Yun Q. Shi",
title = v3i
@Article{Ling:1975:BOI,
author = "H. Ling and F. P. Palermo",
title = "BlockOrieMTDB267B37833785dec121983IBMTAA00188689 OR 00188689Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIBM Technical Disclosure BulletinackdsGlenn G. LangdonAn Adaptive Run Length Coding Algorithm
@Article{Langdon:1983:ARL,
author = "Glenn G. Langdon",
title = "An Adaptive Run Length Coding Algorithm",
journal = jIBMTDB,
volume = "26",
number = "7B",
pages = "37833785",
month = dec,
year = "1983",
CODEN = "IBMTAA",
ISSN = "00188689",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IBM Technical Disclosure Bulletin",
rawdata = "Langdon, Glenn G. (1983a) ``An Adaptive Run Length
Coding Algorithm,'' {\it IBM Technical Disclosure
Bulletin}, {\bf26}(7B):37833785, December.",
}vLempel} Model for Compressing
Individual Sequences",
journal = jIEEETRANSINFTHEORY,
volume = "IT29",
number = "2",
pages = "284287",
month = mar,
year = "1983",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Langdon, Glen G. (1983) ``A Note on the ZivLempel
Model for Compressing Individual Sequences,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT29}(2):284287, March.",
}ion TheoryackdsGlen G. LangdonA Note on the {ZivLempel} Model for Compressing Individual Sequences
@Article{Langdon:1983:NZL,
author = "Glen G. Langdon",
title = "A Note on the {ZivLempel} Model for Compressing
Individual Sequences",
journal = jIEEETRANSINFTHEORY,
volume = "IT29",
number = "2",
pages = "284287",
month = mar,
year = "1983",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Langdon, Glen G. (1983) ``A Note on the ZivLempel
Model for Compressing Individual Sequences,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT29}(2):284287, March.",
}ession techniques as applied to the
electroencephalograph signal",
volume = "54443",
type = "{M.Sc.} thesis",
school = "The University of Manitoba",
address = "Winnipeg, MB, Canada",
pages = "????",
year = "1983",
ISBN = "0315065230",
ISBN13 = "9780315065239",
ISSN = "02273845",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "amicus.nlcbnc.ca:210/NL; http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "2 microfiches (150 frames).",
series = "Canadian theses on microfiche = Th{\`e}ses canadiennes
sur microfiche",
URL = "http://search.proquest.com/docview/303201518?accountid=14677",
acknowledgement = acknhfb,
classification = "0537: Engineering",
dissertationthesisnumber = "MK54443",
subject = "Engineering",
}m",
title = "Data compression techniques as applied to the
electroencephalograph signal",
volume = "54443",
type = "{M.Sc.} thesis",
school = "The University of Manitoba",
address = "Winnipeg, MB, Canada",
pages = "????",
year = "1983",
ISBN = "0315065230",
ISBN13 = "9780315065239",
ISSN = "02273845",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "amicus.nlcbnc.ca:210/NL; http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "2 microfiches (150 frames).",
series = "Canadian theses on microfiche = Th{\`e}ses canadiennes
sur microfiche",
URL = "http://search.proquest.com/docview/303201518?accountid=14677",
acknowledgement = acknhfb,
classification = "0537: Engineering",
dissertationthesisnumber = "MK54443",
subject = "Engineering",
}
yy{3Z '3)1!%A5CQ7Ck;C#1C!mastersthesisdatacompression.bibNadim:1983:DCTGalal Ezz E. NadimData compression techniques as applied to the electroencephalograph signal54443M.Sc. thesisThe University of ManitobaWinnipeg, MB, Canada19830315065230 OR 03150652309780315065239 OR 978031506523902273845 OR 02273845Fri Feb 1 09:20:32 MST 2013amicus.nlcbnc.ca:210/NL; http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MST2 microfiches (150 frames).Canadian theses on microfiche = Theses canadiennes sur microfichehttp://search.proquest.com/docview/303201518?accountid=14677EngineeringacknhfbGalal Ezz E. Nadim2 microfiches (150 frames).Data compression techniques as applied to the electroencephalograph signal
@MastersThesis{Nadim:1983:DCT,
author = "Galal Ezz E. Naditession of Imagery Using Linear Predictive
Coding Techniques",
type = "{Ph.D.} thesis",
school = "Florida Institute of Technology",
address = "Melbourne, FL, USA",
pages = "268",
year = "1983",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303271798",
acknowledgement = acknhfb,
classification = "0984: Computer science",
dissertationthesisnumber = "8319226",
subject = "Computer science",
}55 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 08:42:55 MSThttp://search.proquest.com/docview/303271798Computer scienceacknhfbPaul Leonard PoehlerData Compression of Imagery Using Linear Predictive Coding Techniques
@PhdThesis{Poehler:1983:DCI,
author = "Paul Leonard Poehler",
title = "Data Compression of Imagery Using Linear Predictive
Coding Techniques",
type = "{Ph.D.} thesis",
school = "Florida Institute of Technology",
address = "Melbourne, FL, USA",
pages = "268",
year = "1983",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303271798",
acknowledgement = acknhfb,
classification = "0984: Computer science",
dissertationthesisnumber = "8319226",
subject = "Computer science",
}
X$6X %3+15//5Ec;135 35incollectiondatacompression.bibVorobev:1983:FNNikolai N. VorobevIan Naismith SneddonFibonacci NumbersFibonacci NumbersNew Classics Library1983Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib2013.01.26 12:46:16 MSTTranslation by Halina Moss. Reprint ~N5X 3+%g57Ea;E}wG%garticledatacom{4X 35%K1C7;e5]phdthesisdatacompression.bibPoehler:1983:DCIPaul Leonard PoehlerData Compression of Imagery Using Linear Predictive Coding TechniquesPh.D. thesisFlorida Institute of TechnologyMelbourne, FL, USA2681983Fri Feb 1 08:42:wzeory of data compression",
journal = jTHEORCOMPSCI,
volume = "24",
number = "3",
pages = "221237",
month = aug,
year = "1983",
CODEN = "TCSCDI",
ISSN = "03043975 (print), 18792294 (electronic)",
ISSNL = "03043975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = acknhfb,
classification = "B6140 (Signal processing and detection); C1260
(Information theory); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Computer Sci., Brandeis Univ., Waltham, MA,
USA",
fjournal = "Theoretical Computer Science",
journalURL = "http://www.sciencedirect.com/science/journal/03043975",
keywords = "abstract program size complexity; abstract theory;
computational complexity; cost function; data
compression; programming language",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}pression.bibStorer:1983:TATJ. A. StorerToward an abstract theory of data compressionjTHEORCOMPSCI243221237aug81983TCSCDI03043975 (print), 18792294 (electronic) OR 03043975 (print), 18792294 (electronic)03043975 OR 03043975Sat Nov 22 13:36:07 MST 1997http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/tcs1980.bib1997.11.22 13:36:07 MSTTheoretical Computer Scienceabstract program size complexity; abstract theory; computational complexity; cost function; data compression; programming languageacknhfbDept. of Computer Sci., Brandeis Univ., Waltham, MA, USAhttp://www.sciencedirect.com/science/journal/03043975T Theoretical or MathematicalJ. A. StorerToward an abstract theory of data compression
@Article{Storer:1983:TAT,
author = "J. A. Storer",
title = "Toward an abstract theory of data compression",
journal = jTHEORCOMPSCI,
volume = "24",
number = "3",
pages = "221237",
month = aug,
year = "1983",
CODEN = "TCSCDI",
ISSN = "03043975 (print), 18792294 (electronic)",
ISSNL = "03043975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = acknhfb,
classification = "B6140 (Signal processing and detection); C1260
(Information theory); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Computer Sci., Brandeis Univ., Waltham, MA,
USA",
fjournal = "Theoretical Computer Science",
journalURL = "http://www.sciencedirect.com/science/journal/03043975",
keywords = "abstract program size complexity; abstract theory;
computational complexity; cost function; data
compression; programming language",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}th Sneddon",
booktitle = "{Fibonacci} Numbers",
title = "{Fibonacci} Numbers",
publisher = "New Classics Library",
address = "????",
pages = "??",
year = "1983",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/fibquart.bib",
note = "Translation by Halina Moss. Reprint of
\cite{Vorobev:1961:FN}.",
acknowledgement = ackds,
rawdata = "Vorobev, Nikolai N. (1983) in Ian N. Sneddon (ed.),
and Halina Moss (translator), {\it Fibonacci Numbers},
New Classics Library.",
xxauthor = "Nikolai N. Vorobiev",
}of cite Vorobev:1961:FN.ackdsNikolai N. Vorobev{Fibonacci} NumbersIan Naismith SneddonTranslation by Halina Moss. Reprint of \cite{Vorobev:1961:FN}.{Fibonacci} Numbers
@InCollection{Vorobev:1983:FN,
author = "Nikolai N. Vorobev",
editor = "Ian Naismith Sneddon",
booktitle = "{Fibonacci} Numbers",
title = "{Fibonacci} Numbers",
publisher = "New Classics Library",
address = "????",
pages = "??",
year = "1983",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/fibquart.bib",
note = "Translation by Halina Moss. Reprint of
\cite{Vorobev:1961:FN}.",
acknowledgement = ackds,
rawdata = "Vorobev, Nikolai N. (1983) in Ian N. Sneddon (ed.),
and Halina Moss (translator), {\it Fibonacci Numbers},
New Classics Library.",
xxauthor = "Nikolai N. Vorobiev",
}sion and decompression
apparatus and method",
howpublished = "US Patent 4,558,302.",
day = "7",
month = aug,
year = "1984",
bibdate = "Thu Feb 14 10:28:31 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "US Patent Application US19830505638 filed 20 June
1983. See also the related patent
\cite{Eastman:1984:AMC} issued on the same day.",
URL = "http://www.google.com/patents/US455830",
acknowledgement = acknhfb,
}See also the related patent cite Eastman:1984:AMC issued on the same day.http://www.google.com/patents/US455830acknhfbUS Patent 4,558,302.Terry A. WelchUS Patent Application US19830505638 filed 20 June 1983. See also the related patent \cite{Eastman:1984:AMC} issued on the same day.High speed data compression and decompression apparatus and method
@Misc{Welch:1984:HSD,
author = "Terry A. Welch",
title = "High speed data compression and decompression
apparatus and method",
howpublished = "US Patent 4,558,302.",
day = "7",
month = aug,
year = "1984",
bibdate = "Thu Feb 14 10:28:31 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "US Patent Application US19830505638 filed 20 June
1983. See also the related patent
\cite{Eastman:1984:AMC} issued on the same day.",
URL = "http://www.google.com/patents/US455830",
acknowledgement = acknhfb,
}
JJ,8X 3+7%1C7;e97_phdthesisdatacompression.bibCathey:1984:DCNSilvia Gilbert CatheyData Compression for Noiseless Channels (Huffman Codes, Lattice Theory)Ph.D. thesisClemson UniversityClemson, SC, USA1371984Fri Feb 1 09:20:32 MST 2013hr7Y 3))=};Y5)Imiscdatacompression.bibWelch:1984:HSDTerry A. WelchHigh speed data compression and decompression apparatus and method7aug81984Thu Feb 14 10:28:31 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.14 10:28:31 ???US Patent Application US19830505638 filed 20 June 1983. ession for Noiseless Channels ({Huffman}
Codes, Lattice Theory)",
type = "{Ph.D.} thesis",
school = "Clemson University",
address = "Clemson, SC, USA",
pages = "137",
year = "1984",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303289543",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8426762",
subject = "Electrical engineering",
}
+rL&+%
@PhdThesis{Haley:2011:PCC,
author = "Brent Kreh Haley",
title = "A Pipeline for t#?.]
@PhdThesis{Gooda:2003:ATD,
author = "AbdelHamid Mohamed Gooda",
title = "Applicam)
@PhdThesis{Fong:1981:DOA,
author = "ChungBin Fong",
title = "The Decision Orient5
@PhdThesis{Ginesta:1995:DHO,
author = "Xavier Ginesta",
title = "Design of higho
@PhdThesis{Foulds:1985:DRT,
author = "Richard Arthur Foulds",
title = "A Data Red؇?
@PhdThesis{Goodman:1991:TPI,
author = "Stephen Darrow Goodman",
title = "Temporalڇ&M
@PhdThesis{Gadallah:1991:DCT,
author = "M. E. Gadallah",
title = "Data Compressio҇+
@PhdThesis{Haghighat:2007:DCU,
author = "Javad Haghighat",
title = "Data compressgQ
@PhdThesis{Felt:1974:DCT,
author = "Douglas Charles Felt",
title = "DataCompressttp://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303289543Electrical engineeringacknhfbSilvia Gilbert CatheyData Compression for Noiseless Channels ({Huffman} Codes, Lattice Theory)
@PhdThesis{Cathey:1984:DCN,
author = "Silvia Gilbert Cathey",
title = "Data Compression for Noiseless Channels ({Huffman}
Codes, Lattice Theory)",
type = "{Ph.D.} thesis",
school = "Clemson University",
address = "Clemson, SC, USA",
pages = "137",
year = "1984",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303289543",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8426762",
subject = "Electrical engineering",
}ring Matching",
journal = jIEEETRANSCOMM,
volume = "COM32",
number = "4",
pages = "396402",
month = apr,
year = "1984",
CODEN = "IECMBT",
ISSN = "00906778 (print), 15580857 (electronic)",
ISSNL = "00906778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Communications",
rawdata1 = "Cleary, John G., and I. H. Witten (1984) ``Data
Compression Using Adaptive Coding and Partial String
Matching,'' {\it IEEE Transactions on Communications},
{\bf COM32}(4):396402, April.",
rawdata2 = "Cleary, J. G., and I. H. Witten (1984) ``Data
Compression Using Adaptive Coding and Partial String
Matching,'' {\it IEEE Transactions on Communications}
COM32(4):396402, April.",
}
1&7x1C
@Article{Hlavac:1999:APL,
author = "V. Hlav{\'a}{\v{c}} and J. Fojt{\'\i}k",
title = o_
@Article{Hlavac:1997:ANL,
author = "V. Hlavac and J. Fojtik",
title = "Adaptive ND
@Article{Hirschberg:1990:EDP,
author = "Daniel S. Hirschberg and Debra A. Lelewer",
titl5m
@Article{Hilbert:1891:SAL,
author = "D. Hilbert",
title = "{{\"U}ber stetige Abbildung einer Linie auf ein
Fl{\"a}chenst{\"u}ck}. ({German}) [{On}xq
@Article{Herzog:2008:PRA,
author = "Robert Herzog and Shinichi Kinuwaki and Karol
Myszkowski aXqe
@Article{Hecht:1942:EQV,
author = "S. Hecht and S. Schlaer and M. H. Pirenne",
title = '
@Article{Heath:1972:OBC,
author = "F. G. Heath",
title = "Origins of the Binary CcG
@Article{Hayden:2002:TQC,
author = "Patrick Hayden and Richard Jozsa and Andreas Winter",
1String Matching",
journal = jIEEETRANSCOMM,
volume = "COM32",
number = "4",
pages = "396402",
month = apr,
year = "1984",
CODEN = "IECMBT",
ISSN = "00906778 (print), 15580857 (electronic)",
ISSNL = "00906778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Communications",
rawdata1 = "Cleary, John G., and I. H. Witten (1984) ``Data
Compression Using Adaptive Coding and Partial String
Matching,'' {\it IEEE Transactions on Communications},
{\bf COM32}(4):396402, April.",
rawdata2 = "Cleary, J. G., and I. H. Witten (1984) ``Data
Compression Using Adaptive Coding and Partial String
Matching,'' {\it IEEE Transactions on Communications}
COM32(4):396402, April.",
}
9X3+K/57E};SKOarticledatacompression.bibCleary:1984:DCUJohn G. Cleary and I. H. WittenData Compression Using Adaptive Coding and Partial String MatchingjIEEETRANSCOMMCOM324396402apr41984IECMBT00906778 (print), 15580857 (electronic) OR 00906778 (print), 15580857 (electronic)00906778 OR 00906778Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on CommunicationsackdsJohn G. Cleary and I. H. WittenData Compression Using Adaptive Coding and Partial String Matching
@Article{Cleary:1984:DCU,
author = "John G. Cleary and I. H. Witten",
title = "Data Compression Using Adaptive Coding and Partial
"Apparatus and method for compressing data signals and
restoring the signal",
howpublished = "US Patent 4,558,302.",
day = "7",
month = aug,
year = "1984",
bibdate = "Thu Feb 14 10:33:02 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "US Patent Application 291,870 filed 10 August 1981.
See also the related patent \cite{Welch:1984:HSD}
issued on the same day. This patent was held by Sperry
and its successor, Unisys, and vigorously enforced
until its expiry on 7 August 2001. It led to
multimilliondollar lawsuit settlements, and the move
away from LZW compression to several other methods that
are patent free.",
URL = "http://www.google.com/patents/US4464650;
https://en.wikipedia.org/wiki/Graphics_Interchange_Format",
acknowledgement = acknhfb,
}d by Sperry and its successor, Unisys, and vigorously enforced until its expiry on 7 August 2001. It led to multimilliondollar lawsuit settlements, and the move away from LZW compression to several other methods that are patent free.http://www.google.com/patents/US4464650; https://en.wikipedia.org/wiki/Graphics_Interchange_FormatacknhfbUS Patent 4,558,302.Willard L. Eastman and Abraham Lempel and Jacob Ziv and Martin CohnUS Patent Application 291,870 filed 10 August 1981. See also the related patent \cite{Welch:1984:HSD} issued on the same day. This patent was held by Sperry and its successor, Unisys, and vigorously enforced until its expiry on 7 August 2001. It led to multimilliondollar lawsuit settlements, and the move away from LZW compression to several other methods that are patent free.Apparatus and method for compressing data signals and restoring the signal
@Misc{Eastman:1984:AMC,
author = "Willard L. Eastman and Abraham Lempel and Jacob Ziv
and Martin Cohn",
title = "Apparatus and method for compressing data signals and
restoring the signal",
howpublished = "US Patent 4,558,302.",
day = "7",
month = aug,
year = "1984",
bibdate = "Thu Feb 14 10:33:02 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "US Patent Application 291,870 filed 10 August 1981.
See also the related patent \cite{Welch:1984:HSD}
issued on the same day. This patent was held by Sperry
and its successor, Unisys, and vigorously enforced
until its expiry on 7 August 2001. It led to
multimilliondollar lawsuit settlements, and the move
away from LZW compression to several other methods that
are patent free.",
URL = "http://www.google.com/patents/US4464650;
https://en.wikipedia.org/wiki/Graphics_Interchange_Format",
acknowledgement = acknhfb,
}
eeEU'3)CE'C};CEw inproceedingsdatacompression.bibGamal:1984:IDCA. El Gamal and A. OrlitskyInteractive Data CompressionIEEE:1984:ASF1001081984Thu Apr 5 06:13:39 MDT 2001http://www.math.utah.edu/pub/tex/bib/datacompression.bib2001.04.05 06:13:39 MDTacknhfbA. El Gamal and A. OrlitskyInteractive Data Compression
@InProceedings{Gamal:1984:IDC,
author = "A. El Gamal and A. Orlitsky",
title = "Interactive Data Compression",
crossref = "IEEE:1984:ASF",
pages = "100108",
year = "1984",
bibdate = "Thu Apr 5 06:13:39 MDT 2001",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
}ength coding for graylevel
pictures",
journal = jATTBELLLABTECHJ,
volume = "63",
number = "2",
pages = "249260",
year = "1984",
CODEN = "ABLJER",
ISSN = "0748612X",
bibdate = "Fri Nov 12 09:17:39 2010",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/bstj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "This paper presents a new variablelength coding
algorithm for bitrate reduction of digital images. The
coding scheme is based on the fact that by taking into
account the local conditional statistics of the
picture, the coding efficiency can be improved
considerably. Results of computer simulations are
presented in terms of picture quality and required bit
rate. Simulations show that for various Differential
Pulse Code Modulation (DPCM) coded pictures, coding
efficiency is such that a bit rate below the entropy of
the DPCM quantizer output is attained. For a 3bit DPCM
encoded picture, a bit rate of 1.64 bits/picture
element is achieved.",
acknowledgement = acknhfb,
fjournal = "AT\&T Bell Laboratories Technical Journal",
keywords = "data processing  code converters; pulse code
modulation",
subject = "conditional variablelength coding; digital image
reduction; graylevel picture coding",
topic = "image processing",
}mulations are presented in terms of picture quality and required bit rate. Simulations show that for various Differential Pulse Code Modulation (DPCM) coded pictures, coding efficiency is such that a bit rate below the entropy of the DPCM quantizer output is attained. For a 3bit DPCM encoded picture, a bit rate of 1.64 bits/picture element is achieved.AT&T Bell Laboratories Technical Journaldata processing  code converters; pulse code modulationconditional variablelength coding; digital image reduction; graylevel picture codingacknhfbThis paper presents a new variablelength coding algorithm for bitrate reduction of digital images. The coding scheme is based on the fact that by taking into account the local conditional statistics of the picture, the coding efficiency can be improved considerably. Results of computer simulations are presented in terms of picture quality and required bit rate. Simulations show that for various Differential Pulse Code Modulation (DPCM) coded pictures, coding efficiency is such that a bit rate below the entropy of the DPCM quantizer output is attained. For a 3bit DPCM encoded picture, a bit rate of 1.64 bits/picture element is achieved.H. GharaviConditional variablelength coding for graylevel pictures
@Article{Gharavi:1984:CVL,
author = "H. Gharavi",
title = "Conditional variablelength coding for graylevel
pictures",
journal = jATTBELLLABTECHJ,
volume = "63",
number = "2",
pages = "249260",
year = "1984",
CODEN = "ABLJER",
ISSN = "0748612X",
bibdate = "Fri Nov 12 09:17:39 2010",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/bstj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "This paper presents a new variablelength coding
algorithm for bitrate reduction of digital images. The
coding scheme is based on the fact that by taking into
account the local conditional statistics of the
picture, the coding efficiency can be improved
considerably. Results of computer simulations are
presented in terms of picture quality and required bit
rate. Simulations show that for various Differential
Pulse Code Modulation (DPCM) coded pictures, coding
efficiency is such that a bit rate below the entropy of
the DPCM quantizer output is attained. For a 3bit DPCM
encoded picture, a bit rate of 1.64 bits/picture
element is achieved.",
acknowledgement = acknhfb,
fjournal = "AT\&T Bell Laboratories Technical Journal",
keywords = "data processing  code converters; pulse code
modulation",
subject = "conditional variablelength coding; digital image
reduction; graylevel picture coding",
topic = "image processing",
}
uu@W 3%wE};{omiscdatacompression.bibISO:1984:IPSISOInformation Processing Systems  O?\ 3!77=;]9!articledatacompression.bibGharavi:1984:CVLH. GharaviConditional variablelength coding for graylevel picturesjATTBELLLABTECHJ6322492601984ABLJER0748612X OR 0748612XFri Nov 12 09:17:39 2010Compendex database; http://www.math.utah.edu/pub/tex/bib/bstj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2010.11.12 09:17:39 ???This paper presents a new variablelength coding algorithm for bitrate reduction of digital images. The coding scheme is based on the fact that by taking into account the local conditional statistics of the picture, the coding efficiency can be improved considerably. Results of computer siata Communication
HighLevel Data Link Control ProcedureFrame Structure:
{IS 3309}",
edition = "Third",
pages = "??",
month = oct,
year = "1984",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "ISO (1984) ``Information Processing SystemsData
Communication HighLevel Data Link Control
ProcedureFrame Structure,'' IS 3309, 3rd ed.,
October.",
}Data Communication HighLevel Data Link Control ProcedureFrame Structure: IS 3309Thirdoct101984Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsISOInformation Processing Systems  Data Communication HighLevel Data Link Control ProcedureFrame Structure: {IS 3309}
@Misc{ISO:1984:IPS,
author = "ISO",
title = "Information Processing Systems  Data Communication
HighLevel Data Link Control ProcedureFrame Structure:
{IS 3309}",
edition = "Third",
pages = "??",
month = oct,
year = "1984",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "ISO (1984) ``Information Processing SystemsData
Communication HighLevel Data Link Control
ProcedureFrame Structure,'' IS 3309, 3rd ed.,
October.",
} MixedOrder Model Structures for Data
Compression",
type = "IBM research report",
number = "RJ4163 (46091)",
institution = pubIBM,
address = pubIBM:adr,
pages = "??",
day = "18",
month = jan,
year = "1984",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Langdon, Glen G. (1984) {\it On Parsing vs.
MixedOrder Model Structures for Data Compression}, IBM
research report RJ4163 (46091), January 18, 1984, San
Jose, CA.",
}RJ4163 (46091)pubIBMpubIBM:adr18jan11984Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsGlen G. LangdonOn Parsing vs. MixedOrder Model Structures for Data Compression
@TechReport{Langdon:1984:PVM,
author = "Glen G. Langdon",
title = "On Parsing vs. MixedOrder Model Structures for Data
Compression",
type = "IBM research report",
number = "RJ4163 (46091)",
institution = pubIBM,
address = pubIBM:adr,
pages = "??",
day = "18",
month = jan,
year = "1984",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Langdon, Glen G. (1984) {\it On Parsing vs.
MixedOrder Model Structures for Data Compression}, IBM
research report RJ4163 (46091), January 18, 1984, San
Jose, CA.",
}
]BY 3)3O1m/=c;3#%3Ophdthesisdatacompression.bibLiang:1984:WHPFranklin Mark LiangWord Hyphenation by ComputerPh.D. dissertationComputer Science Department, Stanford UniversityStanford, CA, USA92mar31984Fri Jul 08 14:48:58 2005http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/texbook3.bib2005.07.08 14:48:58 ???http://www.tug.org/docs/liang/; http://wwwlib.umi.com/dissertations/fulbAW !3+
3+#E};+
/techreportdatacompression.bibLangdon:1984:PVMGlen G. LangdonOn Parsing vs. MixedOrder Model Structures for Data CompressionIBM research reportation by Computer",
type = "{Ph.D.} dissertation",
school = "Computer Science Department, Stanford University",
address = "Stanford, CA, USA",
pages = "92",
month = mar,
year = "1984",
bibdate = "Fri Jul 08 14:48:58 2005",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/texbook3.bib",
URL = "http://www.tug.org/docs/liang/;
http://wwwlib.umi.com/dissertations/fullcit/8329742",
abstract = "This thesis describes research leading to an improved
word hyphenation algorithm for the T(,E)X82 typesetting
system. Hyphenation is viewed primarily as a data
compression problem, where we are given a dictionary of
words with allowable division points, and try to devise
methods that take advantage of the large amount of
redundancy present. The new hyphenation algorithm is
based on the idea of hyphenating and inhibiting
patterns. These are simply strings of letters that,
when they match in a word, give us information about
hyphenation at some point in the pattern. For example,
`tion' and `cc' are good hyphenating patterns. An
important feature of this method is that a suitable set
of patterns can be extracted automatically from the
dictionary. In order to represent the set of patterns
in a compact form that is also reasonably efficient for
searching, the author has developed a new data
structure called a packed trie. This data structure
allows the very fast search times characteristic of
indexed tries, but in many cases it entirely eliminates
the wasted space for null links usually present in such
tries. We demonstrate the versatility and practical
advantages of this data structure by using a variant of
it as the critical component of the program that
generates the patterns from the dictionary. The
resulting hyphenation algorithm uses about 4500
patterns that compile into a packed trie occupying 25K
bytes of storage. These patterns find 89\% of the
hyphens in a pocket dictionary word list, with
essentially no error. By comparison, the uncompressed
dictionary occupies over 500K bytes.",
acknowledgement = acknhfb,
}lcit/8329742This thesis describes research leading to an improved word hyphenation algorithm for the T(,E)X82 typesetting system. Hyphenation is viewed primarily as a data compression problem, where we are given a dictionary of words with allowable division points, and try to devise methods that take advantage of the large amount of redundancy present. The new hyphenation algorithm is based on the idea of hyphenating and inhibiting patterns. These are simply strings of letters that, when they match in a word, give us information about hyphenation at some point in the pattern. For example, `tion' and `cc' are good hyphenating patterns. An important feature of this method is that a suitable set of patterns can be extracted automatically from the dictionary. In order to represent the set of patterns in a compact form that is also reasonably efficient for searching, the author has developed a new data structure called a packed trie. This data structure allows the very fast search times characteristic of indexed tries, but in many cases it entirely eliminates the wasted space for null links usually present in such tries. We demonstrate the versatility and practical advantages of this data structure by using a variant of it as the critical component of the program that generates the patterns from the dictionary. The resulting hyphenation algorithm uses about 4500 patterns that compile into a packed trie occupying 25K bytes of storage. These patterns find 89% of the hyphens in a pocket dictionary word list, with essentially no error. By comparison, the uncompressed dictionary occupies over 500K bytes.acknhfbThis thesis describes research leading to an improved word hyphenation algorithm for the T(,E)X82 typesetting system. Hyphenation is viewed primarily as a data compression problem, where we are given a dictionary of words with allowable division points, and try to devise methods that take advantage of the large amount of redundancy present. The new hyphenation algorithm is based on the idea of hyphenating and inhibiting patterns. These are simply strings of letters that, when they match in a word, give us information about hyphenation at some point in the pattern. For example, `tion' and `cc' are good hyphenating patterns. An important feature of this method is that a suitable set of patterns can be extracted automatically from the dictionary. In order to represent the set of patterns in a compact form that is also reasonably efficient for searching, the author has developed a new data structure called a packed trie. This data structure allows the very fast search times characteristic of indexed tries, but in many cases it entirely eliminates the wasted space for null links usually present in such tries. We demonstrate the versatility and practical advantages of this data structure by using a variant of it as the critical component of the program that generates the patterns from the dictionary. The resulting hyphenation algorithm uses about 4500 patterns that compile into a packed trie occupying 25K bytes of storage. These patterns find 89\% of the hyphens in a pocket dictionary word list, with essentially no error. By comparison, the uncompressed dictionary occupies over 500K bytes.Franklin Mark LiangWord Hyphenation by Computer
@PhdThesis{Liang:1984:WHP,
author = "Franklin Mark Liang",
title = "Word Hyphenation by Computer",
type = "{Ph.D.} dissertation",
school = "Computer Science Department, Stanford University",
address = "Stanford, CA, USA",
pages = "92",
month = mar,
year = "1984",
bibdate = "Fri Jul 08 14:48:58 2005",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/texbook3.bib",
URL = "http://www.tug.org/docs/liang/;
http://wwwlib.umi.com/dissertations/fullcit/8329742",
abstract = "This thesis describes research leading to an improved
word hyphenation algorithm for the T(,E)X82 typesetting
system. Hyphenation is viewed primarily as a data
compression problem, where we are given a dictionary of
words with allowable division points, and try to devise
methods that take advantage of the large amount of
redundancy present. The new hyphenation algorithm is
based on the idea of hyphenating and inhibiting
patterns. These are simply strings of letters that,
when they match in a word, give us information about
hyphenation at some point in the pattern. For example,
`tion' and `cc' are good hyphenating patterns. An
important feature of this method is that a suitable set
of patterns can be extracted automatically from the
dictionary. In order to represent the set of patterns
in a compact form that is also reasonably efficient for
searching, the author has developed a new data
structure called a packed trie. This data structure
allows the very fast search times characteristic of
indexed tries, but in many cases it entirely eliminates
the wasted space for null links usually present in such
tries. We demonstrate the versatility and practical
advantages of this data structure by using a variant of
it as the critical component of the program that
generates the patterns from the dictionary. The
resulting hyphenation algorithm uses about 4500
patterns that compile into a packed trie occupying 25K
bytes of storage. These patterns find 89\% of the
hyphens in a pocket dictionary word list, with
essentially no error. By comparison, the uncompressed
dictionary occupies over 500K bytes.",
acknowledgement = acknhfb,
}ls, and Formal Languages",
journal = jCOMPUTERSANDGRAPHICS,
volume = "18",
number = "3",
pages = "110",
month = jul,
year = "1984",
CODEN = "CGRADI, CPGPBZ",
ISSN = "00978930 (print), 15584569 (electronic)",
ISSNL = "00978930",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Ai/alife.bib;
http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Applications of formal grammars for generating graphic
fractals  ``graftals''  in the modeling of
plants.",
acknowledgement = ackds,
annote = "Graftals. Methods for displaying natural objects based
on formal language models are presented. In particular,
deterministic models are shown to exhibit sufficient
variety to be used in production graphic systems.",
fjournal = "Computer Graphics",
journalURL = "http://www.sciencedirect.com/science/journal/00978493",
keyword = "fractals; modelsgraphics; plants; automatatheory",
rawdata = "Smith, Alvy Ray (1984) ``Plants, Fractals and Formal
Languages,'' {\it Computer Graphics},
{\bf18}(3):110.",
xxauthor = "Alvy Ray Smith",
}graphic fractals  ``graftals''  in the modeling of plants.Computer GraphicsackdsGraftals. Methods for displaying natural objects based on formal language models are presented. In particular, deterministic models are shown to exhibit sufficient variety to be used in production graphic systems.http://www.sciencedirect.com/science/journal/00978493Alvy Ray {Smith III}Applications of formal grammars for generating graphic fractals  ``graftals''  in the modeling of plants.Plants, Fractals, and Formal Languages
@Article{Smith:1984:PFF,
author = "Alvy Ray {Smith III}",
title = "Plants, Fractals, and Formal Languages",
journal = jCOMPUTERSANDGRAPHICS,
volume = "18",
number = "3",
pages = "110",
month = jul,
year = "1984",
CODEN = "CGRADI, CPGPBZ",
ISSN = "00978930 (print), 15584569 (electronic)",
ISSNL = "00978930",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Ai/alife.bib;
http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Applications of formal grammars for generating graphic
fractals  ``graftals''  in the modeling of
plants.",
acknowledgement = ackds,
annote = "Graftals. Methods for displaying natural objects based
on formal language models are presented. In particular,
deterministic models are shown to exhibit sufficient
variety to be used in production graphic systems.",
fjournal = "Computer Graphics",
journalURL = "http://www.sciencedirect.com/science/journal/00978493",
keyword = "fractals; modelsgraphics; plants; automatatheory",
rawdata = "Smith, Alvy Ray (1984) ``Plants, Fractals and Formal
Languages,'' {\it Computer Graphics},
{\bf18}(3):110.",
xxauthor = "Alvy Ray Smith",
}
22WDY 3))o!57Ek;S)oarticledatacompression.bibWelch:1984:THPTerry A. WelchA Technique for HighPerformance Data CompressionjCOMPUTER176819jun61984CPTRB4http://doi.ieeecomputersociety.org/10.1109/MC.1984.165915800189162 (print), 15580814 (electronic) OR 00189162 (print), 15580814 (electronic)0018916?CZ 3)1Y=)57E#;k/7w5kYi
articledatacompression.bibSmith:1984:PFFAlvy Ray Smith IIIPlants, Fractals, and Formal LanguagesjCOMPUTERSANDGRAPHICS183110jul71984CGRADI, CPGPBZ00978930 (print), 15584569 (electronic) OR 00978930 (print), 15584569 (electronic)00978930 OR 00978930Sat Jan 26 12:46:16 MST 2013Ai/alife.bib; http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTApplications of formal grammars for generating Performance Data Compression",
journal = jCOMPUTER,
volume = "17",
number = "6",
pages = "819",
month = jun,
year = "1984",
CODEN = "CPTRB4",
DOI = "http://doi.ieeecomputersociety.org/10.1109/MC.1984.1659158",
ISSN = "00189162 (print), 15580814 (electronic)",
ISSNL = "00189162",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/computer1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Computer",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
rawdata = "Welch, T. A. (1984) ``A Technique for HighPerformance
Data Compression,'' {\it IEEE Computer},
{\bf17}(6):819, June.",
remark = "This is the paper with the LempelZivWelch (LZW)
algorithm that led to the famous Unix
compress/decompress programs (and the {.Z} file
extension), written by Spence Thomas at the University
of Utah in June 1984. It builds on prior work by Ziv
and Lempel \cite{Ziv:1977:UAS,Ziv:19778CIS} in
19771978.\par
Welch (the inventor) and Sperry Corporation (the
employer) applied for (on 20 June 1983), and received
(on 10 December 1985), a United States Patent (No.
4,558,302) on the algorithm (see
\pathhttp://patft.uspto.gov/netacgi/nphParser?Sect1=PTO1&Sect2=HITOFF&d=PALL&p=1&u=/netahtml/srchnum.htm&r=1&f=G&l=50&s1=4,558,302.WKU.&OS=PN/4,558,302&RS=PN/4,558,302),
and Unisys (which acquired Sperry in 1986) has since
regulated its use through licensing fees, notably from
Compuserv for its use in the GIF image format
compression.\par
The LZW decoding algorithm is widely held to be
unencumbered by patents.\par
About 1990, Adobe Systems licensed the LZW compression
algorithm from Unisys for use in the LZWEncode operator
in the Level 2 of the PostScript page description
language, so PostScriptproducing programs are required
to have a Unisys license in order to produce data for
that operator. Aladdin Software, the creators of
ghostscript, chose not to license the patent, and
instead, developed a completely different compression
algorithm that just happens to be decompressable with
the LZW decompression algorithm.\par
According to Salomon \cite[p.~216]{Salomon:2000:DCC},
``The patent expires on 10 December 2002, or 20 June
2003, depending on whether the GATT agreements
grandfather in existing patents or no. The first date
is 17 years from issuance of the patent (old U.S. law),
and the second is 20 years from the date of first
filing (a GATT requirement).''\par
In 1992, the GNU Project countered with gzip/gunzip
(and the {.gz} file extension), based on patentfree
algorithms, with better compression performance, and by
2000, those utilities had largely replaced
compress/decompress for Internet archives. gunzip will
uncompress a {.Z} file, but gzip will not create such a
file because of the patent.\par
In 1996, Julian R. Seward developed the bzip2/bunzip2
programs (and the .bz2 file extension), believed to be
patent free, based on the BurrowsWheeler
blocksorting text compression algorithm, and Huffman
coding, obtaining even better compression than gzip,
but at the expense of considerably longer running
times. The Unisys patent (United States Patent No.
4,558,302 (1985), Japanese Patent Numbers 2,123,602 and
2,610,084, and patents in Canada, France, Germany,
Italy and the United Kingdom) and license is discussed
at \path=http://www.unisys.com/about__unisys/lzw/= (URL
accurate on 16Jan2003).\par
In 1995, a collaborative group developed the Portable
Network Graphics (PNG) image file format in reaction to
the patent restrictions on the GIF format; see
\cite{Crocker:1995:PPN,Roelofs:1999:PDG}.",
}2 OR 00189162Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/computer1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTComputerThis is the paper with the LempelZivWelch (LZW) algorithm that led to the famous Unix compress/decompress programs (and the .Z file extension), written by Spence Thomas at the University of Utah in June 1984. It builds on prior work by Ziv and Lempel cite Ziv:1977:UAS,Ziv:19778CIS in 19771978.par Welch (the inventor) and Sperry Corporation (the employer) applied for (on 20 June 1983), and received (on 10 December 1985), a United States Patent (No. 4,558,302) on the algorithm (see path http://patft.uspto.gov/netacgi/nphParser?Sect1=PTO1&Sect2=HITOFF&d=PALL&p=1&u=/netahtml/srchnum.htm&r=1&f=G&l=50&s1=4,558,302.WKU.&OS=PN/4,558,302&RS=PN/4,558,302), and Unisys (which acquired Sperry in 1986) has since regulated its use through licensing fees, notably from Compuserv for its use in the GIF image format compression.par The LZW decoding algorithm is widely held to be unencumbered by patents.par About 1990, Adobe Systems licensed the LZW compression algorithm from Unisys for use in the LZWEncode operator in the Level 2 of the PostScript page description language, so PostScriptproducing programs are required to have a Unisys license in order to produce data for that operator. Aladdin Software, the creators of ghostscript, chose not to license the patent, and instead, developed a completely different compression algorithm that just happens to be decompressable with the LZW decompression algorithm.par According to Salomon cite [p.~216]Salomon:2000:DCC, ``The patent expires on 10 December 2002, or 20 June 2003, depending on whether the GATT agreements grandfather in existing patents or no. The first date is 17 years from issuance of the patent (old U.S. law), and the second is 20 years from the date of first filing (a GATT requirement).''par In 1992, the GNU Project countered with gzip/gunzip (and the .gz file extension), based on patentfree algorithms, with better compression performance, and by 2000, those utilities had largely replaced compress/decompress for Internet archives. gunzip will uncompress a .Z file, but gzip will not create such a file because of the patent.par In 1996, Julian R. Seward developed the bzip2/bunzip2 programs (and the .bz2 file extension), believed to be patent free, based on the BurrowsWheeler blocksorting text compression algorithm, and Huffman coding, obtaining even better compression than gzip, but at the expense of considerably longer running times. The Unisys patent (United States Patent No. 4,558,302 (1985), Japanese Patent Numbers 2,123,602 and 2,610,084, and patents in Canada, France, Germany, Italy and the United Kingdom) and license is discussed at path =http://www.unisys.com/about__unisys/lzw/= (URL accurate on 16Jan2003).par In 1995, a collaborative group developed the Portable Network Graphics (PNG) image file format in reaction to the patent restrictions on the GIF format; see cite Crocker:1995:PPN,Roelofs:1999:PDG.ackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2Terry A. WelchA Technique for HighPerformance Data Compression
@Article{Welch:1984:THP,
author = "Terry A. Welch",
title = "A Technique for HighPerformance Data Compression",
journal = jCOMPUTER,
volume = "17",
number = "6",
pages = "819",
month = jun,
year = "1984",
CODEN = "CPTRB4",
DOI = "http://doi.ieeecomputersociety.org/10.1109/MC.1984.1659158",
ISSN = "00189162 (print), 15580814 (electronic)",
ISSNL = "00189162",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/computer1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Computer",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
rawdata = "Welch, T. A. (1984) ``A Technique for HighPerformance
Data Compression,'' {\it IEEE Computer},
{\bf17}(6):819, June.",
remark = "This is the paper with the LempelZivWelch (LZW)
algorithm that led to the famous Unix
compress/decompress programs (and the {.Z} file
extension), written by Spence Thomas at the University
of Utah in June 1984. It builds on prior work by Ziv
and Lempel \cite{Ziv:1977:UAS,Ziv:19778CIS} in
19771978.\par
Welch (the inventor) and Sperry Corporation (the
employer) applied for (on 20 June 1983), and received
(on 10 December 1985), a United States Patent (No.
4,558,302) on the algorithm (see
\pathhttp://patft.uspto.gov/netacgi/nphParser?Sect1=PTO1&Sect2=HITOFF&d=PALL&p=1&u=/netahtml/srchnum.htm&r=1&f=G&l=50&s1=4,558,302.WKU.&OS=PN/4,558,302&RS=PN/4,558,302),
and Unisys (which acquired Sperry in 1986) has since
regulated its use through licensing fees, notably from
Compuserv for its use in the GIF image format
compression.\par
The LZW decoding algorithm is widely held to be
unencumbered by patents.\par
About 1990, Adobe Systems licensed the LZW compression
algorithm from Unisys for use in the LZWEncode operator
in the Level 2 of the PostScript page description
language, so PostScriptproducing programs are required
to have a Unisys license in order to produce data for
that operator. Aladdin Software, the creators of
ghostscript, chose not to license the patent, and
instead, developed a completely different compression
algorithm that just happens to be decompressable with
the LZW decompression algorithm.\par
According to Salomon \cite[p.~216]{Salomon:2000:DCC},
``The patent expires on 10 December 2002, or 20 June
2003, depending on whether the GATT agreements
grandfather in existing patents or no. The first date
is 17 years from issuance of the patent (old U.S. law),
and the second is 20 years from the date of first
filing (a GATT requirement).''\par
In 1992, the GNU Project countered with gzip/gunzip
(and the {.gz} file extension), based on patentfree
algorithms, with better compression performance, and by
2000, those utilities had largely replaced
compress/decompress for Internet archives. gunzip will
uncompress a {.Z} file, but gzip will not create such a
file because of the patent.\par
In 1996, Julian R. Seward developed the bzip2/bunzip2
programs (and the .bz2 file extension), believed to be
patent free, based on the BurrowsWheeler
blocksorting text compression algorithm, and Huffman
coding, obtaining even better compression than gzip,
but at the expense of considerably longer running
times. The Unisys patent (United States Patent No.
4,558,302 (1985), Japanese Patent Numbers 2,123,602 and
2,610,084, and patents in Canada, France, Germany,
Italy and the United Kingdom) and license is discussed
at \path=http://www.unisys.com/about__unisys/lzw/= (URL
accurate on 16Jan2003).\par
In 1995, a collaborative group developed the Portable
Network Graphics (PNG) image file format in reaction to
the patent restrictions on the GIF format; see
\cite{Crocker:1995:PPN,Roelofs:1999:PDG}.",
}ory of Codes",
publisher = pubACADEMIC,
address = pubACADEMIC:adr,
pages = "??",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Berstel, Jean and Dominique Perrin (1985) {\it Theory
of Codes}, Orlando, FL, Academic Press.",
}
oEU3+O+%E};O+bookdatacompression.bibBerstel:1985:TCJean Berstel and Dominique PerrinTheory of CodespubACADEMICpubACADEMIC:adr1985Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsJean Berstel and Dominique PerrinTheory of Codes
@Book{Berstel:1985:TC,
author = "Jean Berstel and Dominique Perrin",
title = "Theory of Codes",
publisher = pubACADEMIC,
address = pubACADEMIC:adr,
pages = "??",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Berstel, Jean and Dominique Perrin (1985) {\it Theory
of Codes}, Orlando, FL, Academic Press.",
}and error control techniques with
applications",
publisher = pubACADEMIC,
address = pubACADEMIC:adr,
pages = "xiv + 304",
year = "1985",
ISBN = "012159260X",
ISBN13 = "9780121592608",
LCCN = "TK5102.5 .D336 1985",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "clas.caltech.edu:210/INNOPAC;
cliodb.cc.columbia.edu:7090/Voyager;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = acknhfb,
subject = "Data compression (Telecommunication); Coding theory;
Errorcorrecting codes (Information theory)",
}STData compression (Telecommunication); Coding theory; Errorcorrecting codes (Information theory)acknhfbVito CappelliniData compression and error control techniques with applications
@Book{Cappellini:1985:DCE,
editor = "Vito Cappellini",
title = "Data compression and error control techniques with
applications",
publisher = pubACADEMIC,
address = pubACADEMIC:adr,
pages = "xiv + 304",
year = "1985",
ISBN = "012159260X",
ISBN13 = "9780121592608",
LCCN = "TK5102.5 .D336 1985",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "clas.caltech.edu:210/INNOPAC;
cliodb.cc.columbia.edu:7090/Voyager;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = acknhfb,
subject = "Data compression (Telecommunication); Coding theory;
Errorcorrecting codes (Information theory)",
}
00'GY'3a#E};a inproceedingsdatacompression.bibChoueka:1985:EVHY. Choueka and Shmuel T. Klein and Y. PerlProceedings of the 8th ACMSIGIR Conference, Montreal, QC, CanadaEfficient Variants of Huffman Codes in High Level LanguagespubACMpubACM:adr1221301985Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.ČFY 33+%CQ3E=;M+>bookdatacompression.bibCappellini:1985:DCEVito CappelliniData compression and error control techniques with applicationspubACADEMICpubACADEMIC:adrxiv + 3041985012159260X OR 012159260X9780121592608 OR 9780121592608TK5102.5 .D336 1985Mon Jan 28 15:19:07 MST 2013clas.caltech.edu:210/INNOPAC; cliodb.cc.columbia.edu:7090/Voyager; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; z3950.loc.gov:7090/Voyager2013.01.28 15:19:07 Mbooktitle = "Proceedings of the 8th ACMSIGIR Conference,
Montr{\'e}al, QC, Canada",
title = "Efficient Variants of {Huffman} Codes in High Level
Languages",
publisher = pubACM,
address = pubACM:adr,
pages = "122130",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Choueka Y., Shmuel T. Klein, and Y. Perl (1985)
``Efficient Variants of Huffman Codes in High Level
Languages,'' {\it Proceedings of the 8th ACMSIGIR
Conference}, Montreal, pp. 122130.",
}26 12:46:16 MSTackdsY. Choueka and Shmuel T. Klein and Y. PerlProceedings of the 8th ACMSIGIR Conference, Montr{\'e}al, QC, CanadaEfficient Variants of {Huffman} Codes in High Level Languages
@InProceedings{Choueka:1985:EVH,
author = "Y. Choueka and Shmuel T. Klein and Y. Perl",
booktitle = "Proceedings of the 8th ACMSIGIR Conference,
Montr{\'e}al, QC, Canada",
title = "Efficient Variants of {Huffman} Codes in High Level
Languages",
publisher = pubACM,
address = pubACM:adr,
pages = "122130",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Choueka Y., Shmuel T. Klein, and Y. Perl (1985)
``Efficient Variants of Huffman Codes in High Level
Languages,'' {\it Proceedings of the 8th ACMSIGIR
Conference}, Montreal, pp. 122130.",
}s and Gray Codes",
journal = jINTJCOMPUTMATH,
volume = "18",
pages = "313",
year = "1985",
CODEN = "IJCMAT",
ISSN = "00207160",
ISSNL = "00207160",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "International Journal of Computer Mathematics",
rawdata = "Cole, A. J. (1985) ``A Note on Peano Polygons and Gray
Codes,'' {\it International Journal of Computer
Mathematics}, {\bf18}:313.",
}ray CodesjINTJCOMPUTMATH183131985IJCMAT00207160 OR 0020716000207160 OR 00207160Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTInternational Journal of Computer MathematicsackdsA. J. ColeA Note on {Peano} Polygons and Gray Codes
@Article{Cole:1985:NPP,
author = "A. J. Cole",
title = "A Note on {Peano} Polygons and Gray Codes",
journal = jINTJCOMPUTMATH,
volume = "18",
pages = "313",
year = "1985",
CODEN = "IJCMAT",
ISSN = "00207160",
ISSNL = "00207160",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "International Journal of Computer Mathematics",
rawdata = "Cole, A. J. (1985) ``A Note on Peano Polygons and Gray
Codes,'' {\it International Journal of Computer
Mathematics}, {\bf18}:313.",
}
#S# I[ 3/W!57E;?+!Ec/Wmarticledatacompression.bibCormack:1985:DCDGordon V. CormackData compression on a database systemjCACM281213361342dec121985CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Thu May 30 09:41:10 MDT 1996ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/cacm198ʉ!HU 3'![377E};g!_5articledatacompression.bibCole:1985:NPPA. J. ColeA Note on Peano Polygons and Gn on a database system",
journal = jCACM,
volume = "28",
number = "12",
pages = "13361342",
month = dec,
year = "1985",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/00010782/214963.html",
acknowledgement = acknhfb,
annote = "first partition into IMS based types, then Huffman.
Gives factor two space, adds 17pct time.",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "design; IMS compression one (entire) record at a
time.; management; performance",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf H.2.0}: Information
Systems, DATABASE MANAGEMENT, General.",
}0.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1996.05.30 09:41:10 MDThttp://www.acm.org/pubs/toc/Abstracts/00010782/214963.htmlCommunications of the ACMdesign; IMS compression one (entire) record at a time.; management; performancebf E.4: Data, CODING AND INFORMATION THEORY, Data compaction and compression. bf H.2.0: Information Systems, DATABASE MANAGEMENT, General.acknhfbfirst partition into IMS based types, then Huffman. Gives factor two space, adds 17pct time.http://portal.acm.org/browse_dl.cfm?idx=J79Gordon V. CormackData compression on a database system
@Article{Cormack:1985:DCD,
author = "Gordon V. Cormack",
title = "Data compression on a database system",
journal = jCACM,
volume = "28",
number = "12",
pages = "13361342",
month = dec,
year = "1985",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/00010782/214963.html",
acknowledgement = acknhfb,
annote = "first partition into IMS based types, then Huffman.
Gives factor two space, adds 17pct time.",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "design; IMS compression one (entire) record at a
time.; management; performance",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf H.2.0}: Information
Systems, DATABASE MANAGEMENT, General.",
}sed Data Structure for Surface
Representation",
journal = jCGF,
volume = "4",
number = "3",
pages = "217228",
month = sep,
year = "1985",
CODEN = "CGFODY",
ISSN = "01677055 (print), 14678659 (electronic)",
ISSNL = "01677055",
bibdate = "Mon Apr 14 10:23:20 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
affiliation = "Univ of Glasgow, Computing Science Dep, Glasgow,
Scotl",
affiliationaddress = "Univ of Glasgow, Computing Science Dep, Glasgow,
Scotl",
classification = "723; 741; 921; C6120 (File organisation); C6130B
(Graphics techniques)",
conflocation = "Bath, UK; 2829 March 1985",
conftitle = "EUROGRAPHICS (UK) Conference",
corpsource = "Dept. of Comput. Sci., Glasgow Univ., UK",
fjournal = "Com{\}pu{\}ter Graphics Forum",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)14678659/",
keywords = "compressed data structure; compressed data structure
(CDS); computer graphics; computer graphics  Imaging
Techniques; constructive solid; data compression; data
processing; data structures; Data Structures; data
structures; facets; facets, design; geometrical
information; geometry; high curvature; image
processing; modelling; photometry information;
polyhedron; ray casting; sculptured surface; shaded
image; smooth image; solid object; solids 
Mathematical Models; surface patches; surface
representation; surfaces  Mathematical Models;
topological information; vertices",
subject = "I.3 Computing Methodologies, COMPUTER GRAPHICS,
Miscellaneous \\ I.3.5 Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Curve, surface, solid, and object
representations",
treatment = "P Practical",
}n; ray casting; sculptured surface; shaded image; smooth image; solid object; solids  Mathematical Models; surface patches; surface representation; surfaces  Mathematical Models; topological information; verticesI.3 Computing Methodologies, COMPUTER GRAPHICS, Miscellaneous I.3.5 Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Curve, surface, solid, and object representationsacknhfbUniv of Glasgow, Computing Science Dep, Glasgow, ScotlUniv of Glasgow, Computing Science Dep, Glasgow, ScotlDept. of Comput. Sci., Glasgow Univ., UKhttp://onlinelibrary.wiley.com/journal/10.1111/(ISSN)14678659/P PracticalMarion S. CottinghamA Compressed Data Structure for Surface Representation
@Article{Cottingham:1985:CDS,
author = "Marion S. Cottingham",
title = "A Compressed Data Structure for Surface
Representation",
journal = jCGF,
volume = "4",
number = "3",
pages = "217228",
month = sep,
year = "1985",
CODEN = "CGFODY",
ISSN = "01677055 (print), 14678659 (electronic)",
ISSNL = "01677055",
bibdate = "Mon Apr 14 10:23:20 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
affiliation = "Univ of Glasgow, Computing Science Dep, Glasgow,
Scotl",
affiliationaddress = "Univ of Glasgow, Computing Science Dep, Glasgow,
Scotl",
classification = "723; 741; 921; C6120 (File organisation); C6130B
(Graphics techniques)",
conflocation = "Bath, UK; 2829 March 1985",
conftitle = "EUROGRAPHICS (UK) Conference",
corpsource = "Dept. of Comput. Sci., Glasgow Univ., UK",
fjournal = "Com{\}pu{\}ter Graphics Forum",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)14678659/",
keywords = "compressed data structure; compressed data structure
(CDS); computer graphics; computer graphics  Imaging
Techniques; constructive solid; data compression; data
processing; data structures; Data Structures; data
structures; facets; facets, design; geometrical
information; geometry; high curvature; image
processing; modelling; photometry information;
polyhedron; ray casting; sculptured surface; shaded
image; smooth image; solid object; solids 
Mathematical Models; surface patches; surface
representation; surfaces  Mathematical Models;
topological information; vertices",
subject = "I.3 Computing Methodologies, COMPUTER GRAPHICS,
Miscellaneous \\ I.3.5 Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Curve, surface, solid, and object
representations",
treatment = "P Practical",
}
NJZ 335y57E%;;'yy]#5yGarticledatacompression.bibCottingham:1985:CDSMarion S. CottinghamA Compressed Data Structure for Surface RepresentationjCGF43217228sep91985CGFODY01677055 (print), 14678659 (electronic) OR 01677055 (print), 14678659 (electronic)01677055 OR 01677055Mon Apr 14 10:23:20 MDT 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.04.14 10:23:20 MDTComputer Graphics Forumcompressed data structure; compressed data structure (CDS); computer graphics; computer graphics  Imaging Techniques; constructive solid; data compression; data processing; data structures; Data Structures; data structures; facets; facets, design; geometrical information; geometry; high curvature; image processing; modelling; photometry information; polyhedrotle = "Construction of Fractal Objects with Iterated Function
Systems",
journal = jCOMPUTERSANDGRAPHICS,
volume = "19",
number = "3",
pages = "271278",
month = jul,
year = "1985",
CODEN = "CGRADI, CPGPBZ",
ISSN = "00978930 (print), 15584569 (electronic)",
ISSNL = "00978930",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Graphics/imager/imager.85.bib; http://portal.acm.org/;
http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds # " and " # acknhfb,
conference = "held in San Francisco, CA; 2226 July 1985",
fjournal = "Computer Graphics",
journalURL = "http://www.sciencedirect.com/science/journal/00978493",
keywords = "I35 fractals, I35 iterative methods, I35 geometric
modeling",
rawdata = "Demko, S., L. Hodges, and B. Naylor (1985)
``Construction of Fractal Objects with Iterated
Function Systems,'' {\it Computer Graphics},
{\bf19}(3):271278, July.",
} Bruce NaylorConstruction of Fractal Objects with Iterated Function SystemsjCOMPUTERSANDGRAPHICS193271278jul71985CGRADI, CPGPBZ00978930 (print), 15584569 (electronic) OR 00978930 (print), 15584569 (electronic)00978930 OR 00978930Sat Jan 26 12:46:16 MST 2013Graphics/imager/imager.85.bib; http://portal.acm.org/; http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTComputer GraphicsI35 fractals, I35 iterative methods, I35 geometric modelingackdshttp://www.sciencedirect.com/science/journal/00978493Stephen Demko and Laurie Hodges and Bruce NaylorConstruction of Fractal Objects with Iterated Function Systems
@Article{Demko:1985:CFO,
author = "Stephen Demko and Laurie Hodges and Bruce Naylor",
title = "Construction of Fractal Objects with Iterated Function
Systems",
journal = jCOMPUTERSANDGRAPHICS,
volume = "19",
number = "3",
pages = "271278",
month = jul,
year = "1985",
CODEN = "CGRADI, CPGPBZ",
ISSN = "00978930 (print), 15584569 (electronic)",
ISSNL = "00978930",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Graphics/imager/imager.85.bib; http://portal.acm.org/;
http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds # " and " # acknhfb,
conference = "held in San Francisco, CA; 2226 July 1985",
fjournal = "Computer Graphics",
journalURL = "http://www.sciencedirect.com/science/journal/00978493",
keywords = "I35 fractals, I35 iterative methods, I35 geometric
modeling",
rawdata = "Demko, S., L. Hodges, and B. Naylor (1985)
``Construction of Fractal Objects with Iterated
Function Systems,'' {\it Computer Graphics},
{\bf19}(3):271278, July.",
}
QLX 3+7q%C7;e97uphdthesisdatacompression.bibFoulds:1985:DRTRichard Arthur FouldsA Data Reduction Technique for Minimum Bandwidth Transmission of Intelligible American Sign Language for the Deaf (Compression, Telecommunications, Communication, Rehabilitation)Ph.D. thesisTufts UniversityMedford, MA, USA2151985Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/303423885Engineering; AudiologyacknhfbRichard Arthur FouldsA Data Reduction Technique for Minimum Bandwidth TّKZ3)m =)57Eu;/wm karticledatacompression.bibDemko:1985:CFOStephen Demko and Laurie Hodges anduction Technique for Minimum Bandwidth
Transmission of Intelligible {American Sign Language}
for the Deaf (Compression, Telecommunications,
Communication, Rehabilitation)",
type = "{Ph.D.} thesis",
school = "Tufts University",
address = "Medford, MA, USA",
pages = "215",
year = "1985",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303423885",
acknowledgement = acknhfb,
classification = "0300: Audiology; 0537: Engineering",
dissertationthesisnumber = "8602315",
subject = "Engineering; Audiology",
}ransmission of Intelligible {American Sign Language} for the Deaf (Compression, Telecommunications, Communication, Rehabilitation)
@PhdThesis{Foulds:1985:DRT,
author = "Richard Arthur Foulds",
title = "A Data Reduction Technique for Minimum Bandwidth
Transmission of Intelligible {American Sign Language}
for the Deaf (Compression, Telecommunications,
Communication, Rehabilitation)",
type = "{Ph.D.} thesis",
school = "Tufts University",
address = "Medford, MA, USA",
pages = "215",
year = "1985",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303423885",
acknowledgement = acknhfb,
classification = "0300: Audiology; 0537: Engineering",
dissertationthesisnumber = "8602315",
subject = "Engineering; Audiology",
} "A. Apostolico and Z. Galil",
booktitle = "Combinatorial Algorithms on Words",
title = "Novel Compression of Sparse BitStringsPreliminary
Report",
volume = "12",
publisher = pubSV,
address = pubSV:adr,
pages = "169183",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "NATO ASI Series F",
acknowledgement = ackds,
rawdata = "Fraenkel, A. S., and S. T. Klein (1985) ``Novel
Compression of Sparse BitStringsPreliminary
Report,'' in A. Apostolico and Z. Galil, eds. {\it
Combinatorial Algorithms on Words}, Vol. 12, NATO ASI
Series F:169183, New York, SpringerVerlag.",
}lico and Z. GalilNovel Compression of Sparse BitStringsPreliminary Report
@InCollection{Fraenkel:1985:NCS,
author = "A. S. Fraenkel and S. T. Klein",
editor = "A. Apostolico and Z. Galil",
booktitle = "Combinatorial Algorithms on Words",
title = "Novel Compression of Sparse BitStringsPreliminary
Report",
volume = "12",
publisher = pubSV,
address = pubSV:adr,
pages = "169183",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "NATO ASI Series F",
acknowledgement = ackds,
rawdata = "Fraenkel, A. S., and S. T. Klein (1985) ``Novel
Compression of Sparse BitStringsPreliminary
Report,'' in A. Apostolico and Z. Galil, eds. {\it
Combinatorial Algorithms on Words}, Vol. 12, NATO ASI
Series F:169183, New York, SpringerVerlag.",
}
88NX!3/Q

+E};Q
techreportdatacompression.bibFraenkel:1985:RUCA. S. Fraenkel and Shmuel T. KleinRobust Universal Complete Codes as Alternatives to Huffman CodesTechnical ReportCS8516Department of Applied Mathematics, Weizmann Institute of ScienceRehovot, Israeloct101985Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.ތMW%3/IAO!E};/IOAkincollectiondatacompression.bibFraenkel:1985:NCSA. S. Fraenkel and S. T. KleinA. Apostolico and Z. GalilCombinatorial Algorithms on WordsNovel Compression of Sparse BitStringsPreliminary Report12pubSVpubSV:adr1691831985Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTNATO ASI Series FackdsA. S. Fraenkel and S. T. KleinCombinatorial Algorithms on WordsA. Aposto "Robust Universal Complete Codes as Alternatives to
{Huffman} Codes",
type = "Technical Report",
number = "CS8516",
institution = "Department of Applied Mathematics, Weizmann Institute
of Science",
address = "Rehovot, Israel",
pages = "??",
month = oct,
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Fraenkel, A. S. and Shmuel T. Klein (1985a) ``Robust
Universal Complete Codes as Alternatives to Huffman
Codes,'' Tech. Report CS8516, Dept. of Applied
Mathematics, Weizmann Institute of Science, October.",
}01.26 12:46:16 MSTackdsA. S. Fraenkel and Shmuel T. KleinRobust Universal Complete Codes as Alternatives to {Huffman} Codes
@TechReport{Fraenkel:1985:RUC,
author = "A. S. Fraenkel and Shmuel T. Klein",
title = "Robust Universal Complete Codes as Alternatives to
{Huffman} Codes",
type = "Technical Report",
number = "CS8516",
institution = "Department of Applied Mathematics, Weizmann Institute
of Science",
address = "Rehovot, Israel",
pages = "??",
month = oct,
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Fraenkel, A. S. and Shmuel T. Klein (1985a) ``Robust
Universal Complete Codes as Alternatives to Huffman
Codes,'' Tech. Report CS8516, Dept. of Applied
Mathematics, Weizmann Institute of Science, October.",
}of Data Compression Techniques and Their
Application to {VSPC} Data Sets",
type = "{M.Sc.C.S.}",
school = "The University of New Brunswick",
address = "Fredericton, NB, Canada",
pages = "????",
year = "1985",
ISBN = "031523105X",
ISBN13 = "9780315231054",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303433066",
acknowledgement = acknhfb,
classification = "0399: Library science",
dissertationthesisnumber = "ML23105",
subject = "Library science",
}tp://search.proquest.com/docview/303433066Library scienceacknhfbJeffrey Keefe FryerA Survey of Data Compression Techniques and Their Application to {VSPC} Data Sets
@MastersThesis{Fryer:1985:SDC,
author = "Jeffrey Keefe Fryer",
title = "A Survey of Data Compression Techniques and Their
Application to {VSPC} Data Sets",
type = "{M.Sc.C.S.}",
school = "The University of New Brunswick",
address = "Fredericton, NB, Canada",
pages = "????",
year = "1985",
ISBN = "031523105X",
ISBN13 = "9780315231054",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303433066",
acknowledgement = acknhfb,
classification = "0399: Library science",
dissertationthesisnumber = "ML23105",
subject = "Library science",
}
mOX '3)3+K;CQC7;e+3/;mastersthesisdatacompression.bibFryer:1985:SDCJeffrey Keefe FryerA Survey of Data Compression Techniques and Their Application to VSPC Data SetsM.Sc.C.S.The University of New BrunswickFredericton, NB, Canada1985031523105X OR 031523105X9780315231054 OR 9780315231054Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThtle = "Parallel Algorithms for Data Compression",
journal = jJACM,
volume = "32",
number = "2",
pages = "344373",
month = apr,
year = "1985",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Wed Jan 15 18:12:53 MST 1997",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jacm.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/00045411/3152.html",
abstract = "Parallel algorithms for data compression by textual
substitution that are suitable for VLSI implementation
are studied. Both `static' and `dynamic' dictionary
schemes are considered.",
acknowledgement = acknhfb,
affiliationaddress = "Brandeis Univ, Waltham, MA, USA",
classification = "723",
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "Algorithms; algorithms; computer programming; computer
systems, digital  Parallel Processing; data
compression; image information; parallel algorithms;
statistics; theory; verification; VLSI",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf B.7.1}: Hardware,
INTEGRATED CIRCUITS, Types and Design Styles, VLSI
(very large scale integration). {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf
G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS,
General, Parallel algorithms. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Computations on discrete structures. {\bf F.2.2}:
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Pattern matching. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout.",
}uter programming; computer systems, digital  Parallel Processing; data compression; image information; parallel algorithms; statistics; theory; verification; VLSIbf E.4: Data, CODING AND INFORMATION THEORY, Data compaction and compression. bf B.7.1: Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration). bf F.2.2: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. bf G.1.0: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms. bf F.2.2: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. bf F.2.2: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. bf F.2.2: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout.acknhfbBrandeis Univ, Waltham, MA, USAhttp://portal.acm.org/browse_dl.cfm?idx=J401J Assoc Comput MachParallel algorithms for data compression by textual substitution that are suitable for VLSI implementation are studied. Both `static' and `dynamic' dictionary schemes are considered.M. E. {Gonzalez Smith} and J. A. StorerParallel Algorithms for Data Compression
@Article{GonzalezSmith:1985:PAD,
author = "M. E. {Gonzalez Smith} and J. A. Storer",
title = "Parallel Algorithms for Data Compression",
journal = jJACM,
volume = "32",
number = "2",
pages = "344373",
month = apr,
year = "1985",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Wed Jan 15 18:12:53 MST 1997",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jacm.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/00045411/3152.html",
abstract = "Parallel algorithms for data compression by textual
substitution that are suitable for VLSI implementation
are studied. Both `static' and `dynamic' dictionary
schemes are considered.",
acknowledgement = acknhfb,
affiliationaddress = "Brandeis Univ, Waltham, MA, USA",
classification = "723",
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "Algorithms; algorithms; computer programming; computer
systems, digital  Parallel Processing; data
compression; image information; parallel algorithms;
statistics; theory; verification; VLSI",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf B.7.1}: Hardware,
INTEGRATED CIRCUITS, Types and Design Styles, VLSI
(very large scale integration). {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf
G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS,
General, Parallel algorithms. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Computations on discrete structures. {\bf F.2.2}:
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Pattern matching. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout.",
}
ooyP[39W]57Ey;yqgKe3y[]sarticledatacompression.bibGonzalezSmith:1985:PADM. E. Gonzalez Smith and J. A. StorerParallel Algorithms for Data CompressionjJACM322344373apr41985JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 00045411Wed Jan 15 18:12:53 MST 1997Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib1997.01.15 18:12:53 MSThttp://www.acm.org/pubs/toc/Abstracts/00045411/3152.htmlParallel algorithms for data compression by textual substitution that are suitable for VLSI implementation are studied. Both `static' and `dynamic' dictionary schemes are considered.Journal of the Association for Computing MachineryAlgorithms; algorithms; comp}: {IEEE} Standard for
Binary FloatingPoint Arithmetic.",
pages = "??",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "IEEE754 (1985) ANSI/IEEE Standard 7541985, ``IEEE
Standard for Binary FloatingPoint Arithmetic.''",
}
TT(QW 3E};5miscdatacompression.bibIEEE754:1985:ISBIEEE754ANSI/IEEE Standard 7541985: IEEE Standard for Binary FloatingPoint Arithmetic.1985Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsIEEE754{ANSI/IEEE Standard 7541985}: {IEEE} Standard for Binary FloatingPoint Arithmetic.
@Misc{IEEE754:1985:ISB,
author = "IEEE754",
title = "{ANSI/IEEE Standard 7541985}: {IEEE} Standard for
Binary FloatingPoint Arithmetic.",
pages = "??",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "IEEE754 (1985) ANSI/IEEE Standard 7541985, ``IEEE
Standard for Binary FloatingPoint Arithmetic.''",
}Character Strings by an Adaptive
Dictionary",
journal = jBIT,
volume = "25",
number = "4",
pages = "593603",
month = dec,
year = "1985",
CODEN = "BITTEL, NBITAB",
DOI = "http://dx.doi.org/10.1007/BF01936138",
ISSN = "00063835 (print), 15729125 (electronic)",
ISSNL = "00063835",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=00063835&volume=25&issue=4;
http://www.math.utah.edu/pub/tex/bib/bit.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=00063835&volume=25&issue=4&spage=593",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "BIT (Nordisk tidskrift for informationsbehandling)",
journalURL = "http://link.springer.com/journal/10543",
rawdata = "Jakobsson, Matti (1985) ``Compression of Character
Strings by an Adaptive Dictionary,'' {\it BIT},
{\bf25}(4):593603, december.",
}:1985:CCSMatti JakobssonCompression of Character Strings by an Adaptive DictionaryjBIT254593603dec121985BITTEL, NBITABhttp://dx.doi.org/10.1007/BF0193613800063835 (print), 15729125 (electronic) OR 00063835 (print), 15729125 (electronic)00063835 OR 00063835Sat Jan 26 12:46:16 MST 2013http://springerlink.metapress.com/openurl.asp?genre=issue&issn=00063835&volume=25&issue=4; http://www.math.utah.edu/pub/tex/bib/bit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSThttp://www.springerlink.com/openurl.asp?genre=article&issn=00063835&volume=25&issue=4&spage=593BIT (Nordisk tidskrift for informationsbehandling)ackdshttp://link.springer.com/journal/10543Matti JakobssonCompression of Character Strings by an Adaptive Dictionary
@Article{Jakobsson:1985:CCS,
author = "Matti Jakobsson",
title = "Compression of Character Strings by an Adaptive
Dictionary",
journal = jBIT,
volume = "25",
number = "4",
pages = "593603",
month = dec,
year = "1985",
CODEN = "BITTEL, NBITAB",
DOI = "http://dx.doi.org/10.1007/BF01936138",
ISSN = "00063835 (print), 15729125 (electronic)",
ISSNL = "00063835",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=00063835&volume=25&issue=4;
http://www.math.utah.edu/pub/tex/bib/bit.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=00063835&volume=25&issue=4&spage=593",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "BIT (Nordisk tidskrift for informationsbehandling)",
journalURL = "http://link.springer.com/journal/10543",
rawdata = "Jakobsson, Matti (1985) ``Compression of Character
Strings by an Adaptive Dictionary,'' {\it BIT},
{\bf25}(4):593603, december.",
}
;z;TZ3/]})57E%;?5c]articledatacompression.bibMcIntyre:1985:DCUDavid R. McIntyre and Michael A. PechuraData compression using static Huffman codedecode tablesjCACM286Cleveland St U612616jun61985CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Thu May 30 09SX 3)+9i57'E;71Ww+=articledatacompression.bibKnuth:1985:DHCDonald E. KnuthDynamic Huffman CodinvRZ 31+)U57E;MqY+yarticledatacompression.bibJakobssonoding",
journal = jJALG,
volume = "6",
number = "2",
pages = "163180",
month = jun,
year = "1985",
CODEN = "JOALDV",
DOI = "http://dx.doi.org/10.1016/01966774(85)900367",
ISSN = "01966774 (print), 10902678 (electronic)",
ISSNL = "01966774",
MRclass = "94B45 (94A24)",
MRnumber = "86g:94050",
MRreviewer = "T. Nemetz",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jalg.bib;
MathSciNet database",
URL = "http://www.sciencedirect.com/science/article/pii/0196677485900367",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Journal of Algorithms",
journalURL = "http://www.sciencedirect.com/science/journal/01966774",
keywords = "algorithms; theory",
rawdata1 = "Knuth, Donald E. (1985) ``Dynamic Huffman Coding,''
{\it Journal of Algorithms}, {\bf6}:163180.",
rawdata2 = "Knuth, D. E. (1985) ``Dynamic Huffman Coding,'' {\it
Journal of Algorithms} {\bf6}:163180.",
review = "ACM CR 86100919",
subject = "E Data, Coding and Information Theory",
}gjJALG62163180jun61985JOALDVhttp://dx.doi.org/10.1016/01966774(85)90036701966774 (print), 10902678 (electronic) OR 01966774 (print), 10902678 (electronic)01966774 OR 0196677494B45 (94A24)86g:94050T. NemetzSat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jalg.bib; MathSciNet database2013.01.26 12:46:16 MSThttp://www.sciencedirect.com/science/article/pii/0196677485900367Journal of Algorithmsalgorithms; theoryE Data, Coding and Information Theoryackdshttp://www.sciencedirect.com/science/journal/01966774Donald E. KnuthDynamic {Huffman} Coding
@Article{Knuth:1985:DHC,
author = "Donald E. Knuth",
title = "Dynamic {Huffman} Coding",
journal = jJALG,
volume = "6",
number = "2",
pages = "163180",
month = jun,
year = "1985",
CODEN = "JOALDV",
DOI = "http://dx.doi.org/10.1016/01966774(85)900367",
ISSN = "01966774 (print), 10902678 (electronic)",
ISSNL = "01966774",
MRclass = "94B45 (94A24)",
MRnumber = "86g:94050",
MRreviewer = "T. Nemetz",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jalg.bib;
MathSciNet database",
URL = "http://www.sciencedirect.com/science/article/pii/0196677485900367",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Journal of Algorithms",
journalURL = "http://www.sciencedirect.com/science/journal/01966774",
keywords = "algorithms; theory",
rawdata1 = "Knuth, Donald E. (1985) ``Dynamic Huffman Coding,''
{\it Journal of Algorithms}, {\bf6}:163180.",
rawdata2 = "Knuth, D. E. (1985) ``Dynamic Huffman Coding,'' {\it
Journal of Algorithms} {\bf6}:163180.",
review = "ACM CR 86100919",
subject = "E Data, Coding and Information Theory",
} "Data compression using static {Huffman} codedecode
tables",
journal = jCACM,
volume = "28",
number = "6",
institution = "Cleveland St U",
pages = "612616",
month = jun,
year = "1985",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib;
http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/00010782/3815.html",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; experimentation; image information;
measurement; performance; statistics",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf D.3.m}: Software,
PROGRAMMING LANGUAGES, Miscellaneous.",
}:41:10 MDT 1996ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1996.05.30 09:41:10 MDThttp://www.acm.org/pubs/toc/Abstracts/00010782/3815.htmlCommunications of the ACMalgorithms; experimentation; image information; measurement; performance; statisticsbf E.4: Data, CODING AND INFORMATION THEORY, Data compaction and compression. bf D.3.m: Software, PROGRAMMING LANGUAGES, Miscellaneous.acknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79David R. McIntyre and Michael A. PechuraData compression using static {Huffman} codedecode tables
@Article{McIntyre:1985:DCU,
author = "David R. McIntyre and Michael A. Pechura",
title = "Data compression using static {Huffman} codedecode
tables",
journal = jCACM,
volume = "28",
number = "6",
institution = "Cleveland St U",
pages = "612616",
month = jun,
year = "1985",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib;
http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/00010782/3815.html",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; experimentation; image information;
measurement; performance; statistics",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf D.3.m}: Software,
PROGRAMMING LANGUAGES, Miscellaneous.",
} "A. Apostolico and Z. Galil",
booktitle = "Combinatorial Algorithms on Words",
title = "Variations On a Theme by {Ziv} and {Lempel}",
volume = "F12",
publisher = pubSV,
address = pubSV:adr,
pages = "131140",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "NATO ASI series",
acknowledgement = ackds,
bookpages = "????",
rawdata = "Miller, V. S., and M. N. Wegman (1985) ``Variations On
a Theme by Ziv and Lempel,'' in A. Apostolico and Z.
Galil, eds., NATO ASI series Vol. F12, {\it
Combinatorial Algorithms on Words}, Berlin, Springer,
pp. 131140.",
}d M. N. WegmanCombinatorial Algorithms on WordsA. Apostolico and Z. GalilVariations On a Theme by {Ziv} and {Lempel}
@InProceedings{Miller:1985:VTZ,
author = "V. S. Miller and M. N. Wegman",
editor = "A. Apostolico and Z. Galil",
booktitle = "Combinatorial Algorithms on Words",
title = "Variations On a Theme by {Ziv} and {Lempel}",
volume = "F12",
publisher = pubSV,
address = pubSV:adr,
pages = "131140",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "NATO ASI series",
acknowledgement = ackds,
bookpages = "????",
rawdata = "Miller, V. S., and M. N. Wegman (1985) ``Variations On
a Theme by Ziv and Lempel,'' in A. Apostolico and Z.
Galil, eds., NATO ASI series Vol. F12, {\it
Combinatorial Algorithms on Words}, Berlin, Springer,
pp. 131140.",
}
DD0UU'3+GAO[!E};+GOAc
inproceedingsdatacompression.bibMiller:1985:VTZV. S. Miller and M. N. WegmanA. Apostolico and Z. GalilCombinatorial Algorithms on WordsVariations On a Theme by Ziv and LempelF12pubSVpubSV:adr1311401985Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTNATO ASI seriesackdsV. S. Miller anAudio",
publisher = pubSAMS,
address = pubSAMS:adr,
pages = "??",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Pohlmann, Ken (1985) {\it Principles of Digital
Audio}, Indianapolis, IN, Howard Sams \& Co.",
}
~;a~A
@Article{Wiseman:2001:CEC,
author = "Yair Wiseman and Erick Fredj",
title = lY
@Article{Weinberger:2000:LLI,
author = "M. J. Weinberger and G. Seroussi and G. Sapiro",
title = N
@Article{Welch:1984:THP,
author = "Terry A. Welch",
title = "A Technique for High1
@Article{Wei:2014:NEA,
author = "Qingting Wei and Jihong Guan and Shuigeng Zhou and Xin
&I
@Article{Wennersten:2009:TVT,
author = "Per Wennersten and Jacob Str{\"o}m",
title =
@Article{Wegener:1992:RDC,
author = "Al Wegener",
title = "Review of {{\em Data C@
@Article{White:1987:CID,
author = "Ronald G. White",
title = "Compressing Image DΑ]=
@Article{Wells:1972:FCU,
author = "M. Wells",
title = "File Compression Using Variable Length Encodings",
journal = jCOMPJ,
volume = "15",
number = "4",
pages = "308313",
FVU 3/%C%E};%Cqbookdatacompression.bibPohlmann:1985:PDAKen PohlmannPrinciples of Digital AudiopubSAMSpubSAMS:adr1985Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsKen PohlmannPrinciples of Digital Audio
@Book{Pohlmann:1985:PDA,
author = "Ken Pohlmann",
title = "Principles of Digital Audio",
publisher = pubSAMS,
address = pubSAMS:adr,
pages = "??",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Pohlmann, Ken (1985) {\it Principles of Digital
Audio}, Indianapolis, IN, Howard Sams \& Co.",
}antization of Images Based on a Composite
Source Model (Coding, Data Compression, Picture)",
type = "{Ph.D.} thesis",
school = "University of California, Santa Barbara",
address = "Santa Barbara, USA",
pages = "377",
year = "1985",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303336232",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8605950",
subject = "Electrical engineering",
}ression.bib2013.02.01 08:42:55 MSThttp://search.proquest.com/docview/303336232Electrical engineeringacknhfbBhaskar RamamurthiVector Quantization of Images Based on a Composite Source Model (Coding, Data Compression, Picture)
@PhdThesis{Ramamurthi:1985:VQI,
author = "Bhaskar Ramamurthi",
title = "Vector Quantization of Images Based on a Composite
Source Model (Coding, Data Compression, Picture)",
type = "{Ph.D.} thesis",
school = "University of California, Santa Barbara",
address = "Santa Barbara, USA",
pages = "377",
year = "1985",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303336232",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8605950",
subject = "Electrical engineering",
}
,K,YZ 3)#57=%;?[c#%articledatac$XV 3'K77Ea;w'UOarticledatacompression.bibRokicki:1985:PPFTomas RokickiPacked (tt PK) Font File FormatjTUGboat63115120nov11198508963207 OR 0896320708963207 OR 08963207Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/tugboat.bib2013.01.26 12:46:16 MSThttp://www.tug.org/TUGbo)WX 331S%[1C7;e91SCphdthesisdatacompression.bibRamamurthi:1985:VQIBhaskar RamamurthiVector Quantization of Images Based on a Composite Source Model (Coding, Data Compression, Picture)Ph.D. thesisUniversity of California, Santa BarbaraSanta Barbara, USA3771985Fri Feb 1 08:42:55 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacomp Font File Format",
journal = jTUGboat,
volume = "6",
number = "3",
pages = "115120",
month = nov,
year = "1985",
CODEN = "????",
ISSN = "08963207",
ISSNL = "08963207",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/tugboat.bib",
URL = "http://www.tug.org/TUGboat/Articles/tb063/tb13pk.pdf",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "TUGboat",
rawdata = "Rokicki, Tomas (1985) ``Packed (PK) Font File
Format,'' {\it TUGboat}, {\bf6}(3):115120. Available
at
http://www.tug.org/TUGboat/Articles/tb063/tb13pk.pdf.",
}at/Articles/tb063/tb13pk.pdfTUGboatackdsTomas RokickiPacked ({{\tt PK}}) Font File Format
@Article{Rokicki:1985:PPF,
author = "Tomas Rokicki",
title = "Packed ({{\tt PK}}) Font File Format",
journal = jTUGboat,
volume = "6",
number = "3",
pages = "115120",
month = nov,
year = "1985",
CODEN = "????",
ISSN = "08963207",
ISSNL = "08963207",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/tugboat.bib",
URL = "http://www.tug.org/TUGboat/Articles/tb063/tb13pk.pdf",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "TUGboat",
rawdata = "Rokicki, Tomas (1985) ``Packed (PK) Font File
Format,'' {\it TUGboat}, {\bf6}(3):115120. Available
at
http://www.tug.org/TUGboat/Articles/tb063/tb13pk.pdf.",
}dtree approximation and
compression",
journal = jCACM,
volume = "28",
number = "9",
institution = "U Md",
pages = "973993",
month = sep,
year = "1985",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Mon Jan 27 13:21:19 1997",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/84.bib;
http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/00010782/4290.html",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; image approximation; theory",
subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf E.4}:
Data, CODING AND INFORMATION THEORY, Data compaction
and compression. {\bf I.2.10}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Vision and Scene
Understanding, Representations, data structures, and
transforms. {\bf I.4.2}: Computing Methodologies, IMAGE
PROCESSING, Compression (Coding), Approximate methods.
{\bf I.4.2}: Computing Methodologies, IMAGE PROCESSING,
Compression (Coding), Exact coding.",
}
&Lr+
@Article{Wu:2002:DRT,
author = "HsienChu Wu and ChinChen Chang",
title = "Detec
@Article{Wu:1982:ABA,
author = "J. K. Wu and R. E. Burge",
title = "Adaptive Bit `5k
@Article{Woolley:1994:RDP,
author = "Stuart J. Woolley and Donald M. Monro",
title =
TX1
@Article{Wood:1994:GDC,
author = "Christopher M. Wood",
title = "General data com
Q;w
@Article{Wong:1993:FWT,
author = "KwoJyr Wong and C. C. Jay Kuo",
title = "A Ful}{
@Article{Wong:1992:CCT,
author = "P. W. Wong and J. Koplowitz",
title = "Chain CoaC
@Article{Wolff:1999:PRI,
author = "J. G. Wolff",
title = "Probabilistic Reasoning&!C
@Article{Wolff:1999:CIC,
author = "G. Wolff",
title = "Computing as Information C"V
@Article{Witten:1994:TIC,
author = "Ian H. Witten and T. C. Bell and H. Emberson and S.
MVC<8V}{
@Article{Ferragina:2011:OPT,
author = "Paolo Ferragina and Igor Nitto and Rossano Venturin#$[^=
@Article{Federovsky:1998:BPB,
author = "Eitan Federovsky and Meir Feder and Sholomo Weiss"^
@Article{Ernvall:1984:ELM,
author = "J. Ernvall and O. Nevalainen",
title = "Estimating the length of minimal spannڈ6m
@Article{DiazGutierrez:2005:GIH,
author = "Pablo DiazGutierrez and M. Gopi and Renato Pae5k
@Article{DeAgostino:1994:PCP,
author = "Sergio {De Agostino}",
title = "{P}compl R$S4k
@Article{Dance:1976:ALD,
author = "D. L. Dance and U. W. Pooch",
title = "An adap;
@Article{Duvanenko:1988:ICC,
author = "Victor J. Duvanenko",
title = "Image compru@
@Article{Delfino:1993:PMI,
author = "Erik Delfino",
title = "{PC} Monitor  The! ompression.bibSamet:1985:DSQHanan SametData structures for quadtree approximation and compressionjCACM289U Md973993sep91985CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Mon Jan 27 13:21:19 1997ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/84.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.01.27 13:21:19 ???http://www.acm.org/pubs/toc/Abstracts/00010782/4290.htmlCommunications of the ACMalgorithms; image approximation; theorybf E.1: Data, DATA STRUCTURES, Trees. bf E.4: Data, CODING AND INFORMATION THEORY, Data compaction and compression. bf I.2.10: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Vision and Scene Understanding, Representations, data structures, and transforms. bf I.4.2: Computing Methodologies, IMAGE PROCESSING, Compression (Coding), Approximate m
ethods. bf I.4.2: Computing Methodologies, IMAGE PROCESSING, Compression (Coding), Exact coding.acknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Hanan SametData structures for quadtree approximation and compression
@Article{Samet:1985:DSQ,
author = "Hanan Samet",
title = "Data structures for quadtree approximation and
compression",
journal = jCACM,
volume = "28",
number = "9",
institution = "U Md",
pages = "973993",
month = sep,
year = "1985",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Mon Jan 27 13:21:19 1997",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/84.bib;
http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/00010782/4290.html",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; image approximation; theory",
subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf E.4}:
Data, CODING AND INFORMATION THEORY, Data compaction
and compression. {\bf I.2.10}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Vision and Scene
Understanding, Representations, data structures, and
transforms. {\bf I.4.2}: Computing Methodologies, IMAGE
PROCESSING, Compression (Coding), Approximate methods.
{\bf I.4.2}: Computing Methodologies, IMAGE PROCESSING,
Compression (Coding), Exact coding.",
}fferent Methods Based on the {KarhunenLoeve}
Expansion and Used in Image Analysis",
journal = jCVGIP,
volume = "29",
number = "2",
pages = "259269",
month = feb,
year = "1985",
CODEN = "CVGPDB",
ISSN = "0734189X",
ISSNL = "0734189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database; Graphics/rosenfeld/1985.bib;
http://www.math.utah.edu/pub/tex/bib/cvgip.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
affiliation = "U London",
affiliationaddress = "Queen Elizabeth Coll, Dep of Physics, London,
Engl",
classification = "716; 718; 723",
fjournal = "Computer Vision, Graphics, and Image Processing",
journalURL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "data compression; eigendata problem; image analysis;
image processing; image transformation, space
frequency, digital; KarhunenLoeve expansion; pattern
recognition; signal processing",
}9XThu Feb 6 18:44:11 MST 1997Compendex database; Graphics/rosenfeld/1985.bib; http://www.math.utah.edu/pub/tex/bib/cvgip.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.02.06 18:44:11 MSTComputer Vision, Graphics, and Image Processingdata compression; eigendata problem; image analysis; image processing; image transformation, space frequency, digital; KarhunenLoeve expansion; pattern recognition; signal processingacknhfbU LondonQueen Elizabeth Coll, Dep of Physics, London, Englhttp://www.sciencedirect.com/science/journal/0734189XComput Vision Graphics Image ProcessM. H. Savoji and R. E. BurgeOn Different Methods Based on the {KarhunenLoeve} Expansion and Used in Image Analysis
@Article{Savoji:1985:DMB,
author = "M. H. Savoji and R. E. Burge",
title = "On Different Methods Based on the {KarhunenLoeve}
Expansion and Used in Image Analysis",
journal = jCVGIP,
volume = "29",
number = "2",
pages = "259269",
month = feb,
year = "1985",
CODEN = "CVGPDB",
ISSN = "0734189X",
ISSNL = "0734189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database; Graphics/rosenfeld/1985.bib;
http://www.math.utah.edu/pub/tex/bib/cvgip.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
affiliation = "U London",
affiliationaddress = "Queen Elizabeth Coll, Dep of Physics, London,
Engl",
classification = "716; 718; 723",
fjournal = "Computer Vision, Graphics, and Image Processing",
journalURL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "data compression; eigendata problem; image analysis;
image processing; image transformation, space
frequency, digital; KarhunenLoeve expansion; pattern
recognition; signal processing",
}
22i[_3'})57E;[)wwEQ'G)1articledatacompression.bibTodd:1985:PRCStephen Todd and Glen G. Langdon, Jr. and Jorma RissanenParameter Reduction and Context Selection for Compression of GrayScale ImagesjIBMJRD292188193mar31985IBMJAE00188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 00188646Tue Mar 25 14:26:59 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib1997.03.25 14:26:59 MSTIn the compression of multilevel (color or gray) image d5ZY3+E777C?;k{qwUE;{articledatacompression.bibSavoji:1985:DMBM. H. Savoji and R. E. BurgeOn Different Methods Based on the KarhunenLoeve Expansion and Used in Image AnalysisjCVGIP292259269feb21985CVGPDB0734189X OR 0734189X0734189X OR 073418
nd Context Selection for
Compression of GrayScale Images",
journal = jIBMJRD,
volume = "29",
number = "2",
pages = "188193",
month = mar,
year = "1985",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "In the compression of multilevel (color or gray) image
data, effective compression is obtained economically by
judicial selection of the predictor and the
conditioning states or contexts which determine what
probability distribution to use for the prediction
error. The authors provide a costeffective approach to
the following two problems: (1) to reduce the number of
coding parameters to describe a distribution when
several contexts are involved, and (2) to choose
contexts for which variations in prediction error
distributions are expected. They solve Problem 1
(distribution description) by a partition of the range
of values of the outcomes into equivalence classes,
called buckets. The result is a special decomposition
of the error range. Costeffectiveness is achieved by
using the many contexts only to predict the bucket
(equivalence class) probabilities. They solve Problem 2
(economical contexts) by using the buckets of the
surrounding pixels as components of the conditioning
class. The bucket values have the desirable properties
needed for the error distributions.",
acknowledgement = acknhfb,
affiliation = "IBM, United Kingdom Scientific Cent, Winchester,
Engl",
affiliationaddress = "IBM, United Kingdom Scientific Cent, Winchester,
Engl",
classcodes = "B6140C (Optical information, image and video signal
processing); C1250 (Pattern recognition)",
classification = "723; 741",
corpsource = "IBM UK Sci. Centre, Winchester, UK",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "Analysis; buckets; classes; coding; compression;
conditioning class; context selection; data
compression; encoding; equivalence; error
distributions; grayscale images; image processing;
parameter reduction; parameters; picture processing;
prediction error distributions",
treatment = "T Theoretical or Mathematical",
}ata, effective compression is obtained economically by judicial selection of the predictor and the conditioning states or contexts which determine what probability distribution to use for the prediction error. The authors provide a costeffective approach to the following two problems: (1) to reduce the number of coding parameters to describe a distribution when several contexts are involved, and (2) to choose contexts for which variations in prediction error distributions are expected. They solve Problem 1 (distribution description) by a partition of the range of values of the outcomes into equivalence classes, called buckets. The result is a special decomposition of the error range. Costeffectiveness is achieved by using the many contexts only to predict the bucket (equivalence class) probabilities. They solve Problem 2 (economical contexts) by using the buckets of the surrounding pixels as components of the conditioning class. The bucket values have the desirable properties needed for the error distributions.IBM Journal of Research and DevelopmentAnalysis; buckets; classes; coding; compression; conditioning class; context selection; data compression; encoding; equivalence; error distributions; grayscale images; image processing; parameter reduction; parameters; picture processing; prediction error distributionsacknhfbIBM, United Kingdom Scientific Cent, Winchester, EnglIBM, United Kingdom Scientific Cent, Winchester, EnglB6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)IBM UK Sci. Centre, Winchester, UKhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520IBM J Res DevT Theoretical or MathematicalIn the compression of multilevel (color or gray) image data, effective compression is obtained economically by judicial selection of the predictor and the conditioning states or contexts which determine what probability distribution to use for the prediction error. The authors provide a costeffective approach to the following two problems: (1) to reduce the number of coding parameters to describe a distribution when several contexts are involved, and (2) to choose contexts for which variations in prediction error distributions are expected. They solve Problem 1 (distribution description) by a partition of the range of values of the outcomes into equivalence classes, called buckets. The result is a special decomposition of the error range. Costeffectiveness is achieved by using the many contexts only to predict the bucket (equivalence class) probabilities. They solve Problem 2 (economical contexts) by using the buckets of the surrounding pixels as components of the conditioning class. The bucket values have the desirable properties needed for the error distributions.Stephen Todd and Glen G. {Langdon, Jr.} and Jorma RissanenParameter Reduction and Context Selection for Compression of GrayScale Images
@Article{Todd:1985:PRC,
author = "Stephen Todd and Glen G. {Langdon, Jr.} and Jorma
Rissanen",
title = "Parameter Reduction and Context Selection for
Compression of GrayScale Images",
journal = jIBMJRD,
volume = "29",
number = "2",
pages = "188193",
month = mar,
year = "1985",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "In the compression of multilevel (color or gray) image
data, effective compression is obtained economically by
judicial selection of the predictor and the
conditioning states or contexts which determine what
probability distribution to use for the prediction
error. The authors provide a costeffective approach to
the following two problems: (1) to reduce the number of
coding parameters to describe a distribution when
several contexts are involved, and (2) to choose
contexts for which variations in prediction error
distributions are expected. They solve Problem 1
(distribution description) by a partition of the range
of values of the outcomes into equivalence classes,
called buckets. The result is a special decomposition
of the error range. Costeffectiveness is achieved by
using the many contexts only to predict the bucket
(equivalence class) probabilities. They solve Problem 2
(economical contexts) by using the buckets of the
surrounding pixels as components of the conditioning
class. The bucket values have the desirable properties
needed for the error distributions.",
acknowledgement = acknhfb,
affiliation = "IBM, United Kingdom Scientific Cent, Winchester,
Engl",
affiliationaddress = "IBM, United Kingdom Scientific Cent, Winchester,
Engl",
classcodes = "B6140C (Optical information, image and video signal
processing); C1250 (Pattern recognition)",
classification = "723; 741",
corpsource = "IBM UK Sci. Centre, Winchester, UK",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "Analysis; buckets; classes; coding; compression;
conditioning class; context selection; data
compression; encoding; equivalence; error
distributions; grayscale images; image processing;
parameter reduction; parameters; picture processing;
prediction error distributions",
treatment = "T Theoretical or Mathematical",
} and Scaling for Networked
Professional Workstations",
type = "Report",
number = "UIUCDCSR851201",
institution = "Dept. of Computer Science, University of Illinois at
UrbanaChampaign",
address = "Urbana, IL, USA",
pages = "v + 80",
month = apr,
year = "1985",
bibdate = "Wed Feb 28 15:00:20 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
Techreports/Uiuc.Tr.bib;
Techreports/universityofillinoisurbanachampagne.bib",
acknowledgement = acknhfb,
annote = "Originally presented as the author's thesis (M.S.) 
University of Illinois at UrbanaChampaign, 1985.
``April 1985.'' ``UILUENG851712.''  Cover.
Bibliography: p. 80.",
keywords = "Data compression (Computer science); Data transmission
systems.; Information storage and retrieval systems.",
}atacompression.bibWong:1985:FSCbWillard Lee WongFont Storage, Compression, and Scaling for Networked Professional WorkstationsReportUIUCDCSR851201Dept. of Computer Science, University of Illinois at UrbanaChampaignUrbana, IL, USAv + 80apr41985Wed Feb 28 15:00:20 MST 1996http://www.math.utah.edu/pub/tex/bib/datacompression.bib; Techreports/Uiuc.Tr.bib; Techreports/universityofillinoisurbanachampagne.bib1996.02.28 15:00:20 MSTData compression (Computer science); Data transmission systems.; Information storage and retrieval systems.acknhfbOriginally presented as the author's thesis (M.S.)  University of Illinois at UrbanaChampaign, 1985. ``April 1985.'' ``UILUENG851712.''  Cover. Bibliography: p. 80.Willard Lee WongFont Storage, Compression, and Scaling for Networked Professional Workstations
@TechReport{Wong:1985:FSCb,
author = "Willard Lee Wong",
title = "Font Storage, Compression, and Scaling for Networked
Professional Workstations",
type = "Report",
number = "UIUCDCSR851201",
institution = "Dept. of Computer Science, University of Illinois at
UrbanaChampaign",
address = "Urbana, IL, USA",
pages = "v + 80",
month = apr,
year = "1985",
bibdate = "Wed Feb 28 15:00:20 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
Techreports/Uiuc.Tr.bib;
Techreports/universityofillinoisurbanachampagne.bib",
acknowledgement = acknhfb,
annote = "Originally presented as the author's thesis (M.S.) 
University of Illinois at UrbanaChampaign, 1985.
``April 1985.'' ``UILUENG851712.''  Cover.
Bibliography: p. 80.",
keywords = "Data compression (Computer science); Data transmission
systems.; Information storage and retrieval systems.",
}
"sW`Y 31e!7E ;'OQ3'marticledataco&_W 311U57c'1Y
articledatacomp$4^X '3+9)95CQC7;+9Imastersthesisdatacompression.bibAitken:1986:PMDRobert Campbell AitkenPerformance measures of data compression techniques in fault detectionThesis (M.Sc.)University of VictoriaVictoria, BC, Canada19860315316950 OR 03153169!>]U 3)#5377E};e#9Earticledatacompres\[ !3))/+E!;ci)]Utechreportd,
journal = "Wheels for the Mind",
volume = "1",
pages = "34",
month = "Fall",
year = "1985",
CODEN = "????",
ISSN = "08918805",
ISSNL = "08918805",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Young, D. M. (1985) ``MacWrite File Format,'' {\it
Wheels for the Mind}, {\bf1}:34, Fall.",
remark = "Discontinued periodical from Apple Computer.",
}sion.bibYoung:1985:MFFD. M. YoungMacWrite File FormatWheels for the Mind134Fall198508918805 OR 0891880508918805 OR 08918805Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTDiscontinued periodical from Apple Computer.ackdsD. M. Young{MacWrite} File Format
@Article{Young:1985:MFF,
author = "D. M. Young",
title = "{MacWrite} File Format",
journal = "Wheels for the Mind",
volume = "1",
pages = "34",
month = "Fall",
year = "1985",
CODEN = "????",
ISSN = "08918805",
ISSNL = "08918805",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Young, D. M. (1985) ``MacWrite File Format,'' {\it
Wheels for the Mind}, {\bf1}:34, Fall.",
remark = "Discontinued periodical from Apple Computer.",
}rmance measures of data compression techniques in
fault detection",
type = "Thesis ({M.Sc.})",
school = "University of Victoria",
address = "Victoria, BC, Canada",
pages = "????",
year = "1986",
ISBN = "0315316950",
ISBN13 = "9780315316959",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "0399: Library science",
subject = "Library science",
}
++&Lr'O
@InProceedings{Sarma:1996:HRT,
author = "D. Das Sarma and D. W. Matula",
title =
;
@InProceedings{Sarshar:2004:WCS,
author = "N. Sarshar and X. Wu",
title = "On wava[
@InProceedings{Sano:2010:SPP,
author = "K. Sano and K. Katahira and S. Yamamoto",
title ";w
@InProceedings{Sartipi:2010:LCI,
author = "M. Sartipi",
title = "{LDPC} Codes for"1
@InProceedings{Sarshar:2004:MMS,
author = "N. Sarshar and X. Wu",
title = "Minima_];
@InProceedings{Sartipi:2005:DSC,
author = "M. Sartipi and F. Fekri",
title = "Dis΄Z5
@InProceedings{Santis:1991:OAC,
author = "A. {De Santis} and G. Persiano",
title = A
@InProceedings{Sarshar:2006:PAJ,
author = "N. Sarshar and Xiaolin Wu",
title = "A>}
@InProceedings{Saponara:2003:LPV,
author = "Sergio Saponara and Luca Fanucci and Pierangel509780315316959 OR 9780315316959Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSTLibrary scienceacknhfbRobert Campbell AitkenPerformance measures of data compression techniques in fault detection
@MastersThesis{Aitken:1986:PMD,
author = "Robert Campbell Aitken",
title = "Performance measures of data compression techniques in
fault detection",
type = "Thesis ({M.Sc.})",
school = "University of Victoria",
address = "Victoria, BC, Canada",
pages = "????",
year = "1986",
ISBN = "0315316950",
ISBN13 = "9780315316959",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "0399: Library science",
subject = "Library science",
}sion with {Huffman} Coding",
journal = jBYTE,
volume = "11",
number = "5",
pages = "99108",
month = may,
year = "1986",
CODEN = "BYTEDJ",
ISSN = "03605280 (print), 10827838 (electronic)",
ISSNL = "03605280",
bibsource = "http://www.math.utah.edu/pub/tex/bib/byte1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "BYTE Magazine",
}
rr&L+zu
@Article{Arandiga:2010:PVW,
author = "F. Ar{\`a}ndiga and A. M. Belda and P. Mulet",
tit!P!
@Article{Apostolico:1987:RTU,
author = "Alberto Apostolico and A. S. Fraenkel",
title = iiS
@Article{Apiki:1991:LDC,
author = "Steve Apiki",
title = "Lossless Data CompressitfM
@Article{Anonymous:1992:DYDb,
author = "Anonymous",
title = "Double Your Drives WV
@Article{Anonymous:1992:CCG,
author = "Anonymous",
title = "Can Compression Get Y:u
@Article{Anonymous:1997:LGH,
author = "Anonymous",
title = "{Linux Gazette}: Histzu
@Article{Anonymous:1995:WCM,
author = "Anonymous",
title = "Wavelets Challenge {M
k?
@Article{Anonymous:1994:DCM,
author = "Anonymous",
title = "Data Compression on t 2e
@Article{Anonymous:1992:FDC,
author = "Anonymous",
title = "{OntheFly} Disk Comression.bibAmsterdam:1986:DCHJonathan AmsterdamData Compression with Huffman CodingjBYTE11599108may51986BYTEDJ03605280 (print), 10827838 (electronic) OR 03605280 (print), 10827838 (electronic)03605280 OR 03605280http://www.math.utah.edu/pub/tex/bib/byte1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bibBYTE MagazineJonathan AmsterdamData Compression with {Huffman} Coding
@Article{Amsterdam:1986:DCH,
author = "Jonathan Amsterdam",
title = "Data Compression with {Huffman} Coding",
journal = jBYTE,
volume = "11",
number = "5",
pages = "99108",
month = may,
year = "1986",
CODEN = "BYTEDJ",
ISSN = "03605280 (print), 10827838 (electronic)",
ISSNL = "03605280",
bibsource = "http://www.math.utah.edu/pub/tex/bib/byte1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "BYTE Magazine",
}nal = jIBMTDB,
volume = "28",
number = "8",
pages = "35633564",
month = jan,
year = "1986",
CODEN = "IBMTAA",
ISSN = "00188689",
bibdate = "Mon Dec 16 08:30:04 MST 1996",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/typeset.bib",
abstract = "This article describes the generation or decompression
of font patterns from the compressed form data
including control bytes and data bytes.",
acknowledgement = acknhfb,
classification = "722; 723",
fjournal = "IBM Technical Disclosure Bulletin",
journalabr = "IBM Tech Discl Bull",
keywords = "compressed form data; compression/decompression;
control bytes; data bytes; Data Handling; data
processing; font patterns; information theory  Data
Compression",
}'mpression.bibAnonymous:1986:CDFAnonymousCompression / Decompression of Font PatternsjIBMTDB28835633564jan11986IBMTAA00188689 OR 00188689Mon Dec 16 08:30:04 MST 1996Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/typeset.bib1996.12.16 08:30:04 MSTThis article describes the generation or decompression of font patterns from the compressed form data including control bytes and data bytes.IBM Technical Disclosure Bulletincompressed form data; compression/decompression; control bytes; data bytes; Data Handling; data processing; font patterns; information theory  Data CompressionacknhfbIBM Tech Discl BullThis article describes the generation or decompression of font patterns from the compressed form data including control bytes and data bytes.AnonymousCompression\slash Decompression of Font Patterns
@Article{Anonymous:1986:CDF,
author = "Anonymous",
title = "Compression\slash Decompression of Font Patterns",
journal = jIBMTDB,
volume = "28",
number = "8",
pages = "35633564",
month = jan,
year = "1986",
CODEN = "IBMTAA",
ISSN = "00188689",
bibdate = "Mon Dec 16 08:30:04 MST 1996",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/typeset.bib",
abstract = "This article describes the generation or decompression
of font patterns from the compressed form data
including control bytes and data bytes.",
acknowledgement = acknhfb,
classification = "722; 723",
fjournal = "IBM Technical Disclosure Bulletin",
journalabr = "IBM Tech Discl Bull",
keywords = "compressed form data; compression/decompression;
control bytes; data bytes; Data Handling; data
processing; font patterns; information theory  Data
Compression",
})thematics of information processing",
volume = "34",
publisher = pubAMS,
address = pubAMS:adr,
pages = "xi + 233",
year = "1986",
ISBN = "0821800868",
ISBN13 = "9780821800867",
LCCN = "QA76.9.M35 M39 1986",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "Proceedings of symposia in applied mathematics,
01607634; AMS short course lecture notes",
acknowledgement = acknhfb,
subject = "Computer science; Mathematics; Congresses",
tableofcontents = "Diameters of communication networks / F. R. K.
Chung \\
The theory of data dependencies / Ronald Fagin and
Moshe Y. Vardi \\
Transaction management / Hector GarciaMolina \\
Fundamental database issues / Barry E. Jacobs \\
Data compression algorithms / Victor S. Miller \\
Application of category theory of structural sets to
modelling of information bases of systems / Augustin A.
Tuzhilin",
}+ MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; z3950.loc.gov:7090/Voyager2013.01.28 15:19:07 MSTProceedings of symposia in applied mathematics, 01607634; AMS short course lecture notesComputer science; Mathematics; CongressesDiameters of communication networks / F. R. K. Chung The theory of data dependencies / Ronald Fagin and Moshe Y. Vardi Transaction management / Hector GarciaMolina Fundamental database issues / Barry E. Jacobs Data compression algorithms / Victor S. Miller Application of category theory of structural sets to modelling of information bases of systems / Augustin A. TuzhilinacknhfbMichael Anshel and William GewirtzMathematics of information processing
@Book{Anshel:1986:MIP,
editor = "Michael Anshel and William Gewirtz",
title = "Mathematics of information processing",
volume = "34",
publisher = pubAMS,
address = pubAMS:adr,
pages = "xi + 233",
year = "1986",
ISBN = "0821800868",
ISBN13 = "9780821800867",
LCCN = "QA76.9.M35 M39 1986",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "Proceedings of symposia in applied mathematics,
01607634; AMS short course lecture notes",
acknowledgement = acknhfb,
subject = "Computer science; Mathematics; Congresses",
tableofcontents = "Diameters of communication networks / F. R. K.
Chung \\
The theory of data dependencies / Ronald Fagin and
Moshe Y. Vardi \\
Transaction management / Hector GarciaMolina \\
Fundamental database issues / Barry E. Jacobs \\
Data compression algorithms / Victor S. Miller \\
Application of category theory of structural sets to
modelling of information bases of systems / Augustin A.
Tuzhilin",
}
bV 3'+G/!57E};S+OCarticledatacompression.bibBell:1986:BOTTimothy C. BellBetter OPM/L Text CompressionjIEEETRANSCOMM341211761182dec121986IECMBT00906778 (print), 15580857 (electronic) OR 00906778 (print), 15580857 (ele.CaX3+QW#CQ3E5;?_{QWbookdatacompression.bibAnshel:1986:MIPMichael Anshel and William GewirtzMathematics of information processing34pubAMSpubAMS:adrxi + 23319860821800868 OR 08218008689780821800867 OR 9780821800867QA76.9.M35 M39 1986Mon Jan 28 15:19:07*t Compression",
journal = jIEEETRANSCOMM,
volume = "34",
number = "12",
pages = "11761182",
month = dec,
year = "1986",
CODEN = "IECMBT",
ISSN = "00906778 (print), 15580857 (electronic)",
ISSNL = "00906778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Bell, Timothy C. (1986) ``Better OPM/L Text
Compression,'' {\it IEEE Transactions on
Communications}, {\bf34}(12):11761182, December.",
}ctronic)00906778 OR 00906778Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on CommunicationsackdsTimothy C. BellBetter {OPM}/{L} Text Compression
@Article{Bell:1986:BOT,
author = "Timothy C. Bell",
title = "Better {OPM}/{L} Text Compression",
journal = jIEEETRANSCOMM,
volume = "34",
number = "12",
pages = "11761182",
month = dec,
year = "1986",
CODEN = "IECMBT",
ISSN = "00906778 (print), 15580857 (electronic)",
ISSNL = "00906778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Bell, Timothy C. (1986) ``Better OPM/L Text
Compression,'' {\it IEEE Transactions on
Communications}, {\bf34}(12):11761182, December.",
}0
Tarjan and Victor K. Wei",
title = "A Locally Adaptive Data Compression Scheme",
journal = jCACM,
volume = "29",
number = "4",
pages = "320330",
month = apr,
year = "1986",
CODEN = "CACMA2",
DOI = "http://dx.doi.org/10.1145/5684.5688",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "68P99 (94A24)",
MRnumber = "87e:68020",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/00010782/5688.html",
abstract = "A data compression scheme that exploits locality of
reference, such as occurs when words are 1used
frequently over short intervals and then fall into long
periods of disuse, is described. The scheme is based on
a simple heuristic for selforganizing sequential
search and on variablelength encodings of integers. We
prove that it never performs much worse than Huffman
coding and can perform substantially better;
experiments on real files show that its performance is
usually quite close to that of Huffman coding. Our
scheme has many implementation advantages: it is
simple, allows fast encoding and decoding, and requires
only one pass over the data to be compressed (static
Huffman coding takes two passes).",
acknowledgement = ackds # " and " # acknhfb,
annote = "Exploits locality of reference when words are used
frequently over short intervals; is based on a
selforganizing search and on variablelength encodings
of integers. Its performance is close to that of
Huffman coding. Requires only one pass over the data.",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; experimentation; image information;
measurement; performance; statistics; theory",
rawdata = "Bentley, J. L. et al. (1986) ``A Locally Adaptive Data
Compression Algorithm,'' {\it Communications of the
ACM}, {\bf29}(4):320330, April.",
review = "ACM CR 86100918",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf E.1}: Data, DATA
STRUCTURES, Lists.",
}3/toc/Abstracts/00010782/5688.htmlA data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described. The scheme is based on a simple heuristic for selforganizing sequential search and on variablelength encodings of integers. We prove that it never performs much worse than Huffman coding and can perform substantially better; experiments on real files show that its performance is usually quite close to that of Huffman coding. Our scheme has many implementation advantages: it is simple, allows fast encoding and decoding, and requires only one pass over the data to be compressed (static Huffman coding takes two passes).Communications of the ACMalgorithms; experimentation; image information; measurement; performance; statistics; theorybf E.4: Data, CODING AND INFORMATION THEORY, Data compaction and compression. bf E.1: Data, DATA STRUCTURES, Lists.ackdsExploits locality of reference when w4ords are used frequently over short intervals; is based on a selforganizing search and on variablelength encodings of integers. Its performance is close to that of Huffman coding. Requires only one pass over the data.http://portal.acm.org/browse_dl.cfm?idx=J79A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described. The scheme is based on a simple heuristic for selforganizing sequential search and on variablelength encodings of integers. We prove that it never performs much worse than Huffman coding and can perform substantially better; experiments on real files show that its performance is usually quite close to that of Huffman coding. Our scheme has many implementation advantages: it is simple, allows fast encoding and decoding, and requires only one pass over the data to be compressed (static Huffman coding takes two passes).Jon Louis Bentley and Daniel D. Sleator and Rob5ert E. Tarjan and Victor K. WeiA Locally Adaptive Data Compression Scheme
@Article{Bentley:1986:LAD,
author = "Jon Louis Bentley and Daniel D. Sleator and Robert E.
Tarjan and Victor K. Wei",
title = "A Locally Adaptive Data Compression Scheme",
journal = jCACM,
volume = "29",
number = "4",
pages = "320330",
month = apr,
year = "1986",
CODEN = "CACMA2",
DOI = "http://dx.doi.org/10.1145/5684.5688",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "68P99 (94A24)",
MRnumber = "87e:68020",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.o6rg/pubs/toc/Abstracts/00010782/5688.html",
abstract = "A data compression scheme that exploits locality of
reference, such as occurs when words are used
frequently over short intervals and then fall into long
periods of disuse, is described. The scheme is based on
a simple heuristic for selforganizing sequential
search and on variablelength encodings of integers. We
prove that it never performs much worse than Huffman
coding and can perform substantially better;
experiments on real files show that its performance is
usually quite close to that of Huffman coding. Our
scheme has many implementation advantages: it is
simple, allows fast encoding and decoding, and requires
only one pass over the data to be compressed (static
Huffman coding takes two passes).",
acknowledgement = ackds # " and " # acknhfb,
annote = "Exploits locality of reference when words are used
frequently over short intervals; is based on a
selforganizing search and on variablelength encodings
of integers. Its performance is close to that of
Huffman coding. Requires only one pass over the data.",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; experimentation; image information;
measurement; performance; statistics; theory",
rawdata = "Bentley, J. L. et al. (1986) ``A Locally Adaptive Data
Compression Algorithm,'' {\it Communications of the
ACM}, {\bf29}(4):320330, April.",
review = "ACM CR 86100918",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf E.1}: Data, DATA
STRUCTURES, Lists.",
}
h#h+dW3)]y77C?;ky#?wU]yk
articledatacompression.bibCheng:1986:AAZL. M. Cheng and A. S. Ho and R. E. BurgeAn Adaptiv>Ac^3)aS57'E;?Es
c)acarticledatacompression.bibBentley:1986:LADJon Louis Bentley and Daniel D. Sleator and Robert E. Tarjan and Victor K. WeiA Locally Adaptive Data Compression SchemejCACM294320330apr41986CACMA2http://dx.doi.org/10.1145/5684.568800010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 0001078268P99 (94A24)87e:68020Sat Jan 26 12:46:16 MST 2013ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSThttp://www.acm.org/pubs2yw~ytoje`[VQLGB=83.)$ysmga[UOIC=71+%
}wqke_YSMGA;5/)#`[YVUTQPO܁NׁLҁJǁIGEDB@>=<98x6u3m2j/g.d_,\*Y)V(R'O&L%9$6 /,(#
فЁ́~}zyvsqonmkjyilgge]cUaR_O^I]D\:Z3X0V)U&TSPONMLJHFC@?><:7643210.+(~'w$k!hfc^YROJGDA;+&
Fo}wqke_YSMGA;5/)#{uoic]WQKE?93'!@:4.("
vpjd^XRLF &ƂDB@?><;:9865432~1s0j.ZW*R)L'J&D%@#8"%
܂
ׂЂ ͂~}{yrwotkshqcp[nRlKiHgBf7dvvnsjphoen\mYjTiPgNfKeIdDc@a=`7_4]0\+[(Y#X!WVSRPNL߂IӂGЂET# ߃܃Ճ̓~{,b`[YVUTQPO܁NׁLҁJǁIG}y; "An Adaptive Asteroid Zonal Filter for Data
Compression",
journal = jCVGIP,
volume = "34",
number = "3",
pages = "292301",
month = jun,
year = "1986",
CODEN = "CVGPDB",
ISSN = "0734189X",
ISSNL = "0734189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database; Graphics/rosenfeld/1986.bib;
http://www.math.utah.edu/pub/tex/bib/cvgip.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
affiliation = "King's Coll",
affiliationaddress = "King's Coll, London, Engl",
classification = "723",
fjournal = "Computer Vision, Graphics, and Image Processing",
journalURL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "adaptive asteroid zonal filter; codes, symbolic 
Encoding; data compression; image approximation; image
processing; information theory  Data Compression;
transform image coding",
}
&&!GmN
@Article{Bjorklund:2014:CFS,
author = "Henrik Bj{\"o}rklund and Johanna Bj{\"o}rklund and
&*/_
@Article{Bonyadi:2011:NHQ,
author = "Mohammad Reza Bonyadi and Mohsen Ebrahimi Moghaddam",#\9
@Article{Bonny:2010:HBC,
author = "Talal Bonny and J{\"o}rg Henkel",
title = "{Hu!ʅ5k
@Article{Bonneau:1995:UCO,
author = "Robert Bonneau",
title = "Using the centroid
eK
@Article{Bille:2009:IAS,
author = "Philip Bille and Rolf Fagerberg and Inge Li G{\o}rtz",
ovm
@Article{Boldi:2005:CWW,
author = "Paolo Boldi and Sebastiano Vigna",
title = "Co׆];
@Article{Bodlaender:1995:CAT,
author = "Hans L. Bodlaender and Teofilo F. Gonzalez and Ton
7o
@Article{Bocharova:1994:TCL,
author = "I. E. Bocharova and V. D. Kolesnik and V. {Yu
hQ
@Article{Blinn:1993:WDD,
author = "J. F. Blinn",
title = "{What}'s the Deal with the {jjY;];
@Article{Jez:2015:FFC,
author = "Artur Jez",
title = "Faster Fully Compressed Pattern Matching by
Recompression",
journal = jTALG,
volume = "11",
number = "3",
page&T)
@Article{Karpovsky:1990:ORC,
author = "M. G. Karpovsky and P. Nagvajara",
title =
)
@Article{Joseph:2012:EQP,
author = "A. Benjamin Joseph and Baskaran Ramachandran",
title$d1c
@Article{Klonatos:2012:TOS,
author = "Yannis Klonatos and Thanos Makatos and Manolis
$EU+
@Article{Kirovski:1999:PBP,
author = "Darko Kirovski and Johnson Kin and William H.
MangioneSmith",
title = "Procedure Based Program Compression",
journal = jINTJPARALL&Շ&M
@Article{Keller:2014:GSC,
author = "Orgad Keller and Tsvi Kopelowitz and Shir Landau
&\?e Asteroid Zonal Filter for Data CompressionjCVGIP343292301jun61986CVGPDB0734189X OR 0734189X0734189X OR 0734189XThu Feb 6 18:44:11 MST 1997Compendex database; Graphics/rosenfeld/1986.bib; http://www.math.utah.edu/pub/tex/bib/cvgip.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.02.06 18:44:11 MSTComputer Vision, Graphics, and Image Processingadaptive asteroid zonal filter; codes, symbolic  Encoding; data compression; image approximation; image processing; information theory  Data Compression; transform image codingacknhfbKing's CollKing's Coll, London, Englhttp://www.sciencedirect.com/science/journal/0734189XComput Vision Graphics Image ProcessL. M. Cheng and A. S. Ho and R. E. BurgeAn Adaptive Asteroid Zonal Filter for Data Compression
@Article{Cheng:1986:AAZ,
author = "L. M. Cheng and A. S. Ho and R. E. Burge",
title = "An Adaptive Asteroid Zonal Filter for Data
Compression",
journal = jCVGIP,
volume = "34",
number = "3",
pages = "292301",
month = jun,
year = "1986",
CODEN = "CVGPDB",
ISSN = "0734189X",
ISSNL = "0734189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database; Graphics/rosenfeld/1986.bib;
http://www.math.utah.edu/pub/tex/bib/cvgip.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
affiliation = "King's Coll",
affiliationaddress = "King's Coll, London, Engl",
classification = "723",
fjournal = "Computer Vision, Graphics, and Image Processing",
journalURL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "adaptive asteroid zonal filter; codes, symbolic 
Encoding; data compression; image approximation; image
processing; information theory  Data Compression;
transform image coding",
}tween Sets of Integers and
{Hilbert} Polygons",
journal = jINTJCOMPUTMATH,
volume = "20",
pages = "115122",
year = "1986",
CODEN = "IJCMAT",
ISSN = "00207160",
ISSNL = "00207160",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "International Journal of Computer Mathematics",
rawdata = "Cole, A. J. (1986) ``Direct Transformations Between
Sets of Integers and Hilbert Polygons,'' {\it
International Journal of Computer Mathematics},
{\bf20}:115122.",
}ath.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTInternational Journal of Computer MathematicsackdsA. J. ColeDirect Transformations Between Sets of Integers and {Hilbert} Polygons
@Article{Cole:1986:DTB,
author = "A. J. Cole",
title = "Direct Transformations Between Sets of Integers and
{Hilbert} Polygons",
journal = jINTJCOMPUTMATH,
volume = "20",
pages = "115122",
year = "1986",
CODEN = "IJCMAT",
ISSN = "00207160",
ISSNL = "00207160",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "International Journal of Computer Mathematics",
rawdata = "Cole, A. J. (1986) ``Direct Transformations Between
Sets of Integers and Hilbert Polygons,'' {\it
International Journal of Computer Mathematics},
{\bf20}:115122.",
}
CC:fV !3/ki5E1;+/otechreportdatacomEBeW 3'!377E};g!yarticledatacompression.bibCole:1986:DTBA. J. ColeDirect Transformations Between Sets of Integers and Hilbert PolygonsjINTJCOMPUTMATH201151221986IJCMAT00207160 OR 0020716000207160 OR 00207160Sat Jan 26 12:46:16 MST 2013http://www.mAsion using dynamic {Markov} modelling",
volume = "CS8618",
institution = "Faculty of Mathematics, University of Waterloo",
address = "Waterloo, ON, Canada",
pages = "19",
year = "1986",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlcbnc.ca:210/NL;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Research report",
acknowledgement = acknhfb,
}
&rL+/
@PhdThesis{Tong:1993:DCA,
author = "Tak Yen Tong",
title = "Data compression with݅cG
@PhdThesis{Todd:1989:IDC,
author = "Martin Peter Todd",
title = "Image Data Comprǅ0a
@PhdThesis{Stewart:1981:TDC,
author = "Lawrence Colm Stewart",
title = "Trellis D7xq
@PhdThesis{Tan:1993:DCA,
author = "Roland K. D. Tan",
title = "Data Compression AI
@PhdThesis{Than:1994:CID,
author = "Soe Than",
title = "Compression of input data
*;w
@PhdThesis{Thede:1989:HID,
author = "Leslie D. Thede",
title = "A Hybrid Image DaiS
@PhdThesis{Swacha:2004:PSM,
author = "Jakub Swacha",
title = "Predykcyjnosubstyt
@PhdThesis{Tadayon:1998:ALD,
author = "Nasser Tadayon",
title = "Adaptive losslesK={
@PhdThesis{Strohbeck:1999:NAI,
author = "Uwe Strohbeck",
title = "A new approach pression.bibCormack:1986:DCUGordon V. CormackData compression using dynamic Markov modellingCS8618Faculty of Mathematics, University of WaterlooWaterloo, ON, Canada191986Mon Jan 28 15:10:29 MST 2013amicus.nlcbnc.ca:210/NL; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.28 15:10:29 MSTResearch reportacknhfbGordon V. CormackData compression using dynamic {Markov} modelling
@TechReport{Cormack:1986:DCU,
author = "Gordon V. Cormack",
title = "Data compression using dynamic {Markov} modelling",
volume = "CS8618",
institution = "Faculty of Mathematics, University of Waterloo",
address = "Waterloo, ON, Canada",
pages = "19",
year = "1986",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlcbnc.ca:210/NL;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Research report",
acknowledgement = acknhfb,
}tting",
publisher = pubAW,
address = pubAW:adr,
pages = "??",
year = "1986",
ISBN = "0201134470 (v.A), 0201134373 (v.B),
0201134454 (v.C), 0201134381 (v.D), 0201134462
(v.E)",
ISBN13 = "9780201134476 (v.A), 9780201134377 (v.B),
9780201134452 (v.C), 9780201134384 (v.D),
9780201134469 (v.E)",
LCCN = "Z253.4.T47K58 1986",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/typeset.bib",
acknowledgement = ackds # " and " # acknhfb,
keywords = "Computerized typesetting.",
rawdata = "Knuth, D. E. (1986) {\it Computers and Typesetting},
Reading, Mass., Addison Wesley.",
}Computers and Typesetting
@Book{Knuth:1986:CT,
author = "Donald Ervin Knuth",
title = "Computers and Typesetting",
publisher = pubAW,
address = pubAW:adr,
pages = "??",
year = "1986",
ISBN = "0201134470 (v.A), 0201134373 (v.B),
0201134454 (v.C), 0201134381 (v.D), 0201134462
(v.E)",
ISBN13 = "9780201134476 (v.A), 9780201134377 (v.B),
9780201134452 (v.C), 9780201134384 (v.D),
9780201134469 (v.E)",
LCCN = "Z253.4.T47K58 1986",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/typeset.bib",
acknowledgement = ackds # " and " # acknhfb,
keywords = "Computerized typesetting.",
rawdata = "Knuth, D. E. (1986) {\it Computers and Typesetting},
Reading, Mass., Addison Wesley.",
}
@gX 3'1?!Y1Ea;?1?Sbookdatacompression.bibKnuth:1986:CTDonald Ervin KnuthComputers and TypesettingpubAWpubAW:adr19860201134470 (v.A), 0201134373 (v.B), 0201134454 (v.C), 0201134381 (v.D), 0201134462 (v.E) OR 0201134470 (v.A), 0201134373 (v.B), 0201134454 (v.C), 0201134381 (v.D), 0201134462 (v.E)9780201134476 (v.A), 9780201134377 (v.B), 9780201134452 (v.C), 9780201134384 (v.D), 9780201134469 (v.E) OR 9780201134476 (v.A), 9780201134377 (v.B), 9780201134452 (v.C), 9780201134384 (v.D), 9780201134469 (v.E)Z253.4.T47K58 1986Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/typeset.bib2013.01.26 12:46:16 MSTComputerized typesetting.ackdsDonald Ervin KnuthGSpeech Characteristics as Applied
to Phoneme Extrapolation (Speech Recognition, Data
Compression)",
type = "{M.E.} thesis",
school = "The Cooper Union for the Advancement of Science and
Art",
address = "New York, NY, USA",
pages = "176",
year = "1986",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303473611",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering; 0800: Artificial
intelligence",
dissertationthesisnumber = "1327133",
subject = "Electrical engineering; Artificial intelligence",
}Speech Characteristics as Applied to Phoneme Extrapolation (Speech Recognition, Data Compression)
@MastersThesis{Li:1986:SIS,
author = "Yuk Lun Li",
title = "A Study of Invariant Speech Characteristics as Applied
to Phoneme Extrapolation (Speech Recognition, Data
Compression)",
type = "{M.E.} thesis",
school = "The Cooper Union for the Advancement of Science and
Art",
address = "New York, NY, USA",
pages = "176",
year = "1986",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303473611",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering; 0800: Artificial
intelligence",
dissertationthesisnumber = "1327133",
subject = "Electrical engineering; Artificial intelligence",
}
MM9iX 3'%91C7;e9'kphdthesisdatacompression.bibMoayeri:1986:FVQNader MoayeriFast Vector Quantization (Communication Theory, Source Coding, Data Compression)Ph.D. thesisUniversity of MichiganAnn Arbor, MI, USA1781986Fri Feb 1 09:20:32 MST 2013http:/MbhX '3#!y#{/C7;ek!yCmastersthesisdatacompression.bibLi:1986:SISYuk Lun LiA Study of Invariant Speech Characteristics as Applied to Phoneme Extrapolation (Speech Recognition, Data Compression)M.E. thesisThe Cooper Union for the Advancement of Science and ArtNew York, NY, USA1761986Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303473611Electrical engineering; Artificial intelligenceacknhfbYuk Lun LiA Study of Invariant Jization (Communication Theory, Source
Coding, Data Compression)",
type = "{Ph.D.} thesis",
school = "University of Michigan",
address = "Ann Arbor, MI, USA",
pages = "178",
year = "1986",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303494436",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8702795",
subject = "Electrical engineering",
}/search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303494436Electrical engineeringacknhfbNader MoayeriFast Vector Quantization (Communication Theory, Source Coding, Data Compression)
@PhdThesis{Moayeri:1986:FVQ,
author = "Nader Moayeri",
title = "Fast Vector Quantization (Communication Theory, Source
Coding, Data Compression)",
type = "{Ph.D.} thesis",
school = "University of Michigan",
address = "Ann Arbor, MI, USA",
pages = "178",
year = "1986",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303494436",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8702795",
subject = "Electrical engineering",
}Oence Algorithm and its Variations",
journal = jALGORITHMICA,
volume = "1",
number = "2",
pages = "251266",
year = "1986",
CODEN = "ALGOEJ",
ISSN = "01784617 (print), 14320541 (electronic)",
ISSNL = "01784617",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "dblpjournalsalgorithmica.bib;
http://dblp.unitrier.de/db/journals/algorithmica/algorithmica1.html#Meyers86;
http://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/indextablea.html#algorithmica",
acknowledgement = ackds,
fjournal = "Algorithmica",
journalURL = "http://link.springer.com/journal/453",
oldlabel = "Meyers86",
rawdata = "Myers, Eugene W. (1986) ``An $O(ND)$ Difference
Algorithm and its Variations,'' {\it Algorithmica},
{\bf1}(2):251266.",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/Meyers86",
}Qression.bibMyers:1986:DAVEugene W. MyersAn $O(ND)$ Difference Algorithm and its VariationsjALGORITHMICA122512661986ALGOEJ01784617 (print), 14320541 (electronic) OR 01784617 (print), 14320541 (electronic)01784617 OR 01784617Sat Jan 26 12:46:16 MST 2013dblpjournalsalgorithmica.bib; http://dblp.unitrier.de/db/journals/algorithmica/algorithmica1.html#Meyers86; http://www.math.utah.edu/pub/tex/bib/algorithmica.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/indextablea.html#algorithmica2013.01.26 12:46:16 MSTAlgorithmicaackdshttp://link.springer.com/journal/453Eugene W. MyersAn {$O(ND)$} Difference Algorithm and its Variations
@Article{Myers:1986:DAV,
author = "Eugene W. Myers",
title = "An {$O(ND)$} Difference Algorithm and its Variations",
journal = jALGORITHMICA,
volume = "1",
number = "2",
pages = "251266",
year = "1986",
CODEN = "ALGOEJ",
ISSN = "01784617 (print), 14320541 (electronic)",
ISSNL = "01784617",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "dblpjournalsalgorithmica.bib;
http://dblp.unitrier.de/db/journals/algorithmica/algorithmica1.html#Meyers86;
http://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/indextablea.html#algorithmica",
acknowledgement = ackds,
fjournal = "Algorithmica",
journalURL = "http://link.springer.com/journal/453",
oldlabel = "Meyers86",
rawdata = "Myers, Eugene W. (1986) ``An $O(ND)$ Difference
Algorithm and its Variations,'' {\it Algorithmica},
{\bf1}(2):251266.",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/Meyers86",
}
2*lY3O?77C?;kq)awUO?Qarticledatacompression.bibPrenter:1986:TADP. M. Prenter and E. R. WestwaterThree Adaptive Discrete Least Squares Cubic Spline Procedures for the Compression of DatajCVGIP333327345mar31986CVGPDB0734189X OR 073418WSkV3+[9!CQ+=_;[93bookdatacompression.bibPeitgen:1986:BFHeinzOtto Peitgen and Peter H. RichterThe Beauty of FractalspubSVpubSV:adrxii + 19919860387158510 OR 03871585109780387158518 OR 9780387158518QA447 .P45 1986Wed Dec 15 10:40:44 1993http://www.math.utah.edu/pTjW 3)+q)57EU;%U+u[articledatacompP "The Beauty of Fractals",
publisher = pubSV,
address = pubSV:adr,
pages = "xii + 199",
year = "1986",
ISBN = "0387158510",
ISBN13 = "9780387158518",
LCCN = "QA447 .P45 1986",
bibdate = "Wed Dec 15 10:40:44 1993",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = ackds # " and " # acknhfb,
rawdata1 = "Peitgen, H.O., et al. (eds.) (1982) {\it The Beauty
of Fractals}, Berlin, SpringerVerlag.",
rawdata2 = "Peitgen, H.O., and Dietmar Saupe (1985) {\it The
Science of Fractal Images}, Berlin, SpringerVerlag.",
}ub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/master.bib1993.12.15 10:40:44 ???ackdsHeinzOtto Peitgen and Peter H. RichterThe Beauty of Fractals
@Book{Peitgen:1986:BF,
author = "HeinzOtto Peitgen and Peter H. Richter",
title = "The Beauty of Fractals",
publisher = pubSV,
address = pubSV:adr,
pages = "xii + 199",
year = "1986",
ISBN = "0387158510",
ISBN13 = "9780387158518",
LCCN = "QA447 .P45 1986",
bibdate = "Wed Dec 15 10:40:44 1993",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = ackds # " and " # acknhfb,
rawdata1 = "Peitgen, H.O., et al. (eds.) (1982) {\it The Beauty
of Fractals}, Berlin, SpringerVerlag.",
rawdata2 = "Peitgen, H.O., and Dietmar Saupe (1985) {\it The
Science of Fractal Images}, Berlin, SpringerVerlag.",
}V"Three Adaptive Discrete Least Squares Cubic Spline
Procedures for the Compression of Data",
journal = jCVGIP,
volume = "33",
number = "3",
pages = "327345",
month = mar,
year = "1986",
CODEN = "CVGPDB",
ISSN = "0734189X",
ISSNL = "0734189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database; Graphics/rosenfeld/1986.bib;
http://www.math.utah.edu/pub/tex/bib/cvgip.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
affiliation = "Colo St U/NOAA",
affiliationaddress = "Colorado State Univ, Fort Collins, CO, USA",
classification = "723; 921",
fjournal = "Computer Vision, Graphics, and Image Processing",
journalURL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "Algorithms; computer programming; data compression;
image approximation; image processing; integer strings;
mathematical transformations  Fast Fourier
Transforms; spline knots",
}X9X0734189X OR 0734189XThu Feb 6 18:44:11 MST 1997Compendex database; Graphics/rosenfeld/1986.bib; http://www.math.utah.edu/pub/tex/bib/cvgip.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.02.06 18:44:11 MSTComputer Vision, Graphics, and Image ProcessingAlgorithms; computer programming; data compression; image approximation; image processing; integer strings; mathematical transformations  Fast Fourier Transforms; spline knotsacknhfbColo St U/NOAAColorado State Univ, Fort Collins, CO, USAhttp://www.sciencedirect.com/science/journal/0734189XComput Vision Graphics Image ProcessP. M. Prenter and E. R. WestwaterThree Adaptive Discrete Least Squares Cubic Spline Procedures for the Compression of Data
@Article{Prenter:1986:TAD,
author = "P. M. Prenter and E. R. Westwater",
title = "Three Adaptive Discrete Least Squares Cubic Spline
Procedures for the Compression of Data",
journal = jCVGIP,
volume = "33",
number = "3",
pages = "327345",
month = mar,
year = "1986",
CODEN = "CVGPDB",
ISSN = "0734189X",
ISSNL = "0734189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database; Graphics/rosenfeld/1986.bib;
http://www.math.utah.edu/pub/tex/bib/cvgip.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
affiliation = "Colo St U/NOAA",
affiliationaddress = "Colorado State Univ, Fort Collins, CO, USA",
classification = "723; 921",
fjournal = "Computer Vision, Graphics, and Image Processing",
journalURL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "Algorithms; computer programming; data compression;
image approximation; image processing; integer strings;
mathematical transformations  Fast Fourier
Transforms; spline knots",
}e Design and Implementation of a Microprocessor
Based Data Compression System",
type = "{M.E.E.} thesis",
school = "The Cooper Union for the Advancement of Science and
Art",
address = "New York, NY, USA",
pages = "134",
year = "1986",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303488933",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "1329773",
subject = "Electrical engineering",
}ion.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303488933Electrical engineeringacknhfbDemetrios A. PrountzosThe Design and Implementation of a Microprocessor Based Data Compression System
@MastersThesis{Prountzos:1986:DIM,
author = "Demetrios A. Prountzos",
title = "The Design and Implementation of a Microprocessor
Based Data Compression System",
type = "{M.E.E.} thesis",
school = "The Cooper Union for the Advancement of Science and
Art",
address = "New York, NY, USA",
pages = "134",
year = "1986",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303488933",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "1329773",
subject = "Electrical engineering",
}
DnZ 3/'Y57E;IeawG']oarticledatacompression.bibRichards:1986:DCGDana RichardsData compressio^0mX '319+'{/C7;e99+kmastersthesisdatacompression.bibPrountzos:1986:DIMDemetrios A. PrountzosThe Design and Implementation of a Microprocessor Based Data Compression SystemM.E.E. thesisThe Cooper Union for the Advancement of Science and ArtNew York, NY, USA1341986Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompressZ]nd {Gray}code sorting",
journal = jINFOPROCLETT,
volume = "22",
number = "4",
pages = "201205",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "00200190 (print), 18726119 (electronic)",
ISSNL = "00200190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = acknhfb,
affiliationaddress = "Univ of Virginia, Charlottesville, VA, USA",
classification = "723; 731; C1160 (Combinatorial mathematics); C6120
(File organisation)",
corpsource = "Dept. of Comput. Sci., Virginia Univ.,
Charlottesville, VA, USA",
fjournal = "Information Processing Letters",
journalURL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "codes, symbolic; comparison based sorting;
comparisonbased sorting; computer systems programming
 Sorting; data compression; data processing  File
Organization; differencing; full mixedradix case; gray
codes; Graycode sorting; radix sorting; sorting;
storage management; theory; verification",
pubcountry = "Netherlands A09",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching \\ E.4 Data, CODING AND
INFORMATION THEORY, Data compaction and compression",
treatment = "T Theoretical or Mathematical",
}_n and Graycode sortingjINFOPROCLETT22420120517apr41986IFPLAT00200190 (print), 18726119 (electronic) OR 00200190 (print), 18726119 (electronic)00200190 OR 00200190Wed Nov 11 12:16:26 MST 1998Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib1998.11.11 12:16:26 MSTInformation Processing Letterscodes, symbolic; comparison based sorting; comparisonbased sorting; computer systems programming  Sorting; data compression; data processing  File Organization; differencing; full mixedradix case; gray codes; Graycode sorting; radix sorting; sorting; storage management; theory; verificationF.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching E.4 Data, CODING AND INFORMATION THEORY, Data compaction and compressionacknhfbUniv of Virginia, Charlottesville, VA, USADept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USAhttp://www.scien`cedirect.com/science/journal/00200190Inf Process LettT Theoretical or MathematicalDana RichardsData compression and {Gray}code sorting
@Article{Richards:1986:DCG,
author = "Dana Richards",
title = "Data compression and {Gray}code sorting",
journal = jINFOPROCLETT,
volume = "22",
number = "4",
pages = "201205",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
ISSN = "00200190 (print), 18726119 (electronic)",
ISSNL = "00200190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = acknhfb,
affiliationaddress = "Univ of Virginia, Charlottesville, VA, USA",
classification = "723; 731; C1160 (Combinatorial mathematics); C6120
(File organisation)",
corpsource = "Dept. of Comput. Sci., Virginia Univ.,
Charlottesville, VA, USA",
fjournal = "Information Processing Letters",
journalURL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "codes, symbolic; comparison based sorting;
comparisonbased sorting; computer systems programming
 Sorting; data compression; data processing  File
Organization; differencing; full mixedradix case; gray
codes; Graycode sorting; radix sorting; sorting;
storage management; theory; verification",
pubcountry = "Netherlands A09",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching \\ E.4 Data, CODING AND
INFORMATION THEORY, Data compaction and compression",
treatment = "T Theoretical or Mathematical",
}dary Range Compression for Improved Range\slash
{Doppler} Processing of {SAR} Data with High Squint",
type = "{M.A.Sc}",
school = "The University of British Columbia",
address = "Vancouver, BC, Canada",
pages = "xviii + 213",
year = "1986",
ISBN = "0315367075",
ISBN13 = "9780315367074",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303539025",
acknowledgement = acknhfb,
classification = "0537: Engineering",
dissertationthesisnumber = "ML36707",
subject = "Engineering",
}ineeringacknhfbAlfred Rudolf SchmidtSecondary Range Compression for Improved Range\slash {Doppler} Processing of {SAR} Data with High Squint
@MastersThesis{Schmidt:1986:SRC,
author = "Alfred Rudolf Schmidt",
title = "Secondary Range Compression for Improved Range\slash
{Doppler} Processing of {SAR} Data with High Squint",
type = "{M.A.Sc}",
school = "The University of British Columbia",
address = "Vancouver, BC, Canada",
pages = "xviii + 213",
year = "1986",
ISBN = "0315367075",
ISBN13 = "9780315367074",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303539025",
acknowledgement = acknhfb,
classification = "0537: Engineering",
dissertationthesisnumber = "ML36707",
subject = "Engineering",
}
mpU'3mi1E};mim inproceedingsdatacompression.bibAdelson:1987:OPTE. H. Adelson and E. Simoncelli and R. HingoraniProceedings SPIEOrthogonal Pyramid Transforms for Image Coe:oX '37MQ7#CQC7;e#7]kmastersthesisdatacompression.bibSchmidt:1986:SRCAlfred Rudolf SchmidtSecondary Range Compression for Improved Range / Doppler Processing of SAR Data with High SquintM.A.ScThe University of British ColumbiaVancouver, BC, Canadaxviii + 21319860315367075 OR 03153670759780315367074 OR 9780315367074Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303539025Engbi",
booktitle = "Proceedings SPIE",
title = "Orthogonal Pyramid Transforms for Image Coding",
publisher = "vol. 845",
address = "Cambridge, MA, USA",
pages = "5058",
month = oct,
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Adelson, E. H., E. Simoncelli, and R. Hingorani (1987)
``Orthogonal Pyramid Transforms for Image Coding,''
{\it Proceedings SPIE}, vol. 845, Cambridge, MA, pp.
5058, October.",
}dingvol. 845Cambridge, MA, USA5058oct101987Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsE. H. Adelson and E. Simoncelli and R. HingoraniProceedings SPIEOrthogonal Pyramid Transforms for Image Coding
@InProceedings{Adelson:1987:OPT,
author = "E. H. Adelson and E. Simoncelli and R. Hingorani",
booktitle = "Proceedings SPIE",
title = "Orthogonal Pyramid Transforms for Image Coding",
publisher = "vol. 845",
address = "Cambridge, MA, USA",
pages = "5058",
month = oct,
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Adelson, E. H., E. Simoncelli, and R. Hingorani (1987)
``Orthogonal Pyramid Transforms for Image Coding,''
{\it Proceedings SPIE}, vol. 845, Cambridge, MA, pp.
5058, October.",
}ImageManipulation Algorithm in the Image View
Facility",
journal = jIBMJRD,
volume = "31",
number = "1",
pages = "1631",
month = jan,
year = "1987",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
rawdata = "Anderson, K. L., et al., (1987)
``BinaryImageManipulation Algorithm in the Image View
Facility,'' {\it IBM Journal of Research and
Development}, {\bf31}(1):1631, January.",
}gorithm in the Image View Facility
@Article{Anderson:1987:BIM,
author = "K. L. Anderson and others",
title = "BinaryImageManipulation Algorithm in the Image View
Facility",
journal = jIBMJRD,
volume = "31",
number = "1",
pages = "1631",
month = jan,
year = "1987",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
rawdata = "Anderson, K. L., et al., (1987)
``BinaryImageManipulation Algorithm in the Image View
Facility,'' {\it IBM Journal of Research and
Development}, {\bf31}(1):1631, January.",
}
nqY3/? 57E};[? Aarticledatacompression.bibAnderson:1987:BIMK. L. Anderson and othersBinaryImageManipulation Algorithm in the Image View FacilityjIBMJRD3111631jan11987IBMJAE00188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 00188646Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIBM Journal of Research and Developmentackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520K. L. Anderson and othersBinaryImageManipulation Alg "Robust Transmission of Unbounded Strings {Using}
{Fibonacci} Representations",
journal = jIEEETRANSINFTHEORY,
volume = "33",
number = "2",
pages = "238245",
month = mar,
year = "1987",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Apostolico, Alberto and A. S. Fraenkel (1987) ``Robust
Transmission of Unbounded Strings Using Fibonacci
Representations,'' {\it IEEE Transactions on
Information Theory}, {\bf33}(2):238245, March.",
}ounded Strings {Using} {Fibonacci} Representations
@Article{Apostolico:1987:RTU,
author = "Alberto Apostolico and A. S. Fraenkel",
title = "Robust Transmission of Unbounded Strings {Using}
{Fibonacci} Representations",
journal = jIEEETRANSINFTHEORY,
volume = "33",
number = "2",
pages = "238245",
month = mar,
year = "1987",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Apostolico, Alberto and A. S. Fraenkel (1987) ``Robust
Transmission of Unbounded Strings Using Fibonacci
Representations,'' {\it IEEE Transactions on
Information Theory}, {\bf33}(2):238245, March.",
}
isX 3'+)%3E};+)Aphdthesisdatacompression.bibBell:1987:UTITimothy C. BellA Unifying Theory and Improvements for Existing Approaches to Text CompressionPh.D. ThesisDepartment of Computer Science, University of Canterbury, Christchurch, New Zealand1987Sat Jan 26 12:46:16 MST 2013http://www.math.m`rX33W;57E};[W%!articledatacompression.bibApostolico:1987:RTUAlberto Apostolico and A. S. FraenkelRobust Transmission of Unbounded Strings Using Fibonacci RepresentationsjIEEETRANSINFTHEORY332238245mar31987IETTAW00189448 (print), 15579654 (electronic) OR 00189448 (print), 15579654 (electronic)00189448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information TheoryackdsAlberto Apostolico and A. S. FraenkelRobust Transmission of Unbjand Improvements for Existing
Approaches to Text Compression",
type = "{Ph.D.} Thesis",
school = "Department of Computer Science, University of
Canterbury, Christchurch, New Zealand",
address = "????",
pages = "??",
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Bell, Timothy C. (1987) {\it A Unifying Theory and
Improvements for Existing Approaches to Text
Compression}, PhD thesis, Department of Computer
Science, University of Canterbury, Christchurch, New
Zealand.",
}utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsTimothy C. BellA Unifying Theory and Improvements for Existing Approaches to Text Compression
@PhdThesis{Bell:1987:UTI,
author = "Timothy C. Bell",
title = "A Unifying Theory and Improvements for Existing
Approaches to Text Compression",
type = "{Ph.D.} Thesis",
school = "Department of Computer Science, University of
Canterbury, Christchurch, New Zealand",
address = "????",
pages = "??",
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Bell, Timothy C. (1987) {\it A Unifying Theory and
Improvements for Existing Approaches to Text
Compression}, PhD thesis, Department of Computer
Science, University of Canterbury, Christchurch, New
Zealand.",
}Explained",
pages = "??",
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cis.udel.edu/~amer/CISC651/lzw.and.gif.explained.html",
acknowledgement = ackds,
rawdata = "Blackstock, Steve (1987) ``LZW and GIF Explained,''
available from\hfil\break
http://www.cis.udel.edu/~amer/CISC651/lzw.and.gif.explained.html.",
}
""ZtV 337E};
?;miscdatacompression.bibBlackstock:1987:LGESteve BlackstockLZW and GIF Explained1987Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSThttp://www.cis.udel.edu/~amer/CISC651/lzw.and.gif.explained.htmlackdsSteve Blackstock{LZW} and {GIF} Explained
@Misc{Blackstock:1987:LGE,
author = "Steve Blackstock",
title = "{LZW} and {GIF} Explained",
pages = "??",
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cis.udel.edu/~amer/CISC651/lzw.and.gif.explained.html",
acknowledgement = ackds,
rawdata = "Blackstock, Steve (1987) ``LZW and GIF Explained,''
available from\hfil\break
http://www.cis.udel.edu/~amer/CISC651/lzw.and.gif.explained.html.",
}Data Compression",
journal = jAUSTRALIANCOMPJ,
volume = "19",
number = "2",
pages = "6468",
month = may,
year = "1987",
CODEN = "ACMJB2",
ISSN = "00048917",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Australian Computer Journal",
rawdata = "Brent, R. P. (1987) ``A linear Algorithm for Data
Compression,'' {\it Australian Computer Journal},
{\bf19}(2):6468, May.",
}ar Algorithm for Data CompressionjAUSTRALIANCOMPJ1926468may51987ACMJB200048917 OR 00048917Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTAustralian Computer JournalackdsR. P. BrentA linear Algorithm for Data Compression
@Article{Brent:1987:LAD,
author = "R. P. Brent",
title = "A linear Algorithm for Data Compression",
journal = jAUSTRALIANCOMPJ,
volume = "19",
number = "2",
pages = "6468",
month = may,
year = "1987",
CODEN = "ACMJB2",
ISSN = "00048917",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Australian Computer Journal",
rawdata = "Brent, R. P. (1987) ``A linear Algorithm for Data
Compression,'' {\it Australian Computer Journal},
{\bf19}(2):6468, May.",
}
iiiw\ 3'!]57CS;
5Y[[)eO#!Marticledatacompression.bibCole:1987:CTRA. J. ColeCompaction Techniques for Raster Scan Graphics Using SpaceFilling CurvesjCOMPJ3018792feb21987CMPJA6http://dx.doi.org/10.1093/comjnxWvW '3'5s5;CQC7;e#5s=mastersthesisdatacompression.bibChan:1987:NSTBarry Wai Kwong ChanA new subwordtree based data compression algorithmThesis (M.Sc.)(C.S.)School of Computer Science, The University of New BrunswickFredericton, NB, Canada19870315352124 OR 03153521249780315352124 OR 9780315352124Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompresstuU 3)#[37E};C#[Iarticledatacompression.bibBrent:1987:LADR. P. BrentA lineqwordtree based data compression algorithm",
type = "Thesis {(M.Sc.)(C.S.)}",
school = "School of Computer Science, The University of New
Brunswick",
address = "Fredericton, NB, Canada",
pages = "????",
year = "1987",
ISBN = "0315352124",
ISBN13 = "9780315352124",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303653948",
acknowledgement = acknhfb,
classification = "0537: Engineering",
dissertationthesisnumber = "ML35212",
subject = "Engineering",
}ion.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303653948EngineeringacknhfbBarry Wai Kwong ChanA new subwordtree based data compression algorithm
@MastersThesis{Chan:1987:NST,
author = "Barry Wai Kwong Chan",
title = "A new subwordtree based data compression algorithm",
type = "Thesis {(M.Sc.)(C.S.)}",
school = "School of Computer Science, The University of New
Brunswick",
address = "Fredericton, NB, Canada",
pages = "????",
year = "1987",
ISBN = "0315352124",
ISBN13 = "9780315352124",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303653948",
acknowledgement = acknhfb,
classification = "0537: Engineering",
dissertationthesisnumber = "ML35212",
subject = "Engineering",
}v Raster Scan Graphics Using
SpaceFilling Curves",
journal = jCOMPJ,
volume = "30",
number = "1",
pages = "8792",
month = feb,
year = "1987",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/30.1.87",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:48:22 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/30/1/87.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/87.tif;
w http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/88.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/89.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/90.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/91.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/92.tif",
acknowledgement = acknhfb,
affiliation = "Univ of St. Andrews, St. Andrews, Scotl",
affiliationaddress = "Univ of St. Andrews, St. Andrews, Scotl",
classcodes = "C4130 (Interpolation and function approximation);
C6130B (Graphics techniques)",
classification = "723",
corpsource = "Dept. of Comput. Sci., St. Andrews Univ., UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "codes, symbolic  Encoding; compaction techniques;
computation; computational geometry; computer graphics;
curve fitting; data compression; graphics; Hilbert
space; image processing; Peano space; quadtree coding;
raster scan; raster scan graphics; spacefilling
curves; spacefilling polygons",
treatment = "P Practical",
}yl/30.1.8700104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Tue Dec 4 14:48:22 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/30/1.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/2012.12.04 14:48:22 MSThttp://comjnl.oxfordjournals.org/content/30/1/87.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/87.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/88.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/89.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/90.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/91.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/92.tifThe Computer Journalcodes, symbolic  Encoding; comzpaction techniques; computation; computational geometry; computer graphics; curve fitting; data compression; graphics; Hilbert space; image processing; Peano space; quadtree coding; raster scan; raster scan graphics; spacefilling curves; spacefilling polygonsacknhfbUniv of St. Andrews, St. Andrews, ScotlUniv of St. Andrews, St. Andrews, ScotlC4130 (Interpolation and function approximation); C6130B (Graphics techniques)Dept. of Comput. Sci., St. Andrews Univ., UKhttp://comjnl.oxfordjournals.org/P PracticalA. J. ColeCompaction Techniques for Raster Scan Graphics Using SpaceFilling Curves
@Article{Cole:1987:CTR,
author = "A. J. Cole",
title = "Compaction Techniques for Raster Scan Graphics Using
SpaceFilling Curves",
journal = jCOMPJ,
volume = "30",
number = "1",
pages = "8792",
month = feb,
year = "1987",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/30.1.87",
ISSN = "0010{4620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:48:22 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/30/1/87.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/87.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/88.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/89.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/90.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/91.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/92.tif",
acknowledgement = acknhfb,
affiliation = "Univ of St. Andrews, St. Andrews, Scotl",
affiliationaddress = "Univ of St. Andrews, St. Andrews, Scotl",
classcodes = "C4130 (Interpolation and function approximation);
C6130B (Graphics techniques)",
classification = "723",
corpsource = "Dept. of Comput. Sci., St. Andrews Univ., UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "codes, symbolic  Encoding; compaction techniques;
computation; computational geometry; computer graphics;
curve fitting; data compression; graphics; Hilbert
space; image processing; Peano space; quadtree coding;
raster scan; raster scan graphics; spacefilling
curves; spacefilling polygons",
treatment = "P Practical",
}}Compression Using Dynamic {Markov} {Modelling}",
journal = jCOMPJ,
volume = "30",
number = "6",
pages = "541550",
month = dec,
year = "1987",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/30.6.541",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://comjnl.oxfordjournals.org/content/30/6.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/",
URL = "http://comjnl.oxfordjournals.org/content/30/6/541.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/541.~tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/542.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/543.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/544.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/545.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/546.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/547.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/548.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/549.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/550.tif",
acknowledgement = ackds # " and " # acknhfb,
affiliation = "Univ of Waterloo, Waterloo, Ont, Can",
affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can",
classcodes = "B6110 (Information theory); B6120B (Codes); B6140
(Signal processing and detection); C1140Z (Other and
miscellaneous); C1260 (Information theory); C6130 (Data
handling techniques)",
classification = "723; 922",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "arithmetic coding; binary messages; codes, symbolic;
data compression; dynamic Markov modelling; encoding;
Encoding; Guazzo; information theory  Data
Compression; Markov chain models; Markov processes;
probability  Random Processes",
rawdata = "Cormack G. V., and R. N. S. Horspool (1987) ``Data
Compression Using Dynamic Markov Modelling,'' {\it The
Computer Journal}, {\bf30}(6):541550.",
treatment = "T Theoretical or Mathematical",
}electronic)00104620 OR 00104620Sat Jan 26 12:46:16 MST 2013Compendex database; Database/Wiederhold.bib; http://comjnl.oxfordjournals.org/content/30/6.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/2013.01.26 12:46:16 MSThttp://comjnl.oxfordjournals.org/content/30/6/541.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/541.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/542.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/543.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/544.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/545.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/546.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/547.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/548.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/549.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/550.tifThe Computer Journalarithmetic coding; binary messages; codes, symbolic; data compression; dynamic Markov modelling; encoding; Encoding; Guazzo; information theory  Data Compression; Markov chain models; Markov processes; probability  Random ProcessesackdsUniv of Waterloo, Waterloo, Ont, CanUniv of Waterloo, Waterloo, Ont, CanB6110 (Information theory); B6120B (Codes); B6140 (Signal processing and detection); C1140Z (Other and miscellaneous); C1260 (Information theory); C6130 (Data handling techniques)Dept. of Comput. Sci., Waterloo Univ., Ont., Canadahttp://comjnl.oxfordjournals.org/T Theoretical or MathematicalG. V. Cormack and R. N. S. HorspoolData Compression Using Dynamic {Markov} {Modelling}
@Article{Cormack:1987:DCU,
author = "G. V. Cormack and R. N. S. Horspool",
title = "Data Compression Using Dynamic {Markov} {Modelling}",
journal = jCOMPJ,
volume = "30",
number = "6",
pages = "541550",
month = dec,
year = "1987",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/30.6.541",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://comjnl.oxfordjournals.org/content/30/6.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/",
URL = "http://comjnl.oxfordjournals.org/content/30/6/541.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/541.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/542.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/543.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/544.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/545.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/546.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/547.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/548.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/549.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/550.tif",
acknowledgement = ackds # " and " # acknhfb,
affiliation = "Univ of Waterloo, Waterloo, Ont, Can",
affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can",
classcodes = "B6110 (Information theory); B6120B (Codes); B6140
(Signal processing and detection); C1140Z (Other and
miscellaneous); C1260 (Information theory); C6130 (Data
handling techniques)",
classification = "723; 922",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "arithmetic coding; binary messages; codes, symbolic;
data compression; dynamic Markov modelling; encoding;
Encoding; Guazzo; information theory  Data
Compression; Markov chain models; Markov processes;
probability  Random Processes",
rawdata = "Cormack G. V., and R. N. S. Horspool (1987) ``Data
Compression Using Dynamic Markov Modelling,'' {\it The
Computer Journal}, {\bf30}(6):541550.",
treatment = "T Theoretical or Mathematical",
}
==CyW31Ia=57=W;5)wIaWarticledatacompression.bibEinarsson:1987:DCDGoran Einarsson and Goran RothData compression of digital color picturesjCOMPUTERSANDGRAPHICS1144094261987COGRD200978493 (print), 18737684 (electronic) OR 00978493 (print), 18737684 (electronic)00978493 OR 00978493Mon Feb 13 17:22:01 2012Graphics/imager/imager.87.bib; Graphics/siggraph/87.bib; http://www.math.utah.edu/pub/tex/bib/compgraph.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2012.02.13 17:22:01 ???Computers & GrapXxZ3Sk_57E;{5gUUssOGSsG
articledatacompression.bibCormack:1987:DCUG. V. Cormack and R. N. S. HorspoolData Compression Using Dynamic Markov ModellingjCOMPJ306541550dec121987CMPJA6http://dx.doi.org/10.1093/comjnl/30.6.54100104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (Data compression of digital color pictures",
journal = jCOMPUTERSANDGRAPHICS,
volume = "11",
number = "4",
pages = "409426",
year = "1987",
CODEN = "COGRD2",
ISSN = "00978493 (print), 18737684 (electronic)",
ISSNL = "00978493",
bibdate = "Mon Feb 13 17:22:01 2012",
bibsource = "Graphics/imager/imager.87.bib;
Graphics/siggraph/87.bib;
http://www.math.utah.edu/pub/tex/bib/compgraph.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "Computers \& Graphics",
journalURL = "http://www.sciencedirect.com/science/journal/00978493",
keywords = "color encoding",
}hicscolor encodingacknhfbhttp://www.sciencedirect.com/science/journal/00978493Goran Einarsson and Goran RothData compression of digital color pictures
@Article{Einarsson:1987:DCD,
author = "Goran Einarsson and Goran Roth",
title = "Data compression of digital color pictures",
journal = jCOMPUTERSANDGRAPHICS,
volume = "11",
number = "4",
pages = "409426",
year = "1987",
CODEN = "COGRD2",
ISSN = "00978493 (print), 18737684 (electronic)",
ISSNL = "00978493",
bibdate = "Mon Feb 13 17:22:01 2012",
bibsource = "Graphics/imager/imager.87.bib;
Graphics/siggraph/87.bib;
http://www.math.utah.edu/pub/tex/bib/compgraph.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "Computers \& Graphics",
journalURL = "http://www.sciencedirect.com/science/journal/00978493",
keywords = "color encoding",
} and VariableLength Coding of
Digital Pictures",
journal = jIEEETRANSCOMM,
volume = "COM35",
number = "6",
pages = "671677",
month = jun,
year = "1987",
CODEN = "IECMBT",
ISSN = "00906778 (print), 15580857 (electronic)",
ISSNL = "00906778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Gharavi, H. (1987) ``Conditional RunLength and
VariableLength Coding of Digital Pictures,'' {\it IEEE
Transactions on Communications}, {\bf
COM35}(6):671677, June.",
}MSTIEEE Transactions on CommunicationsackdsH. GharaviConditional RunLength and VariableLength Coding of Digital Pictures
@Article{Gharavi:1987:CRL,
author = "H. Gharavi",
title = "Conditional RunLength and VariableLength Coding of
Digital Pictures",
journal = jIEEETRANSCOMM,
volume = "COM35",
number = "6",
pages = "671677",
month = jun,
year = "1987",
CODEN = "IECMBT",
ISSN = "00906778 (print), 15580857 (electronic)",
ISSNL = "00906778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Gharavi, H. (1987) ``Conditional RunLength and
VariableLength Coding of Digital Pictures,'' {\it IEEE
Transactions on Communications}, {\bf
COM35}(6):671677, June.",
}
'{X3'e3'CQ3EI;Se3Abookdatacompression.bibHeld:1987:DCTGilbert Held and Thomas (Thomas R.) MarshallData compression: techniques and applications: hardware and software considerationspubWILEYpubWILEY:adrSecondxii + 20619870471912808 OR 04719128089780471912804 OR 9780471912804QA76.9.D33 H44 1987Mon Jan 28 15:18:45 MST 2MzX 3!/57E};S!articledatacompression.bibGharavi:1987:CRLH. GharaviConditional RunLength and VariableLength Coding of Digital PicturesjIEEETRANSCOMMCOM356671677jun61987IECMBT00906778 (print), 15580857 (electronic) OR 00906778 (print), 15580857 (electronic)00906778 OR 00906778Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 "Data compression: techniques and applications:
hardware and software considerations",
publisher = pubWILEY,
address = pubWILEY:adr,
edition = "Second",
pages = "xii + 206",
year = "1987",
ISBN = "0471912808",
ISBN13 = "9780471912804",
LCCN = "QA76.9.D33 H44 1987",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "cliodb.cc.columbia.edu:7090/Voyager;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
subject = "Data compression (Computer science)",
}013cliodb.cc.columbia.edu:7090/Voyager; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.28 15:18:45 MSTData compression (Computer science)acknhfbGilbert Held and Thomas (Thomas R.) MarshallData compression: techniques and applications: hardware and software considerations
@Book{Held:1987:DCT,
author = "Gilbert Held and Thomas (Thomas R.) Marshall",
title = "Data compression: techniques and applications:
hardware and software considerations",
publisher = pubWILEY,
address = pubWILEY:adr,
edition = "Second",
pages = "xii + 206",
year = "1987",
ISBN = "0471912808",
ISBN13 = "9780471912804",
LCCN = "QA76.9.D33 H44 1987",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "cliodb.cc.columbia.edu:7090/Voyager;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
subject = "Data compression (Computer science)",
} "Data Compression",
journal = jCOMPSURV,
volume = "19",
number = "3",
pages = "261296",
month = sep,
year = "1987",
CODEN = "CMSVAN",
DOI = "http://doi.acm.org/10.1145/45072.45074",
ISSN = "03600300 (print), 15577341 (electronic)",
ISSNL = "03600300",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "ACM Computing Archive;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
http://www.acm.org/pubs/contents/journals/surveys/;
http://www.math.utah.edu/pub/tex/bib/compsurv.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprinted in Japanese BIT Special issue in Computer
Science (1989), 16195.",
URL = "http://www.acm.org/pubs/toc/Abstracts/03600300/45074.html;
http://www.ics.uci.edu/~dan/pubs/DataCompression.html",
abstract = "This paper surveys a variety of data compression
methods spanning almost 40 years of research, from the
work of Shannon, Fano, and Huffman in the late 1940s to
a technique developed in 1986. The aim of data
compression is to reduce redundancy in stored or
communicated data, thus increasing effective data
density. Data compression has important application in
the areas of file storage and distributed systems.
Concepts from information theory as they relate to the
goals and evaluation of data compression methods are
discussed briefly. A framework for evaluation and
comparison of methods is constructed and applied to the
algorithms presented. Comparisons of both theoretical
and empirical natures are reported, and possibilities
for future research are suggested.",
acknowledgement = ackds # " and " # acknhfb,
annote = "Reviews techniques that are reversible.",
fjournal = "ACM Computing Surveys",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "adaptive coding; algorithms; data compression; Huffman
coding; text compression; theory",
rawdata = "Lelewer, D. A., and D. S. Hirschberg (1987) ``Data
compression,'' {\it Computing Surveys} {\bf19},3,
261297. Reprinted in Japanese BIT Special issue in
Computer Science (1989), 16195. Available in HTML at
http://www.ics.uci.edu/~dan/pubs/DataCompression.html.",
review = "ACM CR 89020069",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf H.3.2}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Storage. {\bf D.4.3}: Software, OPERATING SYSTEMS, File
Systems Management, Distributed file systems.",
}261296sep91987CMSVANhttp://doi.acm.org/10.1145/45072.4507403600300 (print), 15577341 (electronic) OR 03600300 (print), 15577341 (electronic)03600300 OR 03600300Sat Jan 26 12:46:09 MST 2013ACM Computing Archive; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; http://www.acm.org/pubs/contents/journals/surveys/; http://www.math.utah.edu/pub/tex/bib/compsurv.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:09 MSTReprinted in Japanese BIT Special issue in Computer Science (1989), 16195.http://www.acm.org/pubs/toc/Abstracts/03600300/45074.html; http://www.ics.uci.edu/~dan/pubs/DataCompression.htmlThis paper surveys a variety of data compression methods spanning almost 40 years of research, from the work of Shannon, Fano, and Huffman in the late 1940s to a technique developed in 1986. The aim of data compression is to reduce redundancy in stored or communicated data, thus increasing effective data density. Data compression has important application in the areas of file storage and distributed systems. Concepts from information theory as they relate to the goals and evaluation of data compression methods are discussed briefly. A framework for evaluation and comparison of methods is constructed and applied to the algorithms presented. Comparisons of both theoretical and empirical natures are reported, and possibilities for future research are suggested.ACM Computing Surveysadaptive coding; algorithms; data compression; Huffman coding; text compression; theorybf E.4: Data, CODING AND INFORMATION THEORY, Data compaction and compression. bf H.3.2: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Storage. bf D.4.3: Software, OPERATING SYSTEMS, File Systems Management, Distributed file systems.ackdsReviews techniques that are reversible.http://portal.acm.org/browse_dl.cfm?idx=J204This paper surveys a variety of data compression methods spanning almost 40 years of research, from the work of Shannon, Fano, and Huffman in the late 1940s to a technique developed in 1986. The aim of data compression is to reduce redundancy in stored or communicated data, thus increasing effective data density. Data compression has important application in the areas of file storage and distributed systems. Concepts from information theory as they relate to the goals and evaluation of data compression methods are discussed briefly. A framework for evaluation and comparison of methods is constructed and applied to the algorithms presented. Comparisons of both theoretical and empirical natures are reported, and possibilities for future research are suggested.Debra A. Lelewer and Daniel S. HirschbergReprinted in Japanese BIT Special issue in Computer Science (1989), 16195.Data Compression
@Article{Lelewer:1987:DC,
author = "Debra A. Lelewer and Daniel S. Hirschberg",
title = "Data Compression",
journal = jCOMPSURV,
volume = "19",
number = "3",
pages = "261296",
month = sep,
year = "1987",
CODEN = "CMSVAN",
DOI = "http://doi.acm.org/10.1145/45072.45074",
ISSN = "03600300 (print), 15577341 (electronic)",
ISSNL = "03600300",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "ACM Computing Archive;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
http://www.acm.org/pubs/contents/journals/surveys/;
http://www.math.utah.edu/pub/tex/bib/compsurv.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprinted in Japanese BIT Special issue in Computer
Science (1989), 16195.",
URL = "http://www.acm.org/pubs/toc/Abstracts/03600300/45074.html;
http://www.ics.uci.edu/~dan/pubs/DataCompression.html",
abstract = "This paper surveys a variety of data compression
methods spanning almost 40 years of research, from the
work of Shannon, Fano, and Huffman in the late 1940s to
a technique developed in 1986. The aim of data
compression is to reduce redundancy in stored or
communicated data, thus increasing effective data
density. Data compression has important application in
the areas of file storage and distributed systems.
Concepts from information theory as they relate to the
goals and evaluation of data compression methods are
discussed briefly. A framework for evaluation and
comparison of methods is constructed and applied to the
algorithms presented. Comparisons of both theoretical
and empirical natures are reported, and possibilities
for future research are suggested.",
acknowledgement = ackds # " and " # acknhfb,
annote = "Reviews techniques that are reversible.",
fjournal = "ACM Computing Surveys",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "adaptive coding; algorithms; data compression; Huffman
coding; text compression; theory",
rawdata = "Lelewer, D. A., and D. S. Hirschberg (1987) ``Data
compression,'' {\it Computing Surveys} {\bf19},3,
261297. Reprinted in Japanese BIT Special issue in
Computer Science (1989), 16195. Available in HTML at
http://www.ics.uci.edu/~dan/pubs/DataCompression.html.",
review = "ACM CR 89020069",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf H.3.2}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Storage. {\bf D.4.3}: Software, OPERATING SYSTEMS, File
Systems Management, Distributed file systems.",
}
z(z}[ 31+_57CS;K5QQ;WOa+Qarticledatacompression.bibLlewellyn:1987:DCSJ. A. LlewellynData Compressio8^3+_#Y57Em;%o
7; [e
_%C$articledatacompression.bibLelewer:1987:DCDebra A. Lelewer and Daniel S. HirschbergData CompressionjCOMPSURV193n for a Source with {Markov}
Characteristics",
journal = jCOMPJ,
volume = "30",
number = "2",
pages = "149156",
month = apr,
year = "1987",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/30.2.149",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:48:22 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/30/2/149.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/149.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/150.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/151.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/152.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/153.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/154.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/155.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/156.tif",
acknowledgement = acknhfb,
affiliation = "Univ of Lancaster, Lancaster, Engl",
affiliationaddress = "Univ of Lancaster, Lancaster, Engl",
classcodes = "B0240Z (Other and miscellaneous); B6120B (Codes);
B6140 (Signal processing and detection); C1140Z (Other
and miscellaneous); C1260 (Information theory)",
classification = "723; 922",
corpsource = "Dept. of Comput., Lancaster Univ., UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "average; average code/source ratio; code symbols;
code/source ratio; codes, symbolic  Encoding; coding
transformation; data compression; Data Compression;
encoding; encoding transformation; entropy; finite;
Huffman method; information source; information theory;
Markov characteristics; Markov processes; probability;
source coding; source strings; source with Markov
characteristics; state models; statistical structure;
symbol groups; zero probability",
treatment = "P Practical; T Theoretical or Mathematical",
}n for a Source with Markov CharacteristicsjCOMPJ302149156apr41987CMPJA6http://dx.doi.org/10.1093/comjnl/30.2.14900104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Tue Dec 4 14:48:22 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/30/2.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/2012.12.04 14:48:22 MSThttp://comjnl.oxfordjournals.org/content/30/2/149.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/149.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/150.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/151.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/152.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/153.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/154.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/155.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/156.tifThe Computer Journalaverage; average code/source ratio; code symbols; code/source ratio; codes, symbolic  Encoding; coding transformation; data compression; Data Compression; encoding; encoding transformation; entropy; finite; Huffman method; information source; information theory; Markov characteristics; Markov processes; probability; source coding; source strings; source with Markov characteristics; state models; statistical structure; symbol groups; zero probabilityacknhfbUniv of Lancaster, Lancaster, EnglUniv of Lancaster, Lancaster, EnglB0240Z (Other and miscellaneous); B6120B (Codes); B6140 (Signal processing and detection); C1140Z (Other and miscellaneous); C1260 (Information theory)Dept. of Comput., Lancaster Univ., UKhttp://comjnl.oxfordjournals.org/P Practical; T Theoretical or MathematicalJ. A. LlewellynData Compression for a Source with {Markov} Characteristics
@Article{Llewellyn:1987:DCS,
author = "J. A. Llewellyn",
title = "Data Compression for a Source with {Markov}
Characteristics",
journal = jCOMPJ,
volume = "30",
number = "2",
pages = "149156",
month = apr,
year = "1987",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/30.2.149",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:48:22 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/30/2/149.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/149.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/150.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/151.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/152.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/153.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/154.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/155.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/156.tif",
acknowledgement = acknhfb,
affiliation = "Univ of Lancaster, Lancaster, Engl",
affiliationaddress = "Univ of Lancaster, Lancaster, Engl",
classcodes = "B0240Z (Other and miscellaneous); B6120B (Codes);
B6140 (Signal processing and detection); C1140Z (Other
and miscellaneous); C1260 (Information theory)",
classification = "723; 922",
corpsource = "Dept. of Comput., Lancaster Univ., UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "average; average code/source ratio; code symbols;
code/source ratio; codes, symbolic  Encoding; coding
transformation; data compression; Data Compression;
encoding; encoding transformation; entropy; finite;
Huffman method; information source; information theory;
Markov characteristics; Markov processes; probability;
source coding; source strings; source with Markov
characteristics; state models; statistical structure;
symbol groups; zero probability",
treatment = "P Practical; T Theoretical or Mathematical",
}uments using compressed indexes
of arrays of small {Bloom} filters",
journal = jCOMPJ,
volume = "30",
number = "4",
pages = "343348",
month = aug,
year = "1987",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/30.4.343",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:48:23 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/4.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/30/4/343.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/343.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/344.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/345.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/346.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/347.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/348.tif",
acknowledgement = acknhfb,
affiliation = "Univ of Western Ontario, London, Ont, Can",
affiliationaddress = "Univ of Western Ontario, London, Ont, Can",
classcodes = "C7240 (Information analysis and indexing); C7250L
(Nonbibliographic systems)",
classification = "723; 903",
corpsource = "Dept. of Comput. Sci., Univ. of Western Ontario,
London, Ont., Canada",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "compressed indexes; computer systems, digital 
Parallel Processing; data compression; data processing
 File Organization; document access; indexing;
Information Retrieval; information retrieval;
information science; large; large text files; parallel
processing; small bloom filters; small Bloom filters;
text accessing; text files; textual documents;
variablesized documents; words",
treatment = "P Practical",
}tacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/2012.12.04 14:48:23 MSThttp://comjnl.oxfordjournals.org/content/30/4/343.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/343.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/344.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/345.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/346.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/347.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/348.tifThe Computer Journalcompressed indexes; computer systems, digital  Parallel Processing; data compression; data processing  File Organization; document access; indexing; Information Retrieval; information retrieval; information science; large; large text files; parallel processing; small bloom filters; small Bloom filters; text accessing; text files; textual documents; variablesized documents; wordsacknhfbUniv of Western Ontario, London, Ont, CanUniv of Western Ontario, London, Ont, CanC7240 (Information analysis and indexing); C7250L (Nonbibliographic systems)Dept. of Comput. Sci., Univ. of Western Ontario, London, Ont., Canadahttp://comjnl.oxfordjournals.org/P PracticalJ. K. MullinAccessing textual documents using compressed indexes of arrays of small {Bloom} filters
@Article{Mullin:1987:ATD,
author = "J. K. Mullin",
title = "Accessing textual documents using compressed indexes
of arrays of small {Bloom} filters",
journal = jCOMPJ,
volume = "30",
number = "4",
pages = "343348",
month = aug,
year = "1987",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/30.4.343",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:48:23 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/4.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/30/4/343.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/343.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/344.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/345.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/346.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/347.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/348.tif",
acknowledgement = acknhfb,
affiliation = "Univ of Western Ontario, London, Ont, Can",
affiliationaddress = "Univ of Western Ontario, London, Ont, Can",
classcodes = "C7240 (Information analysis and indexing); C7250L
(Nonbibliographic systems)",
classification = "723; 903",
corpsource = "Dept. of Comput. Sci., Univ. of Western Ontario,
London, Ont., Canada",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "compressed indexes; computer systems, digital 
Parallel Processing; data compression; data processing
 File Organization; document access; indexing;
Information Retrieval; information retrieval;
information science; large; large text files; parallel
processing; small bloom filters; small Bloom filters;
text accessing; text files; textual documents;
variablesized documents; words",
treatment = "P Practical",
}
ppx~] 3+%7_57CS;5__'O#%;iarticledatacompression.bibMullin:1987:ATDJ. K. MullinAccessing textual documents using compressed indexes of arrays of small Bloom filtersjCOMPJ304343348aug81987CMPJA6http://dx.doi.org/10.1093/comjnl/30.4.34300104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Tue Dec 4 14:48:23 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/30/4.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www.math.utah.edu/pub/tex/bib/da} Archiving Utilities",
journal = jDDJ,
volume = "12",
number = "3",
pages = "2628, 30",
month = mar,
year = "1987",
CODEN = "DDJOEB",
ISSN = "08883076",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "723",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools",
keywords = "arc archiving utility; computer operating systems;
data processing; File Organization; file sets;
information theory  Data Compression",
}ms; data processing; File Organization; file sets; information theory  Data CompressionacknhfbDr Dobb's J Software ToolsRussell Nelson{ARC} Wars: {MSDOS} Archiving Utilities
@Article{Nelson:1987:AWM,
author = "Russell Nelson",
title = "{ARC} Wars: {MSDOS} Archiving Utilities",
journal = jDDJ,
volume = "12",
number = "3",
pages = "2628, 30",
month = mar,
year = "1987",
CODEN = "DDJOEB",
ISSN = "08883076",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "723",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools",
keywords = "arc archiving utility; computer operating systems;
data processing; File Organization; file sets;
information theory  Data Compression",
}
??5W 3+)U!7C%;UA)]!articledatacompression.bibNelson:1987:AWMRussell NelsonARC Wars: MSDOS Archiving UtilitiesjDDJ1232628, 30mar31987DDJOEB08883076 OR 08883076Thu Jan 9 09:35:43 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.01.09 09:35:43 MSTDr. Dobb's Journal of Software Toolsarc archiving utility; computer operating systerocessing",
publisher = pubMCGRAWHILL,
address = pubMCGRAWHILL:adr,
pages = "??",
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Parsons, Thomas W. (1987) {\it Voice and Speech
Processing}, New York, McGrawHill.",
}
fU 3/C+3E};/Cbookdatacompression.bibParsons:1987:VSPThomas W. ParsonsVoice and Speech ProcessingpubMCGRAWHILLpubMCGRAWHILL:adr1987Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsThomas W. ParsonsVoice and Speech Processing
@Book{Parsons:1987:VSP,
author = "Thomas W. Parsons",
title = "Voice and Speech Processing",
publisher = pubMCGRAWHILL,
address = pubMCGRAWHILL:adr,
pages = "??",
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Parsons, Thomas W. (1987) {\it Voice and Speech
Processing}, New York, McGrawHill.",
}le Compression",
journal = jCOMPJ,
volume = "30",
number = "1",
pages = "8086",
month = feb,
year = "1987",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/30.1.80",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:48:22 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/30/1/80.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/80.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/81.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/82.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/83.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/84.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/85.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/86.tif",
acknowledgement = acknhfb,
affiliation = "Univ of Turku, Turku, Finl",
affiliationaddress = "Univ of Turku, Turku, Finl",
classcodes = "C5320C (Storage on moving magnetic media); C6120 (File
organisation); C6130 (Data handling techniques)",
classification = "723",
corpsource = "Dept. of Comput. Sci., Turku Univ., Finland",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "computer operating systems  Storage Allocation;
data compression; data processing; DEC2060; directory
pages; disc files; disk files; file compression; file
organisation; File Organization; information theory 
Data Compression; magnetic disc storage; text
compression; university use",
treatment = "P Practical",
}(print), 14602067 (electronic)00104620 OR 00104620Tue Dec 4 14:48:22 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/30/1.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/2012.12.04 14:48:22 MSThttp://comjnl.oxfordjournals.org/content/30/1/80.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/80.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/81.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/82.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/83.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/84.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/85.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/86.tifThe Computer Journalcomputer operating systems  Storage Allocation; data compression; data processing; DEC2060; directory pages; disc files; disk files; file compression; file organisation; File Organization; information theory  Data Compression; magnetic disc storage; text compression; university useacknhfbUniv of Turku, Turku, FinlUniv of Turku, Turku, FinlC5320C (Storage on moving magnetic media); C6120 (File organisation); C6130 (Data handling techniques)Dept. of Comput. Sci., Turku Univ., Finlandhttp://comjnl.oxfordjournals.org/P PracticalT. RaitaAn Automatic System for File Compression
@Article{Raita:1987:ASF,
author = "T. Raita",
title = "An Automatic System for File Compression",
journal = jCOMPJ,
volume = "30",
number = "1",
pages = "8086",
month = feb,
year = "1987",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/30.1.80",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:48:22 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/30/1/80.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/80.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/81.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/82.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/83.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/84.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/85.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/86.tif",
acknowledgement = acknhfb,
affiliation = "Univ of Turku, Turku, Finl",
affiliationaddress = "Univ of Turku, Turku, Finl",
classcodes = "C5320C (Storage on moving magnetic media); C6120 (File
organisation); C6130 (Data handling techniques)",
classification = "723",
corpsource = "Dept. of Comput. Sci., Turku Univ., Finland",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "computer operating systems  Storage Allocation;
data compression; data processing; DEC2060; directory
pages; disc files; disk files; file compression; file
organisation; File Organization; information theory 
Data Compression; magnetic disc storage; text
compression; university use",
treatment = "P Practical",
}
Z 3)]]57CS;#5MAAYcO#]
articledatacompression.bibRaita:1987:ASFT. RaitaAn Automatic System for File CompressionjCOMPJ3018086feb21987CMPJA6http://dx.doi.org/10.1093/comjnl/30.1.8000104620 (print), 14602067 (electronic) OR 00104620 ctive Test Compression by Hashing",
crossref = "Yu:1987:RDI",
pages = "223233",
year = "1987",
bibdate = "Tue Jul 19 08:43:39 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = acknhfb,
}
kV'3);Y#=[;;Yyinproceedingsdatacompression.bibRaite:1987:PTCT. Raita and J. TeuholaPredictive Test Compression by HashingYu:1987:RDI2232331987Tue Jul 19 08:43:39 1994http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib1994.07.19 08:43:39 ???acknhfbT. Raita and J. TeuholaPredictive Test Compression by Hashing
@InProceedings{Raite:1987:PTC,
author = "T. Raita and J. Teuhola",
title = "Predictive Test Compression by Hashing",
crossref = "Yu:1987:RDI",
pages = "223233",
year = "1987",
bibdate = "Tue Jul 19 08:43:39 1994",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = acknhfb,
}ve Source Models for Data Compression",
type = "{Ph.D.} thesis",
school = "University of Notre Dame",
address = "Notre Dame, IN, USA",
pages = "162",
year = "1987",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303617541",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8712954",
subject = "Electrical engineering",
}Notre DameNotre Dame, IN, USA1621987Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/303617541Electrical engineeringacknhfbTenkasi V. RamabadranAdaptive Source Models for Data Compression
@PhdThesis{Ramabadran:1987:ASM,
author = "Tenkasi V. Ramabadran",
title = "Adaptive Source Models for Data Compression",
type = "{Ph.D.} thesis",
school = "University of Notre Dame",
address = "Notre Dame, IN, USA",
pages = "162",
year = "1987",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303617541",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8712954",
subject = "Electrical engineering",
}
//^X 3%/
%?/C7;e/
phdthesisdatacompression.bibRoy:1987:CESBimal Chandra RoyCompression of Equally Spaced Digital Elevation Model (Dem) DataPh.D. thesisThe O[V 337c%=3C7;e97cphdthesisdatacompression.bibRamabadran:1987:ASMTenkasi V. RamabadranAdaptive Source Models for Data CompressionPh.D. thesisUniversity of ually Spaced Digital Elevation Model
(Dem) Data",
type = "{Ph.D.} thesis",
school = "The Ohio State University",
address = "Columbus, OH, USA",
pages = "268",
year = "1987",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303501021",
acknowledgement = acknhfb,
classification = "0370: Earth",
dissertationthesisnumber = "8726719",
subject = "Earth",
}hio State UniversityColumbus, OH, USA2681987Fri Feb 1 08:42:55 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 08:42:55 MSThttp://search.proquest.com/docview/303501021EarthacknhfbBimal Chandra RoyCompression of Equally Spaced Digital Elevation Model (Dem) Data
@PhdThesis{Roy:1987:CES,
author = "Bimal Chandra Roy",
title = "Compression of Equally Spaced Digital Elevation Model
(Dem) Data",
type = "{Ph.D.} thesis",
school = "The Ohio State University",
address = "Columbus, OH, USA",
pages = "268",
year = "1987",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303501021",
acknowledgement = acknhfb,
classification = "0370: Earth",
dissertationthesisnumber = "8726719",
subject = "Earth",
} Cormack",
title = "Comments to: {``A locally adaptive data compression
scheme'' [Comm. ACM {\bf 29}, 1986, 4, 320330, MR
87e:68020] by J. L. Bentley, D. D. Sleator, R. E.
Tarjan and V. K. Wei}",
journal = jCACM,
volume = "30",
number = "9",
pages = "792794",
month = sep,
year = "1987",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "68P99 (94A29)",
MRnumber = "89a:68045",
bibdate = "Tue Dec 26 13:35:07 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}{Ryabko:1987:CLA,
author = "B. Ya. Ryabko and R. Nigel Horspool and Gordon V.
Cormack",
title = "Comments to: {``A locally adaptive data compression
scheme'' [Comm. ACM {\bf 29}, 1986, 4, 320330, MR
87e:68020] by J. L. Bentley, D. D. Sleator, R. E.
Tarjan and V. K. Wei}",
journal = jCACM,
volume = "30",
number = "9",
pages = "792794",
month = sep,
year = "1987",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "68P99 (94A29)",
MRnumber = "89a:68045",
bibdate = "Tue Dec 26 13:35:07 1995",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
XY3+a57'=c;?ckarticledatacompression.bibRyabko:1987:CLAB. Ya. Ryabko and R. Nigel Horspool and Gordon V. CormackComments to: ``A locally adaptive data compression scheme'' [Comm. ACM bf 29, 1986, 4, 320330, MR 87e:68020] by J. L. Bentley, D. D. Sleator, R. E. Tarjan and V. K. WeijCACM309792794sep91987CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 0001078268P99 (94A29)89a:68045Tue Dec 26 13:35:07 1995http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1995.12.26 13:35:07 ???Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79B. Ya. Ryabko and R. Nigel Horspool and Gordon V. CormackComments to: {``A locally adaptive data compression scheme'' [Comm. ACM {\bf 29}, 1986, 4, 320330, MR 87e:68020] by J. L. Bentley, D. D. Sleator, R. E. Tarjan and V. K. Wei}
@Articleta Compression Scheme",
journal = jAUSTRALIANCOMPSCICOMM,
volume = "9",
number = "1",
pages = "262272",
year = "1987",
CODEN = "ACSCDD",
ISSN = "01573055",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Australian Computer Science Communications",
rawdata = "Tischer, Peter (1987) ``A Modified LZW Data
Compression Scheme,'' {\it Australian computer science
communications}, {\bf9}(1):262272.",
}ALIANCOMPSCICOMM912622721987ACSCDD01573055 OR 01573055Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTAustralian Computer Science CommunicationsackdsPeter TischerA Modified {LZW} Data Compression Scheme
@Article{Tischer:1987:MLD,
author = "Peter Tischer",
title = "A Modified {LZW} Data Compression Scheme",
journal = jAUSTRALIANCOMPSCICOMM,
volume = "9",
number = "1",
pages = "262272",
year = "1987",
CODEN = "ACSCDD",
ISSN = "01573055",
ISSNL = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Australian Computer Science Communications",
rawdata = "Tischer, Peter (1987) ``A Modified LZW Data
Compression Scheme,'' {\it Australian computer science
communications}, {\bf9}(1):262272.",
}
>mX 3''E%9GC7;e9'Ephdthesisdatacompression.bibTran:1987:DCBThao Duy TranData Compression of Bauded Signals Using the Baseband Residual Vector Quantization AlgorithmPh.D. thesisThe University of UtahSalt Lake City, UT 84112, USA1671987Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://ww6U 3'YA7E};a']marticledatacompression.bibTischer:1987:MLDPeter TischerA Modified LZW Data Compression SchemejAUSTRBauded Signals Using the Baseband
Residual Vector Quantization Algorithm",
type = "{Ph.D.} thesis",
school = "The University of Utah",
address = "Salt Lake City, UT 84112, USA",
pages = "167",
year = "1987",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303609161",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8727361",
subject = "Electrical engineering",
}w.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/303609161Electrical engineeringacknhfbThao Duy TranData Compression of Bauded Signals Using the Baseband Residual Vector Quantization Algorithm
@PhdThesis{Tran:1987:DCB,
author = "Thao Duy Tran",
title = "Data Compression of Bauded Signals Using the Baseband
Residual Vector Quantization Algorithm",
type = "{Ph.D.} thesis",
school = "The University of Utah",
address = "Salt Lake City, UT 84112, USA",
pages = "167",
year = "1987",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303609161",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8727361",
subject = "Electrical engineering",
}alysis of Dynamic {Huffman} Codes",
journal = jJACM,
volume = "34",
number = "4",
pages = "825845",
month = oct,
year = "1987",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jacm.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/00045411/42227.html",
abstract = "A new onepass algorithm for constructing dynamic
Huffman codes is introduced and analyzed. We also
analyze the onepass algorithm due to N. Faller, R. G.
Gallager, and D. E. Knuth. In each algorithm, both the
sender and the receiver maintain equivalent dynamically
varying Huffman trees, and the coding is done in real
time. We show that the number of bits used by the new
algorithm to encode a message containing t letters is
less than t bits more than that used by the
conventional twopass Huffman scheme, independent of
the alphabet size. This is best possible in the worst
case, for any onepass Huffman method. Tight upper and
lower bounds are derived. Empirical tests show that the
encodings produced by the new algorithm are shorter
than those of the other onepass algorithm and, except
for long messages, are shorter than those of the
twopass method. The new algorithm is well suited for
online encoding\slash decoding in data networks and for
file compression.",
acknowledgement = ackds # " and " # acknhfb,
affiliationaddress = "Brown Univ, Providence, RI, USA",
classification = "723",
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "algorithms; codes, symbolic; computer networks;
computer programming  Algorithms; Design; design;
dynamic Huffman codes; file compression; onepass
algorithm; performance; theory",
rawdata = "Vitter, Jeffrey S. (1987) ``Design and Analysis of
Dynamic Huffman Codes,'' {\it Journal of the ACM},
{\bf34}(4):825845, October.",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY. {\bf
F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems. {\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf
G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Trees. {\bf C.2.0}: Computer Systems
Organization, COMPUTERCOMMUNICATION NETWORKS, General,
Data communications.",
}/Abstracts/00045411/42227.htmlA new onepass algorithm for constructing dynamic Huffman codes is introduced and analyzed. We also analyze the onepass algorithm due to N. Faller, R. G. Gallager, and D. E. Knuth. In each algorithm, both the sender and the receiver maintain equivalent dynamically varying Huffman trees, and the coding is done in real time. We show that the number of bits used by the new algorithm to encode a message containing t letters is less than t bits more than that used by the conventional twopass Huffman scheme, independent of the alphabet size. This is best possible in the worst case, for any onepass Huffman method. Tight upper and lower bounds are derived. Empirical tests show that the encodings produced by the new algorithm are shorter than those of the other onepass algorithm and, except for long messages, are shorter than those of the twopass method. The new algorithm is well suited for online encoding / decoding in data networks and for file compression.Journal of the Association for Computing Machineryalgorithms; codes, symbolic; computer networks; computer programming  Algorithms; Design; design; dynamic Huffman codes; file compression; onepass algorithm; performance; theorybf E.4: Data, CODING AND INFORMATION THEORY. bf F.2.2: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. bf E.1: Data, DATA STRUCTURES, Trees. bf G.2.2: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees. bf C.2.0: Computer Systems Organization, COMPUTERCOMMUNICATION NETWORKS, General, Data communications.ackdsBrown Univ, Providence, RI, USAhttp://portal.acm.org/browse_dl.cfm?idx=J401J Assoc Comput MachA new onepass algorithm for constructing dynamic Huffman codes is introduced and analyzed. We also analyze the onepass algorithm due to N. Faller, R. G. Gallager, and D. E. Knuth. In each algorithm, both the sender and the receiver maintain equivalent dynamically varying Huffman trees, and the coding is done in real time. We show that the number of bits used by the new algorithm to encode a message containing t letters is less than t bits more than that used by the conventional twopass Huffman scheme, independent of the alphabet size. This is best possible in the worst case, for any onepass Huffman method. Tight upper and lower bounds are derived. Empirical tests show that the encodings produced by the new algorithm are shorter than those of the other onepass algorithm and, except for long messages, are shorter than those of the twopass method. The new algorithm is well suited for online encoding\slash decoding in data networks and for file compression.Jeffrey Scott VitterDesign and Analysis of Dynamic {Huffman} Codes
@Article{Vitter:1987:DAD,
author = "Jeffrey Scott Vitter",
title = "Design and Analysis of Dynamic {Huffman} Codes",
journal = jJACM,
volume = "34",
number = "4",
pages = "825845",
month = oct,
year = "1987",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jacm.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/00045411/42227.html",
abstract = "A new onepass algorithm for constructing dynamic
Huffman codes is introduced and analyzed. We also
analyze the onepass algorithm due to N. Faller, R. G.
Gallager, and D. E. Knuth. In each algorithm, both the
sender and the receiver maintain equivalent dynamically
varying Huffman trees, and the coding is done in real
time. We show that the number of bits used by the new
algorithm to encode a message containing t letters is
less than t bits more than that used by the
conventional twopass Huffman scheme, independent of
the alphabet size. This is best possible in the worst
case, for any onepass Huffman method. Tight upper and
lower bounds are derived. Empirical tests show that the
encodings produced by the new algorithm are shorter
than those of the other onepass algorithm and, except
for long messages, are shorter than those of the
twopass method. The new algorithm is well suited for
online encoding\slash decoding in data networks and for
file compression.",
acknowledgement = ackds # " and " # acknhfb,
affiliationaddress = "Brown Univ, Providence, RI, USA",
classification = "723",
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "algorithms; codes, symbolic; computer networks;
computer programming  Algorithms; Design; design;
dynamic Huffman codes; file compression; onepass
algorithm; performance; theory",
rawdata = "Vitter, Jeffrey S. (1987) ``Design and Analysis of
Dynamic Huffman Codes,'' {\it Journal of the ACM},
{\bf34}(4):825845, October.",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY. {\bf
F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems. {\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf
G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Trees. {\bf C.2.0}: Computer Systems
Organization, COMPUTERCOMMUNICATION NETWORKS, General,
Data communications.",
}
9\ 3+5e57Es;qwKe3'5i[articledatacompression.bibVitter:1987:DADJeffrey Scott VitterDesign and Analysis of Dynamic Huffman CodesjJACM344825845oct101987JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 00045411Sat Jan 26 12:46:16 MST 2013Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib2013.01.26 12:46:16 MSThttp://www.acm.org/pubs/tocata with Quadtrees",
journal = jDDJ,
volume = "12",
number = "3",
pages = "16??",
month = mar,
year = "1987",
CODEN = "DDJOEB",
ISSN = "08883076",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "723; 741; 921",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools",
keywords = "computer graphics  Imaging Techniques; Data
Compression; data processing  Data Structures;
graphical image representations; image data
compression; information theory; locational codes;
mathematical techniques  Trees; quadtrees",
pagecount = "11p between p 16 and 45",
} title = "Compressing Image Data with Quadtrees",
journal = jDDJ,
volume = "12",
number = "3",
pages = "16??",
month = mar,
year = "1987",
CODEN = "DDJOEB",
ISSN = "08883076",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "723; 741; 921",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools",
keywords = "computer graphics  Imaging Techniques; Data
Compression; data processing  Data Structures;
graphical image representations; image data
compression; information theory; locational codes;
mathematical techniques  Trees; quadtrees",
pagecount = "11p between p 16 and 45",
}
 W 3)+W7C{;UeA+Warticledatacompression.bibWhite:1987:CIDRonald G. WhiteCompressing Image Data with QuadtreesjDDJ12316??mar31987DDJOEB08883076 OR 08883076Thu Jan 9 09:35:43 MST 1997Compendex database; http://www.ddj.com/index/author/index.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.01.09 09:35:43 MSTDr. Dobb's Journal of Software Toolscomputer graphics  Imaging Techniques; Data Compression; data processing  Data Structures; graphical image representations; image data compression; information theory; locational codes; mathematical techniques  Trees; quadtreesacknhfbDr Dobb's J Software ToolsRonald G. WhiteCompressing Image Data with Quadtrees
@Article{White:1987:CID,
author = "Ronald G. White",
title = "Arithmetic Coding for Data Compression",
journal = jCACM,
volume = "30",
number = "6",
pages = "520540",
month = jun,
year = "1987",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/00010782/214771.html",
acknowledgement = ackds # " and " # acknhfb,
annote = "From an input string of symbols and a model, an
encoded string is produced. The decoder must have
access to the same model; the model may assign a
predetermined probability to each symbol in ASCII. Such
a fixed model is communicated in advance. Huffman
coding performs optimally if all symbol probabilities
are integral powers of 1/2. Arithmetic coding dispenses
with the restriction that each symbol must translate
into an integral number of bits, thereby coding more
efficiently.",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "design; performance",
rawdata = "Witten, Ian H., Radford M. Neal, and John G. Cleary
(1987) ``Arithmetic Coding for Data Compression,'' {\it
Communications of the ACM}, {\bf30}(6):520540.",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression.",
}
++rL&Lzu
@Book{Benatti:2010:QIC,
editor = "Fabio Benatti",
title = "Quantum information, c!ċ[
@Book{Biggs:2008:CII,
author = "Norman Biggs",
title = "Codes: an Introduction tojU
@Book{Born:1995:FFH,
author = "G{\"u}nter Born",
title = "The File Formats Handbo
@Book{Berstel:1985:TC,
author = "Jean Berstel and Dominique Perrin",
title = "The+Y
@Book{Berger:1971:RDT,
author = "Toby Berger",
title = "Rate distortion theory; ays
@Book{Borgelt:2013:TAD,
editor = "Christian Borgelt and others",
booktitle = "Towards([7
@Book{Britanak:2006:DCS,
author = "Vladimir Britanak and Patrick C. Yip and Kamisetty
^=
@Book{Bosi:2003:IDA,
author = "Marina Bosi and Richard E. Goldberg",
title = "Int'm5
@Book{Bruce:1996:AWA,
author = "Andrew Bruce and HongYe Gao",
title = "Applied wSat Jan 26 12:46:16 MST 2013ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSThttp://www.acm.org/pubs/toc/Abstracts/00010782/214771.htmlCommunications of the ACMdesign; performancebf E.4: Data, CODING AND INFORMATION THEORY, Data compaction and compression.ackdsFrom an input string of symbols and a model, an encoded string is produced. The decoder must have access to the same model; the model may assign a predetermined probability to each symbol in ASCII. Such a fixed model is communicated in advance. Huffman coding performs optimally if all symbol probabilities are integral powers of 1/2. Arithmetic coding dispenses with the restriction that each symbol must translate into an integral number of bits, thereby coding more efficiently.http://portal.acm.org/browse_dl.cfm?idx=J79Ian H. Witten and Radford M. Neal and John G. ClearyArithmetic Coding for Data Compression
@Article{Witten:1987:ACD,
author = "Ian H. Witten and Radford M. Neal and John G. Cleary",
title = "Arithmetic Coding for Data Compression",
journal = jCACM,
volume = "30",
number = "6",
pages = "520540",
month = jun,
year = "1987",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/00010782/214771.html",
acknowledgement = ackds # " and " # acknhfb,
annote = "From an input string of symbols and a model, an
encoded string is produced. The decoder must have
access to the same model; the model may assign a
predetermined probability to each symbol in ASCII. Such
a fixed model is communicated in advance. Huffman
coding performs optimally if all symbol probabilities
are integral powers of 1/2. Arithmetic coding dispenses
with the restriction that each symbol must translate
into an integral number of bits, thereby coding more
efficiently.",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "design; performance",
rawdata = "Witten, Ian H., Radford M. Neal, and John G. Cleary
(1987) ``Arithmetic Coding for Data Compression,'' {\it
Communications of the ACM}, {\bf30}(6):520540.",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression.",
}
>>GW!3)c{_ctechreportdatacompression.bibAldus:1988:TIFAldus Corporation and Microsoft CorporationTag Image File Format (TIFF) Specification Revision 5.0Aldus Corporation, 411 First Avenue South, Suite 200, Seattle, WA 98104, Tel: (206) 6225500, and Micٚ[
Z3+uY57E;?3'OcuY?articledatacompression.bibWitten:1987:ACDIan H. Witten and Radford M. Neal and John G. ClearyArithmetic Coding for Data CompressionjCACM306520540jun61987CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782e = "Tag Image File Format ({TIFF}) Specification Revision
5.0",
institution = "Aldus Corporation, 411 First Avenue South, Suite 200,
Seattle, WA 98104, Tel: (206) 6225500, and Microsoft
Corporation, 16011 NE 36th Way, Box 97017, Redmond, WA
980739717, Tel: (206) 8828080",
day = "8",
month = aug,
year = "1988",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = acknhfb,
}rosoft Corporation, 16011 NE 36th Way, Box 97017, Redmond, WA 980739717, Tel: (206) 88280805205408aug81988http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/master.bibacknhfbAldus Corporation and Microsoft CorporationTag Image File Format ({TIFF}) Specification Revision 5.0
@TechReport{Aldus:1988:TIF,
author = "Aldus Corporation and Microsoft Corporation",
title = "Tag Image File Format ({TIFF}) Specification Revision
5.0",
institution = "Aldus Corporation, 411 First Avenue South, Suite 200,
Seattle, WA 98104, Tel: (206) 6225500, and Microsoft
Corporation, 16011 NE 36th Way, Box 97017, Redmond, WA
980739717, Tel: (206) 8828080",
day = "8",
month = aug,
year = "1988",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = acknhfb,
} "Tag Image File Format ({TIFF}) Specification Revision
5.0",
institution = "Aldus Corporation, 411 First Avenue South, Suite 200,
Seattle, WA 98104, Tel: (206) 6225500, and Microsoft
Corporation, 16011 NE 36th Way, Box 97017, Redmond, WA
980739717, Tel: (206) 8828080",
month = aug # " 8",
year = "1988",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = acknhfb,
}6) 6225500, and Microsoft Corporation, 16011 NE 36th Way, Box 97017, Redmond, WA 980739717, Tel: (206) 8828080520540aug81988http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/master.bibacknhfbAldus Corporation and Microsoft CorporationTag Image File Format ({TIFF}) Specification Revision 5.0
@TechReport{Aldus:tiff,
author = "Aldus Corporation and Microsoft Corporation",
title = "Tag Image File Format ({TIFF}) Specification Revision
5.0",
institution = "Aldus Corporation, 411 First Avenue South, Suite 200,
Seattle, WA 98104, Tel: (206) 6225500, and Microsoft
Corporation, 16011 NE 36th Way, Box 97017, Redmond, WA
980739717, Tel: (206) 8828080",
month = aug # " 8",
year = "1988",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = acknhfb,
}
TTe
V3+?a57E};5O?emarticledatacompression.bibAnedda:1988:CQIC. Anedda and L. Felician$P$Compressed Quadtrees for Image StoringjCOMPJ3143533571988CMPJA600104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Sat Jan 26 12:46:16 MST 2013httߊ/W!3!c{_cYtechreportdatacompression.bibAldus:tiffAldus Corporation and Microsoft CorporationTag Image File Format (TIFF) Specification Revision 5.0Aldus Corporation, 411 First Avenue South, Suite 200, Seattle, WA 98104, Tel: (20mpressed Quadtrees for Image Storing",
journal = jCOMPJ,
volume = "31",
number = "4",
pages = "353357",
year = "1988",
CODEN = "CMPJA6",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
rawdata = "Anedda, C. and L. Felician (1988) ``PCompressed
Quadtrees for Image Storing,'' {\it The Computer
Journal}, {\bf31}(4):353357.",
}
)Lp)A
@Article{Hon:2013:FCD,
author = "WingKai Hon and TsungHan Ku and Rahul Shah and
%&m
@Article{Howard:1992:NML,
author = "Paul G. Howard and J. S. Vitter",
title = "Ne;pa
@Article{Hoobin:2011:RLZ,
author = "Christopher Hoobin and Simon J. Puglisi and Justin
#IeK
@Article{Holub:2013:GAD,
author = "Petr Holub and Martin Srom and Martin Pulec and
%
@Article{Hoffman:2005:GHS,
author = "Dean Hoffman and Peter Johnson and Nadine Wilson",
DdI
@Article{Hoces:1996:MRB,
author = "Carlos Hoces",
title = "Media Reviews: a Broad
Q#
@Article{Hoces:1995:MRF,
author = "Carlos Hoces",
title = "Media reviews: Fractal(d
@Article{Hoang:2007:CBC,
author = "Anh Tuan Hoang and Mehul Motani",
title = lY
@Article{Hovestadt:2013:AOC,
author = "Matthias Hovestadt and Odej Kao and Andreas Kliem and
%p://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTThe Computer Journalackdshttp://comjnl.oxfordjournals.org/C. Anedda and L. Felician{$P$}Compressed Quadtrees for Image Storing
@Article{Anedda:1988:CQI,
author = "C. Anedda and L. Felician",
title = "{$P$}Compressed Quadtrees for Image Storing",
journal = jCOMPJ,
volume = "31",
number = "4",
pages = "353357",
year = "1988",
CODEN = "CMPJA6",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
rawdata = "Anedda, C. and L. Felician (1988) ``PCompressed
Quadtrees for Image Storing,'' {\it The Computer
Journal}, {\bf31}(4):353357.",
}
journal = jCOMPJ,
volume = "31",
number = "4",
pages = "353357",
month = aug,
year = "1988",
CODEN = "CMPJA6",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Mar 25 13:51:56 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/353.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/354.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/355.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/356.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/357.tif",
acknowledgement = acknhfb,
affiliation = "Univ degli Studi di Udine, Udine, Italy",
affiliationaddress = "Univ degli Studi di Udine, Udine, Italy",
classcodes = "C6120 (File organisation); C6130B (Graphics
techniques)",
classification = "722; 723; 741",
corpsource = "Dipartimento di Matematica e Inf., Udine Univ.,
Italy",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "automation; bitmap scanning; computer graphics; data
compression; data storage, analog; data structures;
database systems; encoded images; encoding; image
processing; image storing; imagefile management; mass
storage; office; office automation; office automation
environment; pcompressed quadtrees; Pcompression;
quadtree; storage management; trees (mathematics)",
treatment = "P Practical",
}journal/hdb/Volume_31/Issue_04/tiff/355.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/356.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/357.tifThe Computer Journalautomation; bitmap scanning; computer graphics; data compression; data storage, analog; data structures; database systems; encoded images; encoding; image processing; image storing; imagefile management; mass storage; office; office automation; office automation environment; pcompressed quadtrees; Pcompression; quadtree; storage management; trees (mathematics)acknhfbUniv degli Studi di Udine, Udine, ItalyUniv degli Studi di Udine, Udine, ItalyC6120 (File organisation); C6130B (Graphics techniques)Dipartimento di Matematica e Inf., Udine Univ., Italyhttp://comjnl.oxfordjournals.org/P PracticalC. Anedda and L. Felician{P}Compressed Quadtrees for Image Storing
@Article{Anedda:1988:PCQ,
author = "C. Anedda and L. Felician",
title = "{P}Compressed Quadtrees for Image Storing",
journal = jCOMPJ,
volume = "31",
number = "4",
pages = "353357",
month = aug,
year = "1988",
CODEN = "CMPJA6",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Mar 25 13:51:56 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/compj.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/353.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/354.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/355.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/356.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/357.tif",
acknowledgement = acknhfb,
affiliation = "Univ degli Studi di Udine, Udine, Italy",
affiliationaddress = "Univ degli Studi di Udine, Udine, Italy",
classcodes = "C6120 (File organisation); C6130B (Graphics
techniques)",
classification = "722; 723; 741",
corpsource = "Dipartimento di Matematica e Inf., Udine Univ.,
Italy",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "automation; bitmap scanning; computer graphics; data
compression; data storage, analog; data structures;
database systems; encoded images; encoding; image
processing; image storing; imagefile management; mass
storage; office; office automation; office automation
environment; pcompressed quadtrees; Pcompression;
quadtree; storage management; trees (mathematics)",
treatment = "P Practical",
}
iY3+?]57E;5k[[{wO#?aarticledatacompression.bibAnedda:1988:PCQC. Anedda and L. FelicianPCompressed Quadtrees for Image StoringjCOMPJ314353357aug81988CMPJA600104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Tue Mar 25 13:51:56 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/1997.03.25 13:51:56 MSThttp://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/353.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/354.tif; http://www3.oup.co.uk/computer_ and Richard C. Pasco and Theodore David Friedman",
title = "A multipurpose {VLSI} chip for adaptive data
compression of bilevel images",
journal = jIBMJRD,
volume = "32",
number = "6",
pages = "775795 (or 775794??)",
month = nov,
year = "1988",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "A VLSI chip for data compression has been implemented
based on a generalpurpose adaptive binary arithmetic
coding (ABAC) architecture. The architecture permits
the reuse of adapter and arithmetic coder logic in a
universal way, which together with application
specific model logic can create a variety of powerful
compression systems. The specific version of the
adapter\slash coder used is the `QCoder'. The hardware
implementation is in a single HCMOS chip, to maximize
speed and minimize cost. The primary purpose of the
chip is to provide superior data compression
performance for bilevel image data by using conditional
binary source models together with adaptive arithmetic
coding. The coding scheme implemented is called the
Adaptive Bilevel Image Compression (ABIC) algorithm. On
business documents, it outperforms such nonadaptive
algorithms as the CCITT Group 4 (T.6) Standard and
comes into its own when adapting to documents scanned
at different resolutions or which include significantly
different data such as digital halftones.",
acknowledgement = acknhfb,
affiliation = "IBM Res. Div., Almaden Res. Center",
affiliationaddress = "San Jose, CA, USA",
classcodes = "B6120B (Codes); B6110 (Information theory); B6140C
(Optical information and image processing); C5230
(Digital arithmetic methods); C1260 (Information
theory); C4220 (Automata theory)C1250 (Pattern
recognition)",
classification = "713; 714; 721; 723; 741; 921; B6110 (Information
theory); B6120B (Codes); B6140C (Optical information
and image processing); C1250 (Pattern recognition);
C1260 (Information theory); C4220 (Automata theory);
C5230 (Digital arithmetic methods)",
corpsource = "IBM Res. Div., Almaden Res. Center, San Jose, CA,
USA",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "Adapter; adapter; Adaptive arithmetic coding; adaptive
arithmetic coding; Adaptive binary arithmetic coding;
adaptive binary arithmetic coding; Adaptive Binary
Arithmetic Coding (ABAC); Adaptive data compression;
Adaptive Data Compression; adaptive data compression;
Arithmetic coder logic; arithmetic coder logic;
Arithmetic Coder Logic; Bilevel Images; bilevel images;
Bilevel images; binary source; Binary source models;
Control Systems, Adaptive; Design; digital arithmetic;
encoding; finite automata; hardware coding; Hardware
coding; HCMOS chip; Image Processing; information;
Information TheoryData Compression; Integrated
Circuits, VLSI; models; picture processing;
probability; QCoder; Qcoder; theory; VLSI; VLSI chip;
VLSI Chip",
thesaurus = "Digital arithmetic; Encoding; Finite automata;
Information theory; Picture processing; Probability;
VLSI",
treatment = "A Application; P Practical; T Theoretical or
Mathematical",
xxlibnote = "Issue missing from UofUtah Marriott Library",
}ib/ibmjrd.bib1997.03.25 14:26:59 MSTA VLSI chip for data compression has been implemented based on a generalpurpose adaptive binary arithmetic coding (ABAC) architecture. The architecture permits the reuse of adapter and arithmetic coder logic in a universal way, which together with application specific model logic can create a variety of powerful compression systems. The specific version of the adapter / coder used is the `QCoder'. The hardware implementation is in a single HCMOS chip, to maximize speed and minimize cost. The primary purpose of the chip is to provide superior data compression performance for bilevel image data by using conditional binary source models together with adaptive arithmetic coding. The coding scheme implemented is called the Adaptive Bilevel Image Compression (ABIC) algorithm. On business documents, it outperforms such nonadaptive algorithms as the CCITT Group 4 (T.6) Standard and comes into its own when adapting to documents scanned at different resolutions or which include significantly different data such as digital halftones.IBM Journal of Research and DevelopmentAdapter; adapter; Adaptive arithmetic coding; adaptive arithmetic coding; Adaptive binary arithmetic coding; adaptive binary arithmetic coding; Adaptive Binary Arithmetic Coding (ABAC); Adaptive data compression; Adaptive Data Compression; adaptive data compression; Arithmetic coder logic; arithmetic coder logic; Arithmetic Coder Logic; Bilevel Images; bilevel images; Bilevel images; binary source; Binary source models; Control Systems, Adaptive; Design; digital arithmetic; encoding; finite automata; hardware coding; Hardware coding; HCMOS chip; Image Processing; information; Information TheoryData Compression; Integrated Circuits, VLSI; models; picture processing; probability; QCoder; Qcoder; theory; VLSI; VLSI chip; VLSI ChipacknhfbIBM Res. Div., Almaden Res. CenterSan Jose, CA, USAB6120B (Codes); B6110 (Information theory); B6140C (Optical information and image processing); C5230 (Digital arithmetic methods); C1260 (Information theory); C4220 (Automata theory)C1250 (Pattern recognition)IBM Res. Div., Almaden Res. Center, San Jose, CA, USAhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520IBM J Res DevDigital arithmetic; Encoding; Finite automata; Information theory; Picture processing; Probability; VLSIA Application; P Practical; T Theoretical or MathematicalA VLSI chip for data compression has been implemented based on a generalpurpose adaptive binary arithmetic coding (ABAC) architecture. The architecture permits the reuse of adapter and arithmetic coder logic in a universal way, which together with application specific model logic can create a variety of powerful compression systems. The specific version of the adapter\slash coder used is the `QCoder'. The hardware implementation is in a single HCMOS chip, to maximize speed and minimize cost. The primary purpose of the chip is to provide superior data compression performance for bilevel image data by using conditional binary source models together with adaptive arithmetic coding. The coding scheme implemented is called the Adaptive Bilevel Image Compression (ABIC) algorithm. On business documents, it outperforms such nonadaptive algorithms as the CCITT Group 4 (T.6) Standard and comes into its own when adapting to documents scanned at different resolutions or which include significantly different data such as digital halftones.Ronald B. Arps and Thomas K. Truong and David J. Lu and Richard C. Pasco and Theodore David FriedmanA multipurpose {VLSI} chip for adaptive data compression of bilevel images
@Article{Arps:1988:MPV,
author = "Ronald B. Arps and Thomas K. Truong and David J. Lu
and Richard C. Pasco and Theodore David Friedman",
title = "A multipurpose {VLSI} chip for adaptive data
compression of bilevel images",
journal = jIBMJRD,
volume = "32",
number = "6",
pages = "775795 (or 775794??)",
month = nov,
year = "1988",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "A VLSI chip for data compression has been implemented
based on a generalpurpose adaptive binary arithmetic
coding (ABAC) architecture. The architecture permits
the reuse of adapter and arithmetic coder logic in a
universal way, which together with application
specific model logic can create a variety of powerful
compression systems. The specific version of the
adapter\slash coder used is the `QCoder'. The hardware
implementation is in a single HCMOS chip, to maximize
speed and minimize cost. The primary purpose of the
chip is to provide superior data compression
performance for bilevel image data by using conditional
binary source models together with adaptive arithmetic
coding. The coding scheme implemented is called the
Adaptive Bilevel Image Compression (ABIC) algorithm. On
business documents, it outperforms such nonadaptive
algorithms as the CCITT Group 4 (T.6) Standard and
comes into its own when adapting to documents scanned
at different resolutions or which include significantly
different data such as digital halftones.",
acknowledgement = acknhfb,
affiliation = "IBM Res. Div., Almaden Res. Center",
affiliationaddress = "San Jose, CA, USA",
classcodes = "B6120B (Codes); B6110 (Information theory); B6140C
(Optical information and image processing); C5230
(Digital arithmetic methods); C1260 (Information
theory); C4220 (Automata theory)C1250 (Pattern
recognition)",
classification = "713; 714; 721; 723; 741; 921; B6110 (Information
theory); B6120B (Codes); B6140C (Optical information
and image processing); C1250 (Pattern recognition);
C1260 (Information theory); C4220 (Automata theory);
C5230 (Digital arithmetic methods)",
corpsource = "IBM Res. Div., Almaden Res. Center, San Jose, CA,
USA",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "Adapter; adapter; Adaptive arithmetic coding; adaptive
arithmetic coding; Adaptive binary arithmetic coding;
adaptive binary arithmetic coding; Adaptive Binary
Arithmetic Coding (ABAC); Adaptive data compression;
Adaptive Data Compression; adaptive data compression;
Arithmetic coder logic; arithmetic coder logic;
Arithmetic Coder Logic; Bilevel Images; bilevel images;
Bilevel images; binary source; Binary source models;
Control Systems, Adaptive; Design; digital arithmetic;
encoding; finite automata; hardware coding; Hardware
coding; HCMOS chip; Image Processing; information;
Information TheoryData Compression; Integrated
Circuits, VLSI; models; picture processing;
probability; QCoder; Qcoder; theory; VLSI; VLSI chip;
VLSI Chip",
thesaurus = "Digital arithmetic; Encoding; Finite automata;
Information theory; Picture processing; Probability;
VLSI",
treatment = "A Application; P Practical; T Theoretical or
Mathematical",
xxlibnote = "Issue missing from UofUtah Marriott Library",
}
>a3'U=57E;/[WQ//w']7U#garticledatacompression.bibArps:1988:MPVRonald B. Arps and Thomas K. Truong and David J. Lu and Richard C. Pasco and Theodore David FriedmanA multipurpose VLSI chip for adaptive data compression of bilevel imagesjIBMJRD326775795 (or 775794??)nov111988IBMJAE00188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 00188646Tue Mar 25 14:26:59 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bompress Images",
journal = jBYTE,
volume = "13",
number = "??",
pages = "215222",
month = jan,
year = "1988",
CODEN = "BYTEDJ",
ISSN = "03605280 (print), 10827838 (electronic)",
ISSNL = "03605280",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "/usr/local/src/bib/bibliography/Graphics/imager/imager.88.bib;
http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib;
http://www.math.utah.edu/pub/bibnet/subjects/fractalimagecomp.bib;
http://www.math.utah.edu/pub/tex/bib/byte1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "BYTE Magazine",
rawdata = "Barnsley, M. F., and Sloan, A. D. (1988) ``A Better
Way to Compress Images,'' {\it Byte Magazine}, pp.
215222, January.",
xxpages = "215223",
} Compress Images",
journal = jBYTE,
volume = "13",
number = "??",
pages = "215222",
month = jan,
year = "1988",
CODEN = "BYTEDJ",
ISSN = "03605280 (print), 10827838 (electronic)",
ISSNL = "03605280",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "/usr/local/src/bib/bibliography/Graphics/imager/imager.88.bib;
http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib;
http://www.math.utah.edu/pub/bibnet/subjects/fractalimagecomp.bib;
http://www.math.utah.edu/pub/tex/bib/byte1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "BYTE Magazine",
rawdata = "Barnsley, M. F., and Sloan, A. D. (1988) ``A Better
Way to Compress Images,'' {\it Byte Magazine}, pp.
215222, January.",
xxpages = "215223",
}
ssW3/WK57Eu;'WKuarticledatacompression.bibBarnsley:1988:BWCMichael F. Barnsley and Alan D. SloanA Better Way to Compress ImagesjBYTE13215222jan11988BYTEDJ03605280 (print), 10827838 (electronic) OR 03605280 (print), 10827838 (electronic)03605280 OR 03605280Sat Jan 26 12:46:16 MST 2013/usr/local/src/bib/bibliography/Graphics/imager/imager.88.bib; http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib; http://www.math.utah.edu/pub/bibnet/subjects/fractalimagecomp.bib; http://www.math.utah.edu/pub/tex/bib/byte1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTBYTE MagazineackdsMichael F. Barnsley and Alan D. SloanA Better Way to Compress Images
@Article{Barnsley:1988:BWC,
author = "Michael F. Barnsley and Alan D. Sloan",
title = "A Better Way toere",
publisher = pubACADEMIC,
address = pubACADEMIC:adr,
pages = "xii + 394",
year = "1988",
ISBN = "0120790629",
ISBN13 = "9780120790623",
LCCN = "QA614.86 .B37 1988",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = ackds # " and " # acknhfb,
rawdata = "Barnsley, M. F. (1988) {\it Fractals Everywhere}, New
York, Academic Press.",
}3http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/master.bib2013.01.26 12:46:16 MSTackdsMichael F. BarnsleyFractals Everywhere
@Book{Barnsley:1988:FE,
author = "Michael F. Barnsley",
title = "Fractals Everywhere",
publisher = pubACADEMIC,
address = pubACADEMIC:adr,
pages = "xii + 394",
year = "1988",
ISBN = "0120790629",
ISBN13 = "9780120790623",
LCCN = "QA614.86 .B37 1988",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = ackds # " and " # acknhfb,
rawdata = "Barnsley, M. F. (1988) {\it Fractals Everywhere}, New
York, Academic Press.",
}
11W'31sk'E};U #skinproceedingsdatacompression.bibBassiouni:1988:SDCM. A. Bassiouni and N. Ranganathan and A. MukherjeeA scheme for data compression in supercomputersIEEE:1988:PSN12722781988Thu Apr 16 07:55:03 MDT 1998http://www.math.utah.edu/pub/tex/bib/datacompression.bib1998.04.16 07:55:03 MDTcommunication bandwidth; communication controllers; data compression; encoding; enhanced arithmetic coding scheme; parallel processing; supercomputers; VLSI designsacknhfbDept. of Comput. Sci., Central Florida Univ., Orlando, FL, USAP PracticalM. A. Bassiouni and N. Ranganath4V 333%CQ1Ei;33!bookdatacompression.bibBarnsley:1988:FEMichael F. BarnsleyFractals EverywherepubACADEMICpubACADEMIC:adrxii + 39419880120790629 OR 01207906299780120790623 OR 9780120790623QA614.86 .B37 1988Sat Jan 26 12:46:16 MST 201herjee",
title = "A scheme for data compression in supercomputers",
crossref = "IEEE:1988:PSN",
volume = "1",
pages = "272278",
year = "1988",
bibdate = "Thu Apr 16 07:55:03 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "C1260 (Information theory); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Dept. of Comput. Sci., Central Florida Univ., Orlando,
FL, USA",
keywords = "communication bandwidth; communication controllers;
data compression; encoding; enhanced arithmetic coding
scheme; parallel processing; supercomputers; VLSI
designs",
sponsororg = "IEEE; ACM",
treatment = "P Practical",
}an and A. MukherjeeA scheme for data compression in supercomputers
@InProceedings{Bassiouni:1988:SDC,
author = "M. A. Bassiouni and N. Ranganathan and A. Mukherjee",
title = "A scheme for data compression in supercomputers",
crossref = "IEEE:1988:PSN",
volume = "1",
pages = "272278",
year = "1988",
bibdate = "Thu Apr 16 07:55:03 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "C1260 (Information theory); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Dept. of Comput. Sci., Central Florida Univ., Orlando,
FL, USA",
keywords = "communication bandwidth; communication controllers;
data compression; encoding; enhanced arithmetic coding
scheme; parallel processing; supercomputers; VLSI
designs",
sponsororg = "IEEE; ACM",
treatment = "P Practical",
}Bases of Compactly Supported Wavelets",
journal = jCOMMPUREAPPLMATH,
volume = "41",
pages = "909996",
year = "1988",
CODEN = "CPAMAT, CPMAMV",
ISSN = "00103640 (print), 10970312 (electronic)",
ISSNL = "00103640",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Communications on Pure and Applied Mathematics (New
York)",
rawdata = "Daubechies, Ingrid (1988) ``Orthonormal Bases of
Compactly Supported Wavelets,'' {\it Communications on
Pure and Applied Mathematics}, {\bf41}:909996.",
}/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTCommunications on Pure and Applied Mathematics (New York)ackdsIngrid DaubechiesOrthonormal Bases of Compactly Supported Wavelets
@Article{Daubechies:1988:OBC,
author =