SQLite format 3@ ;õ û4û!¸ˆhÂnÎrÎ‚6ä–Jø¤N´`¾R#uindexlanguageidxbibtabCREATE INDEX languageidx on bibtab (language)LoindexissnlidxbibtabCREATE INDEX issnlidx on bibtab (issnl)R#uindexfjournalidxbibtab
õCREATE INDEX fjournalidx on bibtab (fjournal)Loindexcodenidxbibtab
ëCREATE INDEX codenidx on bibtab (coden)Jmindexyearidxbibtab
ßCREATE INDEX yearidx on bibtab (year)T%windexpublisheridxbibtab
ÖCREATE INDEX publisheridx on bibtab (publisher)R#uindexmrnumberidxbibtab
ÎCREATE INDEX mrnumberidx on bibtab (mrnumber)P!sindexmrclassidxbibtab
ÆCREATE INDEX mrclassidx on bibtab (mrclass)Jmindexlccnidxbibtab
½CREATE INDEX lccnidx on bibtab (lccn)Loindexlabelidxbibtab
¨CREATE INDEX labelidx on bibtab (label)P!sindexjournalidxbibtab
CREATE INDEX journalidx on bibtab (journal)Jmindexissnidxbibtab
„CREATE INDEX issnidx on bibtab (issn)Jmindexisbnidxbibtab
yCREATE INDEX isbnidx on bibtab (isbn)Nqindexisbn13idxbibtab
nCREATE INDEX isbn13idx on bibtab (isbn13)R#uindexfilenameidxbibtab
VCREATE INDEX filenameidx on bibtab (filename)Z
+}indexbibtimestampidxbibtab
:CREATE INDEX bibtimestampidx on bibtab (bibtimestamp)LoindextitleidxbibtabúCREATE INDEX titleidx on bibtab (title)P!sindexsubjectidxbibtabìCREATE INDEX subjectidx on bibtab (subject)R
#uindexkeywordsidxbibtab×CREATE INDEX keywordsidx on bibtab (keywords)N qindexeditoridxbibtabÎCREATE INDEX editoridx on bibtab (editor)T%windexbooktitleidxbibtabÃCREATE INDEX booktitleidx on bibtab (booktitle)Nqindexauthoridxbibtab¡CREATE INDEX authoridx on bibtab (author)MšutablebibtabbibtabCREATE 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,
LCCN 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
)+?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
ÉlûöñìçáÛÕÏÉÉ6Ñ\œd5qjBITBIT (Nordisk tidskrift for informationsbehandling)@String{jBIT = "BIT (Nordisk tidskrift for
informationsbehandling)"}~1OjBELLSYSTTECHJThe Bell System Technical Journal@String{jBELLSYSTTECHJ = "The Bell System Technical Journal"}=AaujAUSTRALIANCOMPSCICOMMAustralian Computer Science Communications@String{jAUSTRALIANCOMPSCICOMM = "Australian Computer Science
Communications"}s3C
jAUSTRALIANCOMPJAustralian Computer Journal@String{jAUSTRALIANCOMPJ = "Australian Computer Journal"}c%9jATTTECHJAT&T Technical Journal@String{jATTTECHJ = "AT\&T Technical Journal"}7])jATTBELLLABTECHJAT&T Bell Laboratories Technical Journal@String{jATTBELLLABTECHJ = "AT\&T Bell Laboratories Technical Journal"}C+u‚jAPPLNUMMATHApplied Numerical Mathematics: Transactions of IMACS@String{jAPPLNUMMATH = "Applied Numerical Mathematics: Transactions
of IMACS"}SjAPPLMATHCOMPApplied Mathematics and Computation@String{jAPPLMATHCOMP = "Applied Mathematics and Computation"}`
%7jANNPROBABAnnals of Probability@String{jANNPROBAB = "Annals of Probability"}{+OjANNMATHSTATAnnals of Mathematical Statistics@String{jANNMATHSTAT = "Annals of Mathematical Statistics"}w3GjAMERMATHMONTHLYAmerican Mathematical Monthly@String{jAMERMATHMONTHLY = "American Mathematical Monthly"}‚
A)‚=jJAMSOCINFSCITECHNOLJournal of the American Society for Information Science and Technology: JASIST@String{jJAMSOCINFSCITECHNOL = "Journal of the American Society for
Information Science and Technology: JASIST"}L 1{‚ jJAMSOCINFSCIJournal of the American Society for Information Science@String{jJAMSOCINFSCI = "Journal of the American Society for
Information Science"}^9jAMDOCAmerican Documentation@String{jAMDOC = "American Documentation"}O)%ojALGORITHMICAAlgorithmica@String{jALGORITHMICA = "Algorithmica"}T#wjACTAINFOActa Informatica@String{jACTAINFO = "Acta Informatica"}=])jACMJEXPALGORITHMICSACM Journal of Experimental Algorithmics@String{jACMJEXPALGORITHMICS = "ACM Journal of Experimental Algorithmics"}q'GinstCLSC:adrSalt Lake City, UT 84112, USA@String{instCLSC:adr = "Salt Lake City, UT 84112, USA"}3kyinstCLSCCollege of Science Computer, University of Utah@String{instCLSC = "College of Science Computer, University of
Utah"}†v…ˆcacknhfbNelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 841120090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, email: path beebe@math.utah.edu, path beebe@acm.org, path beebe@computer.org (Internet), URL: path http://www.math.utah.edu/~beebe/@String{acknhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 841120090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
email: \pathbeebe@math.utah.edu,
\pathbeebe@acm.org,
\pathbeebe@computer.org (Internet),
URL: \pathhttp://www.math.utah.edu/~beebe/"}‚‚ƒcackdsDavid Salomon, Professor Emeritus, Department of Computer Science, California State University, Northridge, Northridge, CA 91330, USA@String{ackds = "David Salomon,
Professor Emeritus,
Department of Computer Science,
California State University, Nortj‚ixgXe8db`f_P\3[émvØX
y
3é \ ÎLø¶pöª+žg#æa+é˜À…G…;ûu
ð‚@String{jCOMPSYS = "Computing systems: the journal of the
USENIX Association"}&?@String{jCOMPSURV = "ACM Computing Surveys"}%I@String{jCOMPPHYSCOMM = "Computer Physics Communications"}${@String{jCOMPNETAMSTERDAM = "Computer Networks (Amsterdam, Netherlands:
1999)"}#D@String{jCOMPLANGMAG = "Computer Language Magazine"}"=@String{jCOMPJ = "The Computer Journal"}!:y@String{jCOMPGRAPHICS = "Computer Graphics"} P#@String{jCOMPARCHNEWS = "ACM SIGARCH Computer Architecture News"}‚
@String{jCOMMPUREAPPLMATH = "Communications on Pure and Applied
Mathematics (New York)"}P#@String{jCGIP = "Computer Graphics and Image Processing"}A@String{jCGF = "Computer Graphics Forum"}5o@String{jCELLSYST = "Cell Systems"}‚ @String{jCCPE = "Concurrency and Computation: Prac\tice and
Experience"}<}@String{jCCCUJ = "C/C++ Users Journal"}C @String{jCACM = "Communications of the ACM"}6q@String{jBYTE = "Byte Magazine"}‚@String{jBULLSOCRSCILIEGE = "Bulletin de la Soci{\'e}t{\'e} royale des
sciences de Li{\`e}ge"}~@String{jBIT = "BIT (Nordisk tidskrift for
informationsbehandling)"}K@String{jBELLSYSTTECHJ = "The Bell System Technical Journal"}yu@String{jAUSTRALIANCOMPSCICOMM = "Australian Computer Science
Communications"}E
@String{jAUSTRALIANCOMPJ = "Australian Computer Journal"}A@String{jATTTECHJ = "AT\&T Technical Journal"}S)@String{jATTBELLLABTECHJ = "AT\&T Bell Laboratories Technical Journal"}‚@String{jAPPLNUMMATH = "Applied Numerical Mathematics: Transactions
of IMACS"}M@String{jAPPLMATHCOMP = "Applied Mathematics and Computation"}?@String{jANNPROBAB = "Annals of Probability"}
K@String{jANNMATHSTAT = "Annals of Mathematical Statistics"}G@String{jAMERMATHMONTHLY = "American Mathematical Monthly"}‚=@String{jJAMSOCINFSCITECHNOL = "Journal of the American Society for
Information Science and Technology: JASIST"}
‚ @String{jJAMSOCINFSCI = "Journal of the American Society for
Information Science"} @@String{jAMDOC = "American Documentation"}5o@String{jALGORITHMICA = "Algorithmica"}9w@String{jACTAINFO = "Acta Informatica"}S)@String{jACMJEXPALGORITHMICS = "ACM Journal of Experimental Algorithmics"}G@String{instCLSC:adr = "Salt Lake City, UT 84112, USA"}{y@String{instCLSC = "College of Science Computer, University of
Utah"}„0ˆc@StrinkE@String{pubPRINCETON = "Princeton University Press"}hA@String{pubFRONTIERES:adr = "GifsurYvette, France"}íf‚/@String{jTOMCCAP = "ACM Transactions on Multimedia Computing,
Communications, and Applications"}Àc=}@String{jOPTICALENG = "Optical Engineering"}ša{y@String{jJAMSTATASSOC = "Journal of the American Statistical
Association"}q^‚3@String{jIEEETRANSCIRCUITSSYSTVIDEOTECH = "IEEE Transactions on Circuits
and Systems for Video Technology"}Q]‚@String{jCOMPSYS = "Computing systems: the journal of the
USENIX Association"}&p úôîèâÜÖÐÊÄ¾¸²¬¦ š”Žˆ‚vp)
î
à
Î
¾
š
ˆ
o
`
Q
A
1
#
ýïàÑÁ¦”zgM@2 ôäÕÅ¸¤•„udUF1
õ
æ
Ó
À
¯
š
ˆ
w
f
Z
D
,
ù ç Ô Á ¬ ¡ ƒ j U C 5 ' îØËº²¡€q_OB0$ç×Ã³œŠ~k\I9'þìÛÒÄš†zhU@*óãÐ¿¬œŽ€mU@.
ùäÐ¸¥~gXI. þêÕ©—†lTD(ïßË¸ª›xfYH8*ðÞÊ¿«M'J. ChakareskiL B. YuK'Ian H. Witten
J% R. JandhyalaI' Peter FenwickH# Moira WylieG Paolo FaraboschiF A. Alecu
E! H. KhaliliD# S. C. Evans
C T. MengB% MinJen TsaiA+ Iain Richardson@ Dan Feng?Nam Ling> R. Nixon=' Erkki Sutinen<) H. V. Jagadish
;G. Lugosi:+ Prasanth Mankar9%J. E. Fowler8# Jacob Strom79 Thomas Patrick Stanley
6Jie Liang51 Viktor K. Prasanna45 Jeffrey Chaim Becker3!R. Rinaldo2% A. Montanari)1Y K. Ramamohan (Kamisetty Ramamohan) Rao0+ Eric J. Balster/) Ehud S. Conley
.! M. Maresca% William Horn, R. Yeung+7 Roy Steven Rubinstein* V. Tarokh) Xin Huang(/ Erik H. Volkerink'# T. Guionnet& Scott E. Umbaugh%%O. Shayevitz$/Kunihiko Sadakane#) JeongHwan Ahn"+ Eric E. Johnson!# C.S. Chien # D. K. Jones%A. De Santis% Raymie Stata)Robert F. Rice/J. SerraSagrista' Andreas Heuer Olu Lafe Wei Zhao
! N. Chomsky%C. A. Murthy# Zhixin Zhou' V. P. Bhatkar
! K. Chernik' Hiroaki Inoue) Hazem M. Abbas
! Jinshi Qiu Douglas W. Jones+ L. N. Shlepakov%J. S. Vitter
% J. T. Astola K. Zue'L. J. Latecki
' J. Alakuijala Stephen R. Quake A. Faria IMA# T. M. Cover% Dongchang Yu+Jeffery J. Kato%Vincent Cate% TingLan Lin
! D. A. Bell' W. Effelsberg
J. Seward~'D. Bainbridge
} Unicode%J. Rossignac{1 Maurice G. Kendallz# Ahmad Zandiy+ Ching Ming Wangx!Jizheng Xuw= Balakrishnan Prabhakaranv!D. Muresanu!Petr Holub
t D. Basus' Atsushi Ishiir A. Keithq# D. De Ryckep' Edward A. Fox
oV. Hlavacn# K. Katahiram% J. Benedettol% Liu Chunfengk NHKj#Martin Cohni D. KlinchCraig A. Lindleyg' Stephen Demkof' SiuLung Tarne Frederik VerbistdM. Novakc T. Grusecb%Yuval Fishera James A. Edwards`5 Rashmi Arun Patankar
_ Z. Zeng^' WenYan Chang ] P. Eck\+Hidetoshi Yokoo[) B. E. UsevitchZ'Yonggang FangY' Jichuan ChangX!Xiaolin Wu
W! Wu YungGiV+ Michael R. WickU3 Edward M. McCreightT/ Shin'ichiro Okada
S L. QianR% X. ChangsongQ% L. O. MorenoP' D. VasilevskyO C. Andrew SegallN% B. A. MarronM) A. AbdulKarimL) S. Hellerbrand
KT. MarkasJ) Apple ComputerI# T. P. SpeedH3D. RebolloMonederoG Azriel Rosenfeld
FT. Berger
EC. AneddaD% M. F. Larsen
C! A. YaagoubB% S. Ramaswamy
A! Qijun Wang@)S. Appadwedula? N. Zhang># Jidong Wang
=! Junqing Yu<# P. P. Polit; G.S. Yu:) David M. Hogan
9 H. Feng8%Bormin Huang7 Song Xiao6 H. Okada57 Mostafa Hashem Sherif4'R. C. Agarwal35C. G. NevillManning2' S. C. Fralick19 Ioannis Papaefstathiou0# WangHua Mo
/S. Kwatra
.! N.T. WangS. 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. (James Andrew) Storer"# S. Laplante!' Daniel Gajski A. Martin%Jiantao Zhou
P. Cosman A. Fox
! Kari Pulli'Hongkai Xiong% Gotz Alefeld
J. Dozier' Tamar Schlick T. Ji Shinichi Nakano#I. Lemahieu
M. Wagner/Behnam BaniEqbal' Sholomo Weiss% M. R. Lagana# A. Mohammed Clark Thomborson) Nasour Bagheri
% Peiliang Qiu Diego Santa Cruz LiYi Wei
!JaLing Wu ) Amine NaŸ¥=›£™¢3˜ m–Ÿ!”Y‘œšLŽ™‹—:‰•p‡”'†’aƒ‘€SŽ}ŒH{‹y‰8w‡nt†&r„[oƒnM†q:“,
eä÷q
“T?ž
õk
þÀÌ"
M
2¨“è*èüøa’Fq;ë(1
¢Å
Ú
•5W
Fšï 1
n E)pT3² É 3•ü°¸Å±zåÑV:°‚„„”XL
§ r(
ú
ÚyGüê¡Ü¦$

Pê²m
‘
tJÂz
`1 FÛ¥ÛÁ
2ž;aÊÍñÓÓØ® ¾‰ùL$(7%«{áºS ‡^paºÁ€¦
íã
Ê
2
šÂ
^€É F
Ø^ S±v‘±!Ïd]O¤
@“Âýˆ=qÓ¼ ¬A
#
€
á‹ ð
a ìHeng WangÐ!S. ArikawaÏ)J. D. JohnstonÎ'J. ChakareskiÍ
B. YuÌ'Ian H. WittenË%R. JandhyalaÊ'Peter FenwickÉ#Moira WylieÈPaolo FaraboschiÇ
A. AlecuÆ!H. KhaliliÅ#S. C. EvansÄT. MengÃ%MinJen TsaiÂ+Iain RichardsonÁ
Dan FengÀ
Nam Ling¿
R. Nixon¾'Erkki Sutinen½)H. V. Jagadish¼G. Lugosi»+Prasanth Mankarº%J. E. Fowler¹#Jacob Strom¸9Thomas Patrick Stanley·Jie Liang¶1Viktor K. Prasannaµ5Jeffrey Chaim Becker´!R. Rinaldo³%A. Montanari²+YK. Ramamohan (Kamisetty Ramamohan) Rao±+Eric J. Balster°)Ehud S. Conley¯!M. Maresca®%William Horn
R. Yeung¬7Roy Steven Rubinstein«V. TarokhªXin Huang©/Erik H. Volkerink¨#T. Guionnet§Scott E. Umbaugh¦%O. Shayevitz¥/Kunihiko Sadakane¤)JeongHwan Ahn£+Eric E. Johnson¢#C.S. Chien¡#D. K. Jones %A. De SantisŸ%Raymie Stataž)Robert F. Rice/J. SerraSagristaœ'Andreas Heuer›
Olu Lafeš
Wei Zhao™!N. Chomsky˜%C. A. Murthy—#Zhixin Zhou–'V. P. Bhatkar•!K. Chernik”'Hiroaki Inoue“)Hazem M. Abbas’!Jinshi Qiu‘Douglas W. Jones+L. N. Shlepakov%J. S. VitterŽ%J. T. AstolaK. ZueŒ'L. J. Latecki‹'J. AlakuijalaŠStephen R. Quake‰
A. FariaˆIMA‡#T. M. Cover†%Dongchang Yu…+Jeffery J. Kato„%Vincent Cateƒ%TingLan Lin‚!D. A. Bell'W. Effelsberg€
J. Seward'D. Bainbridge~Unicode}%J. Rossignac1Maurice G. Kendall{#Ahmad Zandiz+Ching Ming Wangy!Jizheng Xux=Balakrishnan Prabhakaranw!D. Muresanv!Petr HolubuD. Basut'Atsushi IshiisA. Keithr#D. De Ryckeq'Edward A. Foxp
V. Hlavaco#K. Katahiran%J. Benedettom%Liu ChunfenglNHKk#Martin CohnjD. KlinciCraig A. Lindleyh'Stephen Demkog'SiuLung TarnfFrederik VerbisteM. Novakd
T. Grusecc%Yuval FisherbJames A. Edwardsa5Rashmi Arun Patankar`Z. Zeng_'WenYan Chang^
P. Eck]+Hidetoshi Yokoo\)B. E. Usevitch['Yonggang FangZ'Jichuan ChangY!Xiaolin WuX!Wu YungGiW+Michael R. WickV3Edward M. McCreightU/Shin'ichiro OkadaTL. QianS%X. ChangsongR%L. O. MorenoQ'D. VasilevskyPC. Andrew SegallO%B. A. MarronN)A. AbdulKarimM)S. HellerbrandL
T. MarkasK)Apple ComputerJ#T. P. SpeedI3D. RebolloMonederoHAzriel RosenfeldG
T. BergerF
Cx#E. R. FialaÙ
Su•#Toni Cortes²)Susanne Albersç…+Masahiro Sayano‰
E. uChristian Cachin
Œ
M. Iwata‚k’%Naiyao ZhangÞpA. Singlaâ#Hongfei Yan
ôž%Gotz AlefeldSu Chen^Il Ho Kim†ºJ. Swac~+J. Ramon Varela÷à
M. Datcuˆ!P. W. Wongn
#%Ch. Goldbach„
v'D. Zeilberger L„#L. N. Kanal
z%Stephen/S. Shankar SastryAŠ)Rolf Fagerberg„q#Avivit Levy!
´+Robert L. MooreQz+Frank EichingerK3
î5x+Filippo Furfaro
î!A. Youssef33!%Jionghua Jin=@)H. Hartenstein—5R. J. V. de Medeiros˜XS. ReinÐ‚ŸŒšITU!‚%K. Murashita
üœ+Warren F. Mottee¾+J. ShaweTaylorxâã*%P. Y. SimardR!Mark Adler‹š!Y.J. Chiu000sABurkhard K. NeideckerLutz¼¤‡¥n/Jon Louis Bentley…‰Frans M. Willems+¥—+N. Scarabottolo j¥#H. Helfgott”ÑáÖ%K. M. OzŒ3Kevin Scott Attesonò*)N. R„—'R. K. W. ChanÐôúôñìçâÝØÓÎÉÄ¿ºµ°«¦¡œ—’ˆƒ~ytoje`[VQLGB=83.)$ü÷òíèãÞÙÔÏÊÅÀº´®¨¢œ–Š„~xrlf`ZTNHB<60*$
ú
ô
î
è
â
Ü
Ö
Ð
Ê
Ä
¾
¸
²
¬
¦
š
”
Ž
ˆ
‚

v
p
j
d
^
X
R
L
F
@
:
4
.
(
"
þøòìæàÚÔÎÈÂ¼¶°ª¤ž˜’Œ†€ztnhb\VPJD>82,& üöðêäÞØÒÌÆÀº´®¨¢œ–Š„~xrlf`ZTNHB<60*$
ú
ô
î
è
â
Ü
Ö
Ð
Ê
Ä
¾
¸
²
¬
¦
š
”
Ž
ˆ
‚

v
p
j
d
^
X
R
L
F
@
:
4
.
(
"
þ ø ò ì æ à Ú Ô Î È Â ¼ ¶ ° ª ¤ ž ˜ ’ Œ † € z t n h b \ V P J D > 8 2 , & üöðêäÞØÒÌÆÀº´®¨¢œ–Š„~xrlf`ZTNHB<60*$úôîèâÜÖÐÊÄ¾¸²¬¦ š”Žˆ‚vpjd^XRLF@:4.("
þøòìæàÚÔÎÈÂ¼¶°ª¤ž˜’Œ†€ztnhb\VPJD>82,& üöðêäÞØÒÌÆÀº´®¨¢œ–Š„~xrlf`ZTNHB<60*$úôîèâÜÖÐÊÄ¾¸²¬¦ š”Žˆ‚vpjd^XRLF@:4.("e plL‰Jˆ~Iˆ{FˆxEˆvBˆt@ˆq?ˆo=ˆm;ˆj9ˆh6ˆg4ˆe2ˆc0ˆaˆ`,ˆ]*ˆZ(ˆW'ˆT$ˆQ#ˆO!ˆLˆIˆFˆDˆBˆ@ˆ?ˆ=ˆ:ˆ9
ˆ8ˆ7 ˆ5ˆ3ˆ0ˆˆ*ˆ'üˆ$øˆ!÷ˆõˆôˆðˆíˆëˆêˆéˆ
¥ˆ
çˆãˆâˆáˆß‡~Ý‡}Û‡{Ú‡yØ‡v×‡sÕ‡qÔ‡pÒ‡nÐ‡mÌ‡jÊ‡fÈ‡cÆ‡aÅ‡^Ã‡]¾‡[¼‡Wº‡T·‡Q´‡N³‡L°‡J¯‡H‡E«‡Cª‡@§‡=¦‡;£‡9 ‡8Ÿ‡6‡3›‡0š‡™‡*–‡(”‡&“‡#‘‡ ‡‡‡Œ‡Š‡ˆ‡‡‡†‡„‡
ƒ‡‡ ‡}‡{‡z‡x†}v†zr†wn†vm†sk†qj†ng†ke†hd†ec†bb†_a†\`†Y_†V]†S\†Q[†OX†NW†MU†LR†KQ†HP†EN†CL†BI†?F†=E†:C†8B†6@†3?†0=†<†+:†(9†%8†"5†1†0†.†,†)†(†'†%†
#†!†
†††††………z…y…w
…t…q…o…m…lÿ…kþ…hü…eú…b÷…`ö…^ô…[ð…Wï…Tì…Qê…Oè…Næ…Lã…Já…Hß…FÜ…EÚ…DÙ…BØ…?×…<Ô…;Ò…9Ð…6Ï…3Í…0Ê…Ã…*À…&¿…"½… º…·…¶…´…±…¬…ª…¨…¦… ¤…£…¡……›„}š„{–„y”„u’„r‘„pŽ„o‰„m‡„k„„iƒ„f„e}„bz„`x„^v„\s„Zr„Xp„Vo„Sm„Ql„Oj„Mi„Jh„Ge„Dc„Ca„B_„@]„>\„;Z„8Y„6V„3U„1R„.Q„+N„(L„'K„$I„"H„C„B„A„?„>„=„;„
:„8„5„3„2ƒ1ƒ/ƒyƒw,ƒt*ƒs)ƒr(ƒo&ƒl$ƒj#ƒg!ƒfƒeƒcƒ`ƒ]ƒ[ƒYƒWƒTƒQƒNƒK
ƒI ƒGƒDƒAƒ>ƒ<ƒ9ÿƒ6ýƒ3ûƒ1ùƒ/øƒ,÷ƒ)õƒ&óƒ#ñƒ ðƒïƒìƒêƒéƒæƒäƒãƒâƒáƒßƒÞ‚Ü‚}Ú‚zÖ‚wÕ‚uÓ‚rÐ‚pÏ‚nÌ‚lÊ‚jÈ‚hÆ‚eÂ‚cÀ‚a½‚_º‚\¹‚Z´‚X±‚U‚S«‚Q¨‚O£‚L¢‚IŸ‚G‚F›‚Dš‚B—‚A”‚@‘‚>‚=‚<Š‚:‰‚8‡‚6…‚5ƒ‚4‚3‚1y‚/w‚.u‚,r‚*p‚)o‚(l‚&j‚$g‚#c‚!`‚^‚\‚Y‚W‚T‚Q‚M‚K‚J‚H‚
F‚ C‚@‚=‚9‚4}3{.y+v*s'q&o$n"mkigeca`^
\
[ZYVTÿSûRúOùM÷KõJñIðGìDêBçAæ?ä>ã=à;Ý9Û7Ø5Ô3Ò0Ð.Ï,Ì*È(Á&À"¾ ¼»¸·¶³±°®ª
¨¤ £ žœ›™}—{“yvtŠrˆp†nƒl‚j~h{fycwau_q^m\jYiWgVeUaT_R\P[NUMQIPGNDLBH@F?D=C;B9?7=4<2918/7,4)2'0&.$!+ &$!
T’HSˆaÌ
Ò* ÌŠŠ7‡!ŽC
@PhdThesis{Chen:1991:EDC,
author = "Ji Chen",
title = "The effect of data compression on image quality in
highresolution digital chest radiography",
type = "{Ph.D.} thesis",
school = "University of Michigan",
address = "Ann Arbot, MI, USA",
pages = "216",
year = "1991",
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/303978189",
acknowledgement = acknhfb,
advisor = "Janice M. Jenkins and Michael J. Flynn",
classification = "0541: Biomedical research; 0544: Electrical
engineering; 0574: Radiology",
dissertationthesisnumber = "9135566",
subject = "Electrical engineering; Radiology; Biomedical
research",
}‰‡†Œ3
@InProceedings{Saupe:1994:CRM,
author = "Dietmar Saupe and Raouf Hamzaoui",
editor = "J. M. Blackledge",
booktitle = "Proceedings of the IMA Conference on Image Processing;
Mathematical Methods and Applications,",
title = "Complexity Reduction Methods for Fractal Image
Compression",
institution = "Institut f{\"uÙ‡X1
@InProceedings{Horspool:1992:CWB,
author = "R. Nigel Horspool and Gordon V. Cormack",
title = "Constructing WordBased Text Compression Algorithms",
crossref = "Storer:1992:DCC",
pages = "6271",
month = apr,
year = ……=Š{
@InProceedings{Villasenor:1995:WVC,
author = "J. Villasenor and R. Jain and B. Belzer and W. Boring
and C. Chien and C. Jones and J. Liao and S. Molloy and
S. Nazareth and B. Schoner and J. Short",
title = "Wireless video coding system demonstration",
crossref = "Storer:1995:DDC",
pages = "448448",
year = "1995",
DOI = "http://dx.doi.org/10.1109/DCC.1995.515558",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515558",
acknowledgement = acknhfb,
}È¡…Š+
@InProceedings{DiLillo:2007:TCU,
author = "A. {Di Lillo} and J. A. Storer and G. Motta",
title = "Texture Classification Using {VQ} with Feature
Extraction based on Transforms Motivated by the Human
Visual System",
crossref = "Storer:2007:DPD",
pages = "392392",
year = "2007",
DOI = "http://dx.doi.org/10.1109/DCC.2007.74",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148793",
acknowledgement = acknhfb,
}
' ‡P!
@Article{Perkins:2004:RDC,
author = "S. Perkins and D. H. Smith and A. Ryley",
title = "Robust Data Compression: Consistency Checking in the
Synchronization of Variable Length Codes",
journal = jCOMPJ,
volume = "47",
number = "3",
pages = "309319",
month = may,
year = "2004",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/47.3.309",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Jun 8 12:55:15 MDT 2004",
bibsource = "http://www.math.utah.edu/pub/tex/bib/compj2000.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_03/",
URL = "",
acknowledgement = acknhfb,
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
}ž= "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.",
}
d idŒX 3)a!57E};7iŽarticledatacompression.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 AnnalenFrenchackdsG. 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",
}W 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 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.",
}
¥‹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 AnnalenGermanackdsA. 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.",
}Ž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}) [{On} 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.",
}
$1$
Bñ¯…Š
@Article{Albers:1996:ACA,
author = "S. Albers and M. Mitzenmacher",
title = "Average Case Analyses of List Update Algorithms, with
Applications to Data Compression",
journal = jLECTNOTESCOMPSCI,
volume = o¡_
@Article{Abel:2007:IFC,
author = "J{\"u}rgen Abel",
title = "Incremental frequency count  a post {BWT}stage for
the {BurrowsWheeler} compression algorithm",
journal = jSPE,
volume = "37",
number = "3",
pages = "247265",
month = mar,
year = "2007",
CODEN = "SPEXBL",
DOI = "http://dx.doi.org/10.1002/spe.763",
ISSN = "00380644 (print), 1097024X (electronic)",cˆM‘
@Article{Abel:2010:PBS,
author = "J{\"u}rgen Abel",
title = "Post {BWT} stages of the {BurrowsWheeler}
compression algorithm",
journal = jSPE,
volume = "40",
number = "9",
pages = "751777",
month = aug,
year = "2010",
CODEN = "SPEXBL",
DOI = "http://dx.doi.org/10.1002/spe.982",
ISSN = "00380644 (print), 1097024X (electronic)",
ISSNL = "00380644",
b —ˆD‘
@Article{Abbas:2014:FDC,
author = "Ahmed Mohammed Abbas and Azuraliza Abu Bakar and Mohd
Zakree Ahmad",
title = "Fast dynamic clustering {SOAP} messages based
compression and aggregation model for enhanced
performance of {Web} services",
journal = jJNETWCOMPUTAPPL,
volume = "41",
number = "??",
pages = "8088",
month = may,
year = "2014",
CODEN = "J
ö†O
@Article{Acharya:1996:LVL,
author = "Tinku Acharya and Joseph F. J{\'a}J{\'a}",
title = "An OnLine Variable Length Binary Encoding of Text",
journal = jINFOSCI,
volume = "94",
pages = "122",
year = "1996",
CODEN = "ISIJBC",
ISSN = "00200255 (print), 18726291 (electronic)",
ISSNL = "00200255",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Information Sciences",
rawdata = "Acharya, Tinku and Joseph F. J\'aJ\'a (1996) ``An
OnLine Variable Length Binary Encoding of Text,'' {\it
Information and Computer Science}, {\bf94}:122.",
xxjournal = "Information and Computer Science",
}ÕŠ”
@Article{Abrahamson:1989:ADS,
author = "David M. Abrahamson",
title = "An Adaptive Dependency Source Model for Data
Compression",
journal = jCACM,
volume = "32",
number = "1",
pages = "7783",
month = jan,
year = "1989",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "68P25",
MRnumber = "993 620",
bx‡M
@Article{Abel:2005:UTP,
author = "J. Abel and W. Teahan",
title = "Universal text preprocessing for data compression",
journal = jIEEETRANSCOMPUT,
volume = "54",
number = "5",
pages = "497507",
month = may,
year = "2005",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2005.85",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Mon Jul 4 16:17:16 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/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1407841",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}Ð
û"}Žêû…2Še
@Article{Anonymous:1992:FDC,
‹–
@Article{Ahmed:1974:DCT,
author = "N. Ahmed and T. NataraZ›5
@Article{AlHafeedh:2012:CIB,
author = "Anisa AlHafeedh and Maxime Crochemore and Lucian Ilie
and Evguenia Kopylova and W. F. Smyth and German
Tischler and Munina Yusufu",
title = "A comparison of indexbased {LempelZiv LZ77}
factorization algorithms",
journal = jCOMPSURV,
volume = "45",
number = "1",
pages = "5:15:??",
month = nov,
year = "2012",
CODEN
G‡"ŽE
@Article{Ajtai:2002:CEU,
author = "Miklos Ajtai and Randal Burns and Ronald Fagin and
Darrell D. E. Long and Larry Stockmeyer",
title = "Compactly encoding unstructured inputs with
differential compression",
journal = jJACM,
volume = "49",
number = "3",
pages = "318367",
month = may,
year = "2002",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Tue Sep 10 17:35:44 MDT 2002",
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 = acknhfb,
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}A‹–
@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 = R‡#ŽG
@Article{Ahlswede:1997:UCI,
author = "Rudolf Ahlswede and Te Sun Han and Kingo Kobayashi",
title = "Universal Coding of Integers and Unbounded Search
Trees",
journal = jIEEETRANSINFTHEORY,
volume = "43",
number = "2",
pages = "669682",
year = "1997",
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 = "Ahlswede, Rudolf, Te Sun Han, and Kingo Kobayashi
(1997) ``Universal Coding of Integers and Unbounded
Search Trees,'' {\it IEEE Transactions on Information
Theory}, {\bf43}(2):669682.",
}u‰
’
@Article{Ageenko:1999:FAM,
author = "Eugene I. Ageenko and Pasi Fr{\"a}nti",
title = "Forwardadaptive method for contextbased compression
of large binary images",
journal = jSPE,
volume = "29",
number = "11",
pages = "943952",
month = sep,
year = "1999",
CODEN = "SPEXBL",
ISSN = "00380644 (print), 1097024X (electronic)",
ISSNL = "00380644",
bibdate = "SaE•]«;
@Article{Agarwal:2006:AGA,
author = "R. C. Agarwal and K. Gupta and S. Jain and S.
Amalapurapu",
title = "An approximation to the greedy algorithm for
differential compression",
journal = jIBMJRD,
volume = "50",
number = "1",
pages = "149166",
month = jan,
year = "2006",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = æ
V
V3W 33'aQE};Y/]i‘articledatacompression.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",
title = "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",
}‹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 AnnalenGermanackdsA. 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.",
} "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",
}
’ ê’ˆUW 31%5!E};%ŠYgarticledatacompression.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.",
}Œ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 NyquistCertain 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.",
}
Ã
ÃŠ@
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/datacompression.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.",
}‹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/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.",
}
O
O‹.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/datacompression.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.",
} 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,",
}
W±
$5FW
¼‡F
@Article{Anh:2005:IIC,
author = "Vo Ngoc Anh and Alistair Moffat",
title = "Inverted Index Compression Using WordAligned Binary
Codes",
journal = jINFRETR,
volume = "8",
pages = "151166",
year = "2005",
CODEN = "IFRTFY—I¯
@Article{Altingovde:2008:ICB,
author = "Ismail Sengor Altingovde and Engin Demir and Fazli Can
and {\"O}zg{\"u}r Ulusoy",
title = "Incremental clusterbased retrieval using compressed
clusterskipping inverted files",
journal = jTOIS,
volume = "26",
number = "3",
pages = "15:115:??",
month = jun,
year = "2008",
CODEN = "ATISET",
DOI = "http://doi.acm.org/10ÑëïK
@Article{Amidon:1971:ASB,
author = "E. L. Amidon and G. S. —I¯
@Article{Altingovde:2008:ICB,
author = "Ismail Sengor Altingovde and Engin Demir and Fazli Can
and {\"O}zg{\"u}r Ulusoy",
title = "Incremental clusterbased retrieval using compressed
clusterskipping inverted files",
journal = jTOIS,
volume = "26",
number = "3",
pages = "15:115:??",
month = jun,
year = "2008",
CODEN = "ATISET",
DOI = "http://doi.acm.org/10ÑŒH™
@Article{Aleh:1981:DUB,
author = "Avner Aleh and K. Dan Levin",
title = "The determination of upper bounds for economically
effective compression in packet switching networks",
journal = jSIGMETRICS,
volume = "11",
number = "1",
pages = "6472",
month = "Spring",
year = "1981",
CODEN = "????",
DOI = "http://doi.acm.org/10.1145/800047.801694",
ISSN = "01635999 (pri¯Œ@™
@Article{Albers:1998:ACA,
author = "Susanne Albers and Michael Mitzenmacher",
title = "Average Case Analyses of List Update Algorithms, with
Applications to Data Compression",
journal = jALGORITHMICA,
volume = "21",
number = "3",
pages = "312329",
month = jul,
year = "1998",
CODEN = "ALGOEJ",
ISSN = "01784617 (print), 14320541 (electronic)",
ISSNL = "01784617",
À…Š
@Article{Albers:1996:ACA,
author = "S. Albers and M. Mitzenmacher",
title = "Average Case Analyses of List Update Algorithms, with
Applications to Data Compression",
journal = jLECTNOTESCOMPSCI,
volume = "1099",
pages = "514??",
year = "1996",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Sat Dec 21 09:47:26 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}×†M
@Article{Alameldeen:2004:ACC,
author = "Alaa R. Alameldeen and David A. Wood",
title = "Adaptive Cache Compression for HighPerformance
Processors",
journal = jCOMPARCHNEWS,
volume = "32",
number = "2",
pages = "212212",
month = mar,
year = "2004",
CODEN = "CANED2",
ISSN = "01635964 (ACM), 08847495 (IEEE)",
ISSNL = "01635964",
bibdate = "Fri May 12 09:40:45 MDT 2006",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/sigarch.bib",
acknowledgement = acknhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}V
##ŸZZ 3//Y17/!CˆG;„I‚O/„SY£#articledatacompression.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 `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 = "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,",
}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,",
}
àà˜
X 3//q17/!C‡G;Q‚O/Uqœq"articledatacompression.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/journal/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,",
}
é‰dW '3)#+_1E};#Œmastersthesisdatacompression.bibKraft:1949:DQGL. G. KraftA Device for Quantizing, Grouping, and Coding Amplitude Modulated PulsesMaster's ThesisDepartment 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.",
}ˆU !3%!K]1E};!KŠtechreportdatacompression.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.",
}.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",
}
uuŸZ 3/_17E…;S‚†!O†!/Wc¡Aarticledatacompression.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 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.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",
}
·
ø·Š>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/datacompression.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.",
}‡U 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.",
}Š~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 Institute 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.",
}
V°bV
Á¡†
Œ
@Article{Davidson:2005:FDC,
author = "Michael Davidson and Lucian Ilie",
title = "Fast Data Compression with Antidictionaries",
journal = jFUNDINFO,
volume = "64",
number = "14",
pages = "119134",
month = jul,
year = "2005",
CODEN = "FUMAAJ",
ISSN = "01692968 (print), 18758681 (electronic)",
ISSNL = "01692968",
bibdate = "Sat Mar 5 17:02:46 MST 2016",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = acknhfb,
fjournal = "Fundamenta Informaticae",
journalURL = "http://content.iospress.com/journals/fundamentainformaticae",
}ë†=Œ{
@Article{Davidson:2004:FDC,
author = "Michael Davidson and Lucian Ilie",
title = "Fast Data Compression with Antidictionaries",
journal = jFUNDINFO,
volume = "64",
number = "14",
pages = "119134",
month = jul,
year = "2004",
CODEN = "FUMAAJ",
ISSN = "01692968 (print), 18758681 (electronic)",
ISSNL = "01692968",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Fundamenta Informaticae",
rawdata = "Davidson, Michael and Lucian Ilie (2004) ``Fast Data
Compression with Antidictionaries,'' {\it Fundamenta
Informaticae}, {\bf64}(14):119134, July.",
}l†Œ=
@Article{Davis:1995:ASQ,
author = "Geoffrey Davis",
title = "Adaptive SelfQuantization of Wavelet Subtrees: a
WaveletBased Theory of Fractal Image Compression",
journal = jPROCSPIE,
volume = "2569",
pages = "294307",
month = jul,
year = "1995",
CODEN = "PSISDG",
ISSN = "0277786X (print), 1996756X (electronic)",
ISSNL = "0277786X",
bibsource = "http://www.math.utah.edu/pub/bibnet/subjects/fractalimagecomp.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cs.dartmouth.edu/~gdavis/papers/spie_sandiego.ps.g",
fjournal = "Proceedings of the SPIE  The International Society for Optical Engineering",
}UŒb™E
@Article{Davis:1981:DCL,
author = "R. H. Davis and C. Rinaldi and C. J. Trebilcock",
title = "Data Compression in Limited Capacity Microcomputer
Systems",
journal = jINFOPROCLETT,
volume = "13",
number = "45",
pages = "138141",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
ISSN = "00200190 (print), 18726119 (electronic)",
ISSNL = "0020²†N
@Article{Daubechies:1988:OBC,
author = "Ingrid Daubechies",
title = "Orthonormal 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.",
}
É
uÉ)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 to 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.",
}‹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.utah.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.",
}: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.",
}
®"
3,=N®‡Ž=
@Article{Fiorini:2013:DTDb,
author = "Rodolfo A. Fiorini and Andrea Condorelli and Giuseppe
Laguteta",
title = "Discrete Tomography Data Footprint Reduction via
Natural Compression",
journal = jFUNDINFO,
volume = "125",
number = "34",
pages = "273284",
month = jul,
year = "2013",
CODEN = "FUMAAJ",
DOI = "http://dx.doi.org/10.3233/FI2013864",
ISSN = "01692968 (print), 18758681 (electronic)",
ISSNL = "01692968",
bibdate = "Sat Mar 5 17:17:16 MST 2016",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = acknhfb,
fjournal = "Fundamenta Informaticae",
journalURL = "http://content.iospress.com/journals/fundamentainformaticae",
}øŠR•%
@Article{Filgueira:2011:ACE,
author = "Rosa Filgueira and David E. Singh and Jes{\'u}s
Carretero and Alejandro Calder{\'o}n and F{\'e}lix
Garc{\'\i}a",
title = "{AdaptiveCoMPI}: Enhancing {MPI}Based Applications'
Performance and Scalability by using Adaptive
Compression",
journal = jIJHPCA,
volume = "25",
number = "1",
pages = "93114",
month = feb,
O›
@Article{Fiala:1989:DCF,
author = "E. R. Fiala and D. H. Greene",
title = "Data Compression with Finite {Windows}",
journal = jCACM,
volume = "32",
number = "4",
pages = "490505",
month = apr,
year = "1989",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.acm.org/„„ˆ
@Article{Fetik:1996:MXG,
author = "Richard Fetik",
title = "Multimedia {X}: Generating {GIFs} on the Fly",
journal = jXJ,
volume = "5",
number = "5",
pages = "86??",
month = may,
year = "1996",
CODEN = "XJOUEA",
ISSN = "10567003",
bibdate = "Thu Sep 05 09:14:34 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "The X Journal",
}‡}{
@Article{Ferragina:2011:OPT,
author = "Paolo Ferragina and Igor Nitto and Rossano Venturini",
title = "On Optimally Partitioning a Text to Improve Its
Compression",
journal = jALGORITHMICA,
volume = "61",
number = "1",
pages = "5174",
month = sep,
year = "2011",
CODEN = "ALGOEJ",
ISSN = "01784617 (print), 14320541 (electronic)",
ISSNL = "01784617",
bibdate =
˜e±K
@Article{Ferragina:2009:CIL,
author = "Paolo Ferragina and Fabrizio Luccio and Giovanni
Manzini and S. Muthukrishnan",
title = "Compressing and indexing labeled trees, with
applications",
journal = jJACM,
volume = "57",
number = "1",
pages = "4:14:33",
month = nov,
year = "2009",
CODEN = "JACOAH",
DOI = "http://doi.acm.org/10.1145/1613676.1613680",
ISSN Xžt½i
@Article{Ferragina:2007:CRS,
author = "Paolo Ferragina and Giovanni Manzini and Veli
M{\"a}kinen and Gonzalo Navarro",
title = "Compressed representations of sequences and fulltext
indexes",
journal = jTALG,
volume = "3",
number = "2",
pages = "20:120:??",
month = may,
year = "2007",
CODEN = "????",
DOI = "http://doi.acm.org/10.1145/1240233.1240243",
ISSƒ
„
z„“sX3GM173%Eƒu;+‚OG+M™A#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.bib; 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.",
}‹V 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.utah.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.",
}at 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 3%O97E};YOŒSarticledatacompression.bibMax:1960:QMDJoel MaxQuantizing for minimum distortionjIRETRANSINFTHEORYIT6712mar31960IRITAY00961000 OR 00961000Sat Jan 26 12:46:12 MST 2013http://www.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.",
}Š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 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",
}
yŠ
ŽWhŠy†cG
@Article{Hayden:2002:TQC,
author = "Patrick Hayden and Richard Jozsa and Andreas Winter",
title = "Trading quantum for classical resources in quantum
data compression",
journal = jJMATHPHYS,
volume = "43",
number = "9",
pages = "44044444",
month = sep,
year = "2002",
CODEN =ˆ
@Article{Hashempour:2005:AAC,
author = "H. Hashempour and F. Lombardi",
title = "Application of arithmetic coding to compression of
{VLSI} test data",
journal = jIEEETRANSCOMPUT,
volume = "54",
number = "9",
pages = "11661177",
month = sep,
year = "2005",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2005.136",
ISSN = "00189340 (print), 15579956 (elect¡ïw
@Article{Hawley:1990:POAb,
author = "Michael Hawley",
title = "The Personal Orchestra, or Audio Data Compression by
10,000:1",
journal = jCOMPSYS,
volume = "3",
number = "2",
pages = "289329",
month = "Spring",
year = "1990",
CODEN = "CMSYE2",
ISSN = "08956340",
bibdate = "Fri Sep 13 08:53:14 MDT 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacomp²Œ.˜]
@Article{Hart:1996:FIC,
author = "John C. Hart",
title = "Fractal image compression and recurrent iterated
function systems",
journal = jIEEECGA,
volume = "16",
number = "4",
pages = "2533",
month = jul,
year = "1996",
CODEN = "ICGADZ",
ISSN = "02721716 (print), 15581756 (electronic)",
ISSNL = "02721716",
bibdate = "Sat Jan 25 06:42:48 MST 1997",
bibsouó†5Œk
@Article{Hans:2001:LCD,
author = "Mat Hans and R. W. Schafer",
title = "Lossless Compression of Digital Audio",
journal = jIEEESIGNALPROCESSMAG,
volume = "18",
number = "4",
pages = "2132",
month = jul,
year = "2001",
CODEN = "ISPRE6",
ISSN = "10535888 (print), 15580792 (electronic)",
ISSNL = "10535888",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE signal processing magazine",
rawdata = "Hans, Mat and R. W. Schafer (2001) ``Lossless
Compression of Digital Audio,'' {\it IEEE Signal
Processing Magazine}, {\bf18}(4):2132, July.",
}‡Ž
@Article{Hankerson:1999:TMI,
author = "Darrel Hankerson and Greg A. Harris",
title = "Transform Methods and Image Compression",
journal = jLINUXJ,
volume = "57",
pages = "????",
month = jan,
year = "1999",
CODEN = "LIJOFX",
ISSN = "10753583 (print), 19383827 (electronic)",
ISSNL = "10753583",
bibdate = "Thu Jun 3 06:33:53 MDT 1999",
bibsource = "http://noframes.linuxjournal.com/ljissues/issue57/index.html;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/linuxjournal.bib",
abstract = "An introduction to JPEG and wavelet transform
techniques.",
acknowledgement = acknhfb,
fjournal = "Linux Journal",
journalURL = "http://portal.acm.org/citation.cfm?id=J508",
}êˆ>}
@Article{Han:1997:EDE,
author = "WeiYu Han and Ja Chen Lin",
title = "Edge detection and edgepreserved compression for
error diffused images",
journal = jCOMPUTERSANDGRAPHICS,
volume = "21",
number = "6",
pages = "757767",
month = nov # "" # dec,
year = "1997",
CODEN = "COGRD2",
ISSN = "00978493 (print), 18737684 (electronic)",
ISSNL = "00978493",
bibdapan 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.",
}
ú÷Šú‡
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.",
}ˆjW 3'!#E};;!‹articledatacompression.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.",
}ŽW 3+w;a7E‚+;]+w‘C 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 Encoding 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.",
} 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",
}
•¨M•‰5V 3/1A%W5C7;e91A‹ phdthesisdatacompression.bibDavisson:1964:TDCLee David DavissonTheory of Data CompressionPh.D. thesisUniversity 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",
}†XU 3/#G+3E};#G‡ubookdatacompression.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.",
}ŽUX %3+15//)!CQE‚!; Y135
3‘MJincollectiondatacompression.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 Naismith 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",
} "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",
}
Kbž¯#K‡V
@Article{Bekesi:1997:GAL,
author = "J{\'o}zsef B{\'e}k{\'e}si and G{\'a}bor Galambos and
Ulrich Pferschy and Gerhard J. Woeginger",
title = "Greedy Algorithms for OnLine Data Compression",
journal = jJALG,
volume = "25",
number = "2",
pages = "274289",
month = nov,
year = "1997",
CODEN = "JOALDV",
DOI = "http://dx.doi.org/10.1006/jagm.1997.0885",
ISSN = "01966774 (print), 10902678 (electronic)",
ISSNL = "01966774",
bibdate = "Tue Dec 11 09:16:52 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jalg.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0196677497908853",
acknowledgement = acknhfb,
fjournal = "Journal of Algorithms",
journalURL = "http://www.sciencedirect.com/science/journal/01966774",
}€…
Š
@Article{Bekesi:1996:WCA,
author = "J. Bekesi and G. Galambos and U. Pferschy and G. J.
Woeginger",
title = "WorstCase Analysis for OnLine Data Compression",
journal = jLECTNOTESCOMPSCI,
volume = "1120",
pages = "288300",
year = "1996",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Mon Aug 25 16:23:54 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}ß0ša
@Article{Bekesi:1996:FGA,
author = "J. B{\'e}k{\'e}si and G. Galambos and U. Pferschy and
G. J. W{\"o}ginger",
title = "The Fractional Greedy Algorithm for Data Compression",
journal = jCOMPUTING,
volume = "56",
number = "1",
pages = "2946",
month = mar,
year = "1996",
CODEN = "CMPTA2",
ISSN = "0010485X (print), 14365057 (electronic)",
ISSNL = "0010485X",
MRclaÄ‡B
@Article{Beal:2016:CPP,
author = "Richard Beal and Donald Adjeroh",
title = "Compressed parameterized pattern matching",
journal = jTHEORCOMPSCI,
volume = "609 (part 1)",
number = "??",
pages = "129142",
day = "4",
month = jan,
year = "2016",
CODEN = "TCSCDI",
ISSN = "03043975 (print), 18792294 (electronic)",
ISSNL = "03043975",
bibdate = "Fri Dec 4 06:41:42 MST 2015",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/stringmatching.bib;
http://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397515008440",
acknowledgement = acknhfb,
fjournal = "Theoretical Computer Science",
journalURL = "http://www.sciencedirect.com/science/journal/03043975/",
}
B‡Ž9
@Article{Bartkowiak:2001:SAO,
author = "Maciej Bartkowiak and Adam {\L}uczak",
title = "A Simple Algorithm for Ordering and Compression of
Vector Codebooks",
journal = jLECTNOTESCOMPSCI,
volume = "2124",
pages = "102??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Sat Feb 2 13:05:26 MST 2002",
bibsource = "http://link.springerny.com/link/service/series/0558/tocs/t2124.htm;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springerny.com/link/service/series/0558/bibs/2124/21240102.htm;
http://link.springerny.com/link/service/series/0558/papers/2124/21240102.pdf",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}çU{
UA
'4†M
@Article{Alameldeen:2004:ACC,
author = "Alaa R. Alameldeen and David A. Wood"‡fM
@Article{AlShammary:2012:RAS,
author = "Dhiah AlShammary and Ibrahim Khalil",
title = "Redundancyaware {SOAP} messages compression and
aggregation for enhanced performance",
journal = jJNETWCOMPUTAPPL,
volume = "35",
number = "1",
pages = "365381",
month = jan,
year = "2012",
CODEN = "JNCAF3",
ISSN = "10848045 (print), 10958592 (electronic)",
ISSNL = "10848045",
bibdate = "Wed Jan 28 15:44:09 MST 2015",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S108480451100172X",
acknowledgement = acknhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journalURL = "http://www.sciencedirect.com/science/journal/10848045",
}‚$ K
@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:2;g‰’
@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/datacom
H‡`A
@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.",
}òˆ+
@Article{Adiego:2007:LZC,
author = "Joaqu{\'\i}n Adiego and Gonzalo Navarro and Pablo de
la Fuente",
title = "{LempelZiv} compression of highly structured
documents",
journal = jJAMSOCINFSCITECHNOL,
volume = "58",
number = "4",
pages = "461478",
day = "15",
month = feb,
year = "2007",
CODEN = "JASIEF",
DOI = "http://dx.doi.org/10.1002/asi.fcw'‘jwî]F»†I
@Article{Berger:1990:OEB,
author = "T. Berger and R. Yeung",
title = "Optimum `1'Ended Binary Prefix Codes",
journal = jIEEETRANSINFTHEORY,
volume = "36",
number = "6",
pages = "14351441",
month = nov,
year = "1990",
CODEN = "IETTs“ ¦
@Article{Bailey:1990:PDC,
author = "R. L. Bailey and R. Mukkamala",
title = "Pipelining Data Compression Algorithms",
journal = jCOMPJ,
volume = "33",
number = "4",
pages = "308313",
month = aug,
year = "1990",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/33.4.308",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tu¤§‰[“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}",
journal = jSPE,
volume = "29",
number = "10",
pages = "863874",
month = aug,
year = "1999",
CODEN = "SPEXBL",
ISSN = "00380644 (print), 1097024X (electronic)",
ISSNL = "00380644",
bibJC‡Ž
@Article{Baran:2000:NVNb,
author = "Nicholas Baran",
title = "News and Views: Neural Net Crowned King; Smart Shirts
Monitor Vital Signs; {McMaster} Team Wins College
Design Contest; {Java} Applet Tracks Space Station;
{Sandia Red Team} Batting 1000; New Digital Geometry
Compression Algorithm",
journal = jDDJ,
volume = "25",
number = "10",
pages = "1818",
month = oct,
year = "2000",
CODEN = "DDJOEB",
ISSN = "1044789X",
bibdate = "Wed Nov 8 15:09:24 MST 2000",
bibsource = "http://www.ddj.com/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/java2000.bib",
acknowledgement = acknhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}c
Q†o_
@Article{Ball:1997:GIF,
author = "Jimmy Ball",
title = "{GIF} Images on the Fly: New images from old, in real
time",
journal = jLINUXJ,
volume = "43",
pages = "????",
month = nov,
year = "1997",
CODEN = "LIJOFX",
ISSN = "10753583 (print), 19383827 (electronic)",
ISSNL = "10753583",
bibdate = "Fri Oct 9 08:35:26 MDT 1998",
bibsource = "http://noframes.linuxjournal.com/ljissues/issue43/index.html;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/linuxjournal.bib",
URL = "ftp://ftp.ssc.com/pub/lj/listings/issue43/2411.tgz",
acknowledgement = acknhfb,
fjournal = "Linux Journal",
journalURL = "http://portal.acm.org/citation.cfm?id=J508",
}}.‡Ž/
@Article{Baby:2005:ULA,
author = S†iS
@Article{Apiki:1991:LDC,
author = "Steve Apiki",
title = "Lossless Data Compression: An explanation of two
compression algorithms",
journal = jBYTE,
volume = "16",
number = "3",
pages = "309312, 314, 386387",
month = mar,
year = "1991",
CODEN = "BYTEDJ",
ISSN = "03605280 (print), 10827838 (electronic)",
ISSNL = "03605280",
bibdate = "Tue Jan 2 10:01:41 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "C6130 (Data handling techniques)",
fjournal = "BYTE Magazine",
keywords = "Compression algorithms; Data compression; Huffman
coding; Lossless compression; LZW coding",
thesaurus = "Data compression; Encoding",
}w
i Y35]/57Eƒ;_SkW]cg%articledatacompression.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",
}45411",
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.",
}!
‘‘šl![ 31[57E‚i;†oqe†o1›earticledatacompression.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)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.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 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.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.",
}
Aþ‰t$V 3+/5;57E};[/5Œarticledatacompression.bibGolomb:1966:RLESolomon W. GolombRunLength EncodingsjIEEETRANSINFTHEORYIT1233994011966IETTAW00189448 (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 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.",
}ˆ@#U 3'a#7E};5uŠIarticledatacompression.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.",
}‹<"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 MSTProceedings 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.",
}
`qåqö" Ô^‰=
@Article{Klasing:1998:ICCa,
author = "R. Klasing",
title = "Improved˜°
@Article{Joo:2008:ECP,
author = "Yongsoo Joo and Youngjin Cho and Donghwa Shin and
Jaehyun Park and Naehyuck Chang",
title = "An energy characterization platform for memory devices
and energyaware data compression for multilevelcell
flash memory",
journal = jTODAES,
volume = "13",
number = "3",
pages = "43:143:??",
month = jul,
year = "2008",
CODEN = §)
@Article{Kaklamanis:2000:HAS,
author = "C. Kaklamanis and C. Konstantopoulos and A. Svolos",
title = "A Hypercube Algorithm for Sliding Window Compression",
journal = jPARALLELPROCESSLETT,
volume = "10",
number = "4",
pages = "315??",
month = dec,
year = "2000",
CODEN = "PPLTEE",
ISSN = "01296264 (print), 1793642X (electˆ)
@Article{Joseph:2012:EQP,
author = "A. Benjamin Joseph and Baskaran Ramachandran",
title = "Enhanced Quality Preserved Image Compression Technique
Using Edge Assisted Wavelet Based Interpolation",
journal = jLECTNOTESCOMPSCI,
volume = "7135",
pages = "146153",
year = "2012",
CODEN = "LNCSD9",
DOI = "http://dx.doi.org/10.1007/9783642292804_16",
ISSN = "03029743 (print), 161
y–Q%
@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 = "X‹!–C
@Article{Jones:1988:AST,
author = "Douglas W. Jones",
title = "Application of Splay Trees to Data Compression",
journal = jCACM,
volume = "31",
number = "8",
pages = "9961007",
month = aug,
year = "1988",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sat Apr 06 08:06:29 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/b]„L‰
@Article{Kaerkkaeinen:1996:LZI,
author = "J. Kaerkkaeinen and E. Sutinen",
title = "{LempelZiv} Index for $q$Grams",
journal = jLECTNOTESCOMPSCI,
volume = "1136",
pages = "378??",
year = "1996",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Sat Dec 21 09:47:26 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}#ˆ(Q
@Article{Joshi:1993:ISC,
author = "R. L. Joshi and V. J. Crump and T. R. Fischer",
title = "Image Subband Coding Using Arithmetic and Trellis
Coded Quantization",
journal = jIEEETRANSCIRCUITSSYSTVIDEOTECH,
volume = "5",
number = "6",
pages = "515523",
month = dec,
year = "1993",
CODEN = "ITCTEM",
ISSN = "10518215 (print), 15582205 (electronic)",
ISSNL = "1051¢Š”1
@Article{Jordan:1998:PCB,
author = "Corinne Le Buhan Jordan and Touradj Ebrahimi and Murat
Kunt",
title = "Progressive ContentBased Shape Compression for
Retrieval of Binary Images",
journal = jCOMPVISIMAGEUNDERSTANDING,
volume = "71",
number = "2",
pages = "198212",
month = aug,
year = "1998",
CODEN = "CVIUF4",
DOI = "http://dx.doi.org/10.1006/cviu.199ù
p
æpŠs&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/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.",
}Š%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 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",
}9",
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",
}'
r'Y 35])/!57Eƒ;ISkW]M)oarticledatacompression.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",
}: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/",
}(
¬¿¬¤)[3+QA57EƒC;/Œk?cŒkQ/A Yarticledatacompression.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; h6”>(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/datacompression.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/",
}b/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",
})ttp://www.math.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",
}
^Š),X 315%97C7;e95‹ephdthesisdatacompression.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 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/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",
}ˆ.+U 3/)]1KE};)]Š!phdthesisdatacompression.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.",
}‰*V 39A%51C7;e99EŠophdthesisdatacompression.bibStanley:1967:CMDThomas Patrick StanleyCompression 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",
}
½‰s/W '3+7==/5E1;‚7=Š€mastersthesisdatacompression.bibHusson:1970:DCSGeorges Eugene HussonData compression systemsDip.Eng. (Elec.), M.Eng.McGill UniversityMontreal, QC, Canadaiii + 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,
}‰+.V 3+3O%75C7;e93OŠwphdthesisdatacompression.bibBowyer:1970:DCTDuane Ernest BowyerData Compression and TransmissionPh.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",
}Œ@Y 3'+O]77E];9#+O_articledatacompression.bibLynn:1969:QCCKenneth C. LynnA quantitative comparison of conventional information compression techniques in dental literaturejAMDOC202149151apr41969AMDOA7http://dx.doi.org/10.1002/asi.46302002060096946X OR 0096946X0096946X OR 0096946XFri Sep 11 06:21:31 MDT 2015http://www.math.utah.edu/pub/tex/bib/amdoc.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2015.09.11 06:21:31 MDTAmerican Documentationacknhfbhttp://onlinelibrary.wiley.com/journal/10.1002/(ISSN)23301643/19 Apr 2007Kenneth C. LynnA quantitative comparison of conventional information compression techniques in dental literature
@Article{Lynn:1969:QCC,
author = "Kenneth C. Lynn",
title = "A quantitative comparison of conventional information
compression techniques in dental literature",
journal = jAMDOC,
volume = "20",
number = "2",
pages = "149151",
month = apr,
year = "1969",
CODEN = "AMDOA7",
DOI = "http://dx.doi.org/10.1002/asi.4630200206",
ISSN = "0096946X",
ISSNL = "0096946X",
bibdate = "Fri Sep 11 06:21:31 MDT 2015",
bibsource = "http://www.math.utah.edu/pub/tex/bib/amdoc.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "American Documentation",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)23301643/",
onlinedate = "19 Apr 2007",
}
è
¦è‹;1X 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:20: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",
}ŠW0X 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/; 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",
}
¬á
¿Ð†¬‡X1
@Article{Nelson:1997:JZF,
author = "Mark R. Nelson and Mark Nelson",
title = "{Java} and the Zip File Format: Using {Java} to
compress and extract files",
journal = jDDJ,
volume = "22",
number = "12",
pages = "50, 5254, 102",
month = dec,
year = "1997",
CODEN = "DDJOEB",
ISSN = "1044789X",
bibdate = "Thu Nov 09 13:00:54 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/java.bib",
abstract = "By compressing data and reducing the number of
download transactions, Sun's java.util.zip package
speeds the loading of applet components across the
Internet. Datacompression guru Mark Nelson examines
this package.",
acknowledgement = acknhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}×„Y‰3
@Article{Nelson:1991:DDC,
author = "Mark R. Nelson",
title = "{DDJ} Data Compression Contest Results",
journal = jDDJ,
volume = "16",
number = "11",
pages = "62??",
month = nov,
year = "1991",
CODEN = "DDJOEB",
ISSN = "1044789X",
bibdate = "Mon Sep 2 09:09:39 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}Íšµ
@Article{Navarro:2015:GDR,
author = "Gonzalo Navarro and Simon J. Puglisi and Daniel
Valenzuela",
title = "General Document Retrieval in Compact Space",
journal = jACMJEXPALGORITHMICS,
volume = "19",
number = "??",
pages = "2.3:12.3:??",
month = feb,
year = "2015",
CODEN = "????",
DOI = "http://dx.doi.org/10.1145/2670128",
ISSN = "10846654",
bibdate = "OŠ”[
@Article{Nelson:1989:LDC,
author = "Mark R. Nelson",
title = "{LZW} data compression",
journal = jDDJ,
volume = "14",
number = "10",
pages = "29, 32, 34, 36, 8687",
month = oct,
year = "1989",
CODEN = "DDJOEB",
ISSN = "08883076",
bibdate = "Tue Sep 10 09:26:18 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
http://www.math.utah.edu/pub/tex/bib•†P!
@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",
}•^«=
@Article{NeideckerLutz:1993:SMP,
author = "Burkhard K. NeideckerLutz and Robert Ulichney",
title = "Software Motion Pictures",
journal = jDECTECHJ,
volume = "5",
number = "2",
pages = "1927",
month = "Spring",
year = "1993",
CODEN = "DTJOEL",
ISSN = "0898901X",
bibdate = "Thu Mar 20 18:15:43 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
1: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",
}2
99ŸD2^3+C57E‚e;†[?‚g/c#†[C Karticledatacompression.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 applicable 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",
}
.Œ4V3+[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/1177693077Annals 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/",
}‹O3Y 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 information 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",
}
è J¡uì†_?
@Article{Rubin:1979:ASC,
author = "F. Rubin",
title = "Arithmetic Stream Coding Using Fixed Precision
„ˆ)
@Article{Ross:1994:ROD,
author = "John W. Ross",
title = "RecordOriented Data Compression",
journal = jCUJ,
volume = "12",
number = "4",
pages = "83??",
month = apr,
year = "1994",
ISSN = "08†Œ'
@Article{Roetling:1976:HME,
author = "P. G. Roetling",
title = "Halftone Method with Edge Enhancement and Moir{\'e}
Suppression",
journal = jJOPTSOCAM,
volume = "66",
pages = "985989",
year = "1976",
CODEN = "JOSAAH",
ISSN = "00303941",
ISSNL = "",
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 the Optical Society of America",
rawdata = "Roetling, P. G. (1976) ``Halftone Method with Edge
Enhancement and Moir\'e Suppression,'' {\it Journal of
the Optical Society of America}, {\bf66}:985989.",
}d‡'ŽO
@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.",
}Ù‡Ž9
@Article{Roger:1996:LCA,
author = "R. E. Roger and M. C. Cavenor",
title = "Lossless Compression of {AVIRIS} Images",
journal = jIEEETRANSIMAGEPROCESS,
volume = "5",
number = "5",
pages = "713719",
month = may,
year = "1996",
CODEN = "IIPRE4",
ISSN = "10577149 (print), 19410042 (electronic)",
ISSNL = "10577149",
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 Image Processing",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=83",
rawdata = "Roger, R. E., and M. C. Cavenor (1996) ``Lossless
Compression of AVIRIS Images,'' {\it IEEE Transactions
on Image Processing}, {\bf5}(5):713719, May.",
}P†Œ/
@Article{Roetling:1977:BAC,
author = "P. G. Roetling",
title = "Binary Approximation of Continuous Tone Images",
journal = jPHOTOGRSCIENG,
volume = "21",
pages = "6065",
year = "1977",
CODEN = "PSENAC",
ISSN = "00318760",
ISSNL = "00318760",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Photographic Science and Engineering",
rawdata = "Roetling, P. G. (1977) ``Binary Approximation of
Continuous Tone Images,'' {\it Photography Science and
Engineering}, {\bf21}:6065.",
xxjournal = "Photography Science and Engineering",
}n
t û+t‰47V 3)'u%9/C7;e)'uŠkphdthesisdatacompression.bibDosik:1972:OBCPaul H. DosikAn Optimal Buffer Controlled Data Compression 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",
}…M6U 3E};Q†Emiscdatacompression.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.",
}Œ5X 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 TheoryackdsB. 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.",
}ssion.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.",
}8
¦
@ bQs¦•„„Q‰#
@Article{Spinellis:1993:IMAd,
author = "Diomidis Spinellis",
title = "ImplemˆZ‘5
@Article{Sodsong:2016:DPB,
author = "Wasuwee Sodsong and Jingun Hong and Seongwook Chung
and Yeongkyu Lim and ShinDug Kim and Bernd
Burgstaller",
title = "Dynamic partitioningbased {JPEG} decompression on
heterogeneous multicore architectures",
journal = jCCPE,
volume = "28",
number = "2",
pages = "517536",
month = feb,
year = "2016",
CODEN = "CCPEBrˆ
@Article{Sofia:2015:IHP,
author = "A. T. Sofia and C. C. Lewis and C. Jacobi and D. A.
Jamsek and D. F. Riedy and J. Vogt and P. Sutton and R.
W. {St. John}",
title = "Integrated highperformance data compression in the
{IBM z13}",
journal = jIBMJRD,
volume = "59",
number = "45",
pages = "7:17:10",
month = jul # "\slash " # sep,
year = "2015",
CODEN = Vˆ
@Article{Sofokleous:2005:RBM,
author = "Anastasis Sofokleous",
title = "Review: {{\booktitle{H.264 and MPEG4 Video
Compression: Video Coding for Nextgeneration
Multimedia}}}",
journal = jCOMPJ,
volume = "48",
number = "5",
pages = "563",
month = sep,
year = "2005",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/bxh117",
ISSN = "001046ÐŠ[•7
@Article{Smith:1993:AMC,
author = "Brian C. Smith and Lawrence A. Rowe",
title = "Algorithms for manipulating compressed images",
journal = jIEEECGA,
volume = "13",
number = "5",
pages = "3442",
month = sep,
year = "1993",
CODEN = "ICGADZ",
ISSN = "02721716 (print), 15581756 (electronic)",
ISSNL = "02721716",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Grap¾’^¥=
@Article{Skibinski:2005:RDB,
author = "Przemys{\l}aw Skibi{\'n}ski and Szymon Grabowski and
Sebastian Deorowicz",
title = "Revisiting dictionarybased compression",
journal = jSPE,
volume = "35",
number = "15",
pages = "14551476",
month = dec,
year = "2005",
CODEN = "SPEXBL",
DOI = "http://dx.doi.org/10.1002/spe.678",
ISSN = "00380644 (print), 1097024X (electronÍ‹t—i
@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/aë…>Š}
@Article{Skarbek:1999:MOR,
author = "W. Skarbek and A. Pietrowcew and R. Sikora",
title = "Modified {OjaRLS} algorithm  stochastic
convergence analysis and application for image
compression",
journal = jLECTNOTESCOMPSCI,
volume = "1609",
pages = "402??",
year = "1999",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Mon Sep 13 16:57:02 MDT 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}9
`Á`Š^9V 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.math.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.",
}Ž<8W 3+)1!57E};[3])1“Earticledatacompression.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 = aug,
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.",
}
ð
ýðŠ
;X 3/;%=+C7;e!;‹7phdthesisdatacompression.bibKohlhaas:1972:CFCCharles Albert KohlhaasCalculation of Formation Compression From Core and WellTested DataPh.D. thesisColorado School of MinesGolden, CO, 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",
}Š:V 3)#A!57E};3]#AŒarticledatacompression.bibHeath:1972:OBCF. G. HeathOrigins of the Binary CodejSCIAMER22727676aug81972SCAMAC00368733 (print), 19467087 (electronic) OR 00368733 (print), 19467087 (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.",
}
À
ÀŠ>=X 3)1)%/;C7;e91)‹mphdthesisdatacompression.bibReady:1972:MDCPatrick John ReadyMultispectral Data Compression Through Transform Coding and Block QuantizationPh.D. thesisPurdue UniversityWest Lafayette, IN, USA1641972Fri 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/302618152Electrical engineeringacknhfbPatrick John ReadyMultispectral Data Compression Through Transform Coding and Block Quantization
@PhdThesis{Ready:1972:MDC,
author = "Patrick John Ready",
title = "Multispectral Data Compression Through Transform
Coding and Block Quantization",
type = "{Ph.D.} thesis",
school = "Purdue University",
address = "West Lafayette, IN, USA",
pages = "164",
year = "1972",
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/302618152",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7230964",
subject = "Electrical engineering",
}‹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/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information TheoryackdsJ. Pieter M. SchalkwijkAn Algorithm for Source Coding
@Article{Schalkwijk:1972:ASC,
author = "J. Pieter M. Schalkwijk",
title = "An Algorithm for Source Coding",
journal = jIEEETRANSINFTHEORY,
volume = "18",
number = "3",
pages = "395399",
month = may,
year = "1972",
CODEN = "IETTAW",
DOI = "http://dx.doi.org/10.1109/TIT.1972.1054832",
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 = "Schalkwijk, J. Pieter M. ``An Algorithm for Source
Coding,'' {\it IEEE Transactions on Information
Theory}, {\bf18}(3):395399, May.",
}7: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",
}@
33ŸJ@Y 3)m_57C…;_‰A5‚M+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/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",
}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.",
}A
Ëö ¼ƒË„:ˆu
@InProceedings{Wu:1995:NAO,
author = "Xiaolin Wu and Yonggang Fang",
title = "New algorithms for optimal binary vector quantizer
design",
crossref = "Storer:1995:DDC",
pages = "132141",
year = "1995",
DOI = "http://dx.doi.org/10.1109/DCC.1995.515503",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515503",
acknowledgement = acknhfb,
}Í†zu
@InProceedings{Wu:1995:CSQ,
author = "Xiaolin Wu",
title = "Context Selection and Quantization for Lossless Image
Coding",
crossref = "Storer:1995:DDC",
pages = "453453",
year = "1995",
DOI = "http://dx.doi.org/10.1109/DCC.1995.515563",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515563",
acknowledgement = ackds # " and " # acknhfb,
rawdata = "Wu, Xiaolin (1995), ``Context Selection and
Quantization for Lossless Image Coding,'' in James A.
Storer and Martin Cohn (eds.), {\it DCC '95, Data
Compression Conference}, Los Alamitos, CA, IEEE
Computer Society Press, p. 453.",
}Ì„7ˆo
@InProceedings{Wu:1994:SDM,
author = "Xiaolin Wu and Kaizhong Zhang",
title = "A subjective distortion measure for vector
quantization",
crossref = "Storer:1994:DDC",
pages = "2231",
year = "1994",
DOI = "http://dx.doi.org/10.1109/DCC.1994.305909",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305909",
acknowledgement = acknhfb,
}"„8ˆq
@InProceedings{Wu:1994:FBS,
author = "X. Wu and Y. G. Fang",
title = "Fast bintreestructured image coder for high
subjective quality",
crossref = "Storer:1994:DDC",
pages = "284293",
year = "1994",
DOI = "http://dx.doi.org/10.1109/DCC.1994.305936",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305936",
acknowledgement = acknhfb,
}!„ˆ!
@InProceedings{Wu:1993:SBP,
author = "X. Wu and Y. Fang",
title = "Segmentationbased progressive image coding",
crossref = "Storer:1993:DDC",
pages = "262271",
year = "1993",
DOI = "http://dx.doi.org/10.1109/DCC.1993.253123",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253123",
acknowledgement = acknhfb,
}²ƒv‡m
@InProceedings{Wu:1993:GOB,
author = "X. Wu",
title = "Globally optimal bit allocation",
crossref = "Storer:1993:DDC",
pages = "2231",
year = "1993",
DOI = "http://dx.doi.org/10.1109/DCC.1993.253148",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253148",
acknowledgement = acknhfb,
}±GnÈ
an
TÙ×†];
@Article{Bodlaender:1995:CAT,
author = "Hans L. Bodlaender and Teofilo F. Gonzalez and Ton
Kloks",
title = "Complexity Aspects of TwoDimensional Data
Compression",
journal = jNORDICJCOMPUT,
volume = "2",
number = "4",
pages = "462495",
month = "Winter",
year = "1995",
CODEN = "NJCOFR",
ISSN = "12366064",
MRclass = "68Q25 (68R10 94A29)",
MRnumber = "96k:68088",
bibdate = "Fri Nov 13 16:14:15 MST 1998",
bibsource = "http://www.cs.helsinki.fi/njc/njc2.html;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cs.helsinki.fi/njc/References/bodlaendergk1995:462.html",
acknowledgement = acknhfb,
fjournal = "Nordic Journal of Computing",
}6 E‡5Žk
@Article{Brandenburg:1994:IMA,
author = "Karlheinz Brandenburg and Gerhard Stoll",
title = "{ISOMPEG1} Audio: a Generic Standard for Coding of
HighQuality Digital Audio",
journal = jJAUDIOENGSOC,
volume = "42",
number = "10",
pages = "780792",
month = oct,
year = "1994",
CODEN = "ADIOA3",
ISSN = "15494950",
ISSNL = "",
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 the Audio Engineering SM‘f£M
@Article{Bergadano:1998:HDC,
author = "Francesco Bergadano and Bruno Crispo and Giancarlo
Ruffo",
title = "High dictionary compression for proactive password
checking",
journal = jTISSEC,
volume = "1",
number = "1",
pages = "325",
month = nov,
year = "1998",
CODEN = "ATISBQ",
ISSN = "10949224 (print), 15577406 (electronic)",
ISSNL = "10949224",
Æ×ˆ[
@Article{Bell:1993:RDC,
author = "Timothy C. Bell and Alistair Moffat and Craig G.
NevillManning and Ian H. Witten and Justin Zobel",
title = "Research: Data compression in fulltext retrieval
systems",
journal = jJAMSOCINFSCI,
volume = "44",
number = "9",
pages = "508531",
month = oct,
year = "1993",
CODEN = "AISJB6",
DOI = "http://dx.doi.org/10.1002/th‹e—K
@Article{Bille:2009:IAS,
author = "Philip Bille and Rolf Fagerberg and Inge Li G{\o}rtz",
title = "Improved approximate string matching and regular
expression matching on {ZivLempel} compressed texts",
journal = jTALG,
volume = "6",
number = "1",
pages = "3:13:??",
month = dec,
year = "2009",
CODEN = "????",
DOI = "http://dx.doi.org/10.1145/1644015.1644018",
ISSN = DÆ‡3Žg
@Article{Benini:2002:ODP,
author = "Luca Benini and Alberto Macii and Enrico Macii",
title = "Offline Data Profiling Techniques to Enhance Memory
Compression in Embedded Systems",
journal = jLECTNOTESCOMPSCI,
volume = "2451",
pages = "314??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "0302(Œ9˜s
@Article{Belazzougui:2014:AIC,
author = "Djamal Belazzougui and Gonzalo Navarro",
title = "AlphabetIndependent Compressed Text Indexing",
journal = jTALG,
volume = "10",
number = "4",
pages = "23:123:??",
month = aug,
year = "2014",
DOI = "http://dx.doi.org/10.1145/2635816",
ISSN = "15496325 (print), 15496333 (electronic)",
ISSNL = "15496325",
bibdate = "Mon Sep 1 11:11
K1K‰cBW '3+[%E};[‹?inproceedingsdatacompression.bibFaller:1973:ASDN. FallerRecord of the 7th Asilomar Conference on Circuits, Systems, and ComputersAn Adaptive System 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.",
}LAX 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 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]",
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.",
}c)",
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/",
}C
„Î„ŒGDV 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 {Leonardo 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.",
}/CZ 3K_57=ƒE;=!5OKA‘Warticledatacompression.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/",
}w.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.",
}D
¸
»`¸‰%GV 3'1k%7C7;e#1kŠYphdthesisdatacompression.bibPore:1973:FADMichael David PoreFactor Analysis as a Data 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",
}ŠXFX 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.utah.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.",
}ŠBEX 3/7%3/C7;e37‹iphdthesisdatacompression.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://search.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",
}
ˆ
„ˆ‘yIY3)[=3_57E‚3;WI[[A–articledatacompression.bibAhmed:1974:DCTN. Ahmed and T. Natarajan and K. R. RaoDiscrete Cosine TransfomjIEEETRANSCOMPUTC2319093jan11974ITCOB4http://dx.doi.org/10.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.",
}ŠyHX 3'5S%3/C7;e95SŒphdthesisdatacompression.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.edu/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",
} "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.",
}I9 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",
}Jth.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",
}
oéùoªM[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; 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.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 equipY¡~L\ 3'!s57E„;†U?ƒuEc!A†U!s¤articledatacompression.bibHahn:1974:NTCBruce HahnA New Technique for Compression and Storage of DatajCACM178434436aug81974CACMA200010782 (print), 15577317 (electronic) OR 00010782 (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.WŠ$KX 3'5%CC7;e5‹Qphdthesisdatacompression.bibFelt:1974:DCTDouglas Charles FeltDataCompression Techniques Using Adaptive TranslationPermutation CodesPh.D. thesisWashington State UniversityPullman, WA, USA1131974Fri 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/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",
}£5J_3'C57E‚;‡W[„]y'C‡WC£articledatacompression.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/bib/datacompression.bib; http://www.maT 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",
}Lhtml#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",
}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",
}Mment; 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",
}4: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",
}N
dd›N_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 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 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 (black 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",
}
Ñ gÑPX 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 Sets 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.",
}OX 3's%)EEƒW;Q1'siÕbookdatacompression.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.11.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",
}
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.",
}P
B
¬¤1BÅ–Q%
@Article{Jordan:1974:COR,
author = "B. ‡dI
@Article{Hoces:1996:MRB,
author = "Carlos Hoc„o‰_
@Article{Hlavac:1997:ANL,
author = "V. Hlavac and J. Fojtik",
title = "Adaptive Nonlinear Predictor for Lossless Image
Compression",
journal = jLECTNOTESCOMPSCI,
volume = "1296",
pages = "279??",
year = "1997",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",ˆx‘q
@Article{Herzog:2008:PRA,
author = "Robert Herzog and Shinichi Kinuwaki and Karol
Myszkowski and HansPeter Seidel",
title = "Perception for Rendering and Animation: {Render2MPEG}:
a Perceptionbased Framework Towards Integrating
Rendering and Video Compression",
journal = jCGF,
volume = "27",
number = "2",
pages = "183192",
month = apr,
year = "2008",
CODENý†qe
@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.",
}
†Œ
@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.",
}:†cG
@Article{Hayden:2002:TQC,
author = "Patrick Hayden and Richard Jozsa and Andreas Winter",
title = "Trading quantum for classical resources in quantum
data compression",
journal = jJMATHPHYS,
volume = "43",
number = "9",
pages = "44044444",
month = sep,
year = "2002",
CODEN = "JMAPAQ",
ISSN = "00222488 (print), 10897658 (electronic), 15272427",
ISSNL = "00222488",
bibdate = "Tue Dec 16 11:35:55 MST 2003",
bibsource = "http://www.aip.org/ojs/jmp.html;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jmathphys2000.bib",
acknowledgement = acknhfb,
fjournal = "Journal of Mathematical Physics",
journalURL = "http://jmp.aip.org/",
}hˆ{‘w
@Article{Hawley:1990:POAb,
author = "Michael Hawley",
title = "The Personal Orchestra, or Audio Data Compression by
10,000:1",
journal = jCOMPSYS,
volume = "3",
number = "2",
pages = "289329",
month = "Spring",
year = "1990",
CODEN = "CMSYE2",
ISSN = "08956340",
bibdate = "Fri Sep 13 08:53:14 MDT 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacomp²
] –]Œ6RY'3/9;K'E};9;KŽinproceedingsdatacompression.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 1922, 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.",
}ŒgQX3/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 for 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.",
}
00
$N9…}‹}
@PhdThesis{Schneider:1970:RDC,
author = "Kenneth Stuart Schneider",
title = "Reliable Data Compression of Constant Rate {Markov}
Sourc†Œ
@PhdThesis{Lehman:2002:AAG,
author = "Eric Allen Lehman",
title = "Approximation algorithms for grammarbased data
compression",
type = "{Ph.D.} thesis",
school = "Massachusetts Institute of Technology",
address = "Cambridge, MA, USA",
pages = "????",
year = "2002",
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/305445788",
acknowledgement = acknhfb,
advisor = "Madhu Sudan",
classification = "0984: Computer science",
dissertationthesisnumber = "0804007",
subject = "Computer science",
}}†Œ'
@PhdThesis{Liu:1991:IUD,
author = "ChuangChun Liu",
title = "Identification and universal data compression of
hidden {Markov} processes",
type = "{Ph.D.} thesis",
school = "University of Maryland",
address = "College Park, MD, USA",
pages = "76",
year = "1991",
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/303967206",
acknowledgement = acknhfb,
advisor = "Prakash Narayan",
classification = "0544: Electrical engineering",
dissertationthesisnumber = "9133119",
subject = "Electrical engineering",
}¼…T‹+
@PhdThesis{Linde:1978:DTT,
author = "Yoseph Linde",
title = "The Design of Tree and Trellis Data Compression
Systems",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "142",
year = "1978",
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/302929849",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7808809",
subject = "Electrical engineering",
}w–¬
@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://è…k‹W
@PhdThesis{Lelewer:1991:DCM,
author = "Debra Ann Lelewer",
title = "Data compression on machines with limited memory",
type = "{Ph.D.} thesis",
school = "University of California, Irvine",
address = "Irvine, CA, USA",
pages = "99",
year = "1991",
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/303921041",
acknowledgement = acknhfb,
advisor = "Daniel S. Hirschberg",
classification = "0984: Computer science",
dissertationthesisnumber = "9120543",
subject = "Computer science",
}³
T\3'?Y57E‚;‡[„k=A'G‡?Y iarticledatacompression.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.bib1c‰tSV 35g%O5C7;e95q‹7phdthesisdatacompression.bibHilbert:1975:JCSEdward Erwin HilbertA Joint Clustering / Data Compression ConceptPh.D. thesisUniversity of Southern CaliforniaLos Angeles, 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",
} 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",
}T997.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 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",
}620",
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",
}U
22KU[3)=w_57C„S;…k5„+O#=w¡Garticledatacompression.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 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",
} "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",
}V
¸¸ŽEVY 31+_3_57E‚3;=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 Transform''}
@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",
}: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",
}W
ÈÈž5W[ 3+%g_57C„S;‡5ƒqOA%g¢Uarticledatacompression.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_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 = "18",
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",
}
ï
¸ï‘FYY3Os57Ek;I?wGOs•5articledatacompression.bibBentley:1976:AOAJ. L. Bentley and A. ChiChih YaoAn Almost Optimal Algorithm for Unbounded 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",
}ŠEXX 339%O5C7;e99Œphdthesisdatacompression.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://search.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",
}6 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",
}Y
óâæó
…v†Œ9
@Article{Lempel:1976:CFS,
author = "A. Lempel and J. Ziv",
title = "On the Complexity of Finite Sequences",
journal = jIEEETRANSINFTHEORY,
volume = "22",
number = "1",
pages = "7581",
year = "1976",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utaˆ
@Article{Larmore:1995:CHT,
author = "Lawrence L. Larmore and Teresa M. Przytycka",
title = "Constructing {Huffman} Trees in Parallel",
journal = jSIAMJCOMPUT,
volume = "24",
number = "6",
pages = "11631169",
month = dec,
year = "1995",
CODEN = "SMJCAT",
DOI = "http://dx.doi.org/10.1137/S0097539792233245",
ISSN = "00975397 (print), 10957111 (electronic)",
ISSNL = "0097‚†Œ
@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.",
}²‡Ž;
@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.",
}³Šf•M
@Article{Larsson:2000:LDB,
author = "Larsson and Moffat",
title = "OffLine DictionaryBased Compression",
journal = jPROCIEEE,
volume = "88",
number = "11",
pages = "17221732",
year = "2000",
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/datacï‡Ž
@Article{Latendresse:2005:GFI,
author = "Mario Latendresse and Marc Feeley",
title = "Generation of fast interpreters for {Huffman}
compressed bytecode",
journal = jSCICOMPUTPROGRAM,
volume = "57",
number = "3",
pages = "295317",
month = sep,
year = "2005",
CODEN = "SCPGD4",
ISSN = "01676423 (print), 18727964 (electronic)",
ISSNL = "01676423",
bibdate = "Fri Apr 1 18:38:50 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib;
http://www.sciencedirect.com/science/journal/01676423",
acknowledgement = acknhfb,
fjournal = "Science of Computer Programming",
journalURL = "http://www.sciencedirect.com/science/journal/01676423",
}
õ ªºõ‹B\W3QC5CQ3Eq;sQŒo¦bookdatacompression.bibDavisson:1976:DCLee D. Davisson and Robert M. GrayData compression14Dowden, Hutchinson and RossStroudsburg, PA, USAxv + 40719760879330899 OR 08793308999780879330897 OR 9780879330897TK5102.5 .D335 1976Mon Jan 28 15:19:07 MST 2013clas.caltech.edu:210/INNOPAC; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; z3950.loc.gov:7090/Voyager2013.01.28 15:19:07 MSTBenchmark papers in electrical engineering and computer scienceData compression (Telecommunication); Coding theoryacknhfbLee D. Davisson and Robert M. GrayData compression
@Book{Davisson:1976:DC,
editor = "Lee D. Davisson and Robert M. Gray",
title = "Data compression",
volume = "14",
publisher = "Dowden, Hutchinson and Ross",
address = "Stroudsburg, PA, USA",
pages = "xv + 407",
year = "1976",
ISBN = "0879330899",
ISBN13 = "9780879330897",
LCCN = "TK5102.5 .D335 1976",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "clas.caltech.edu:210/INNOPAC;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "Benchmark papers in electrical engineering and
computer science",
acknowledgement = acknhfb,
subject = "Data compression (Telecommunication); Coding theory",
}¢4[Z3)Cc_57C„S;‹c5ƒ[O#Cc¦k 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 00104620 (print), 14602067 (electronic)00104620 OR 00104620Tue Dec 4 14:47:58 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/19/3.toc; http://wwwoŒSZY 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 BudihardjoReport 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",
}Tue Dec 4 14:47:58 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/19/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_19/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/19/3/216.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/216.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/217.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/218.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/219.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/220.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/221.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/222.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/223.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/224.tif",
acknowledgement = acknhfb,
classcodes = "C6130 (Data handling techniques); C6150E (General
utility programs)",
classification = "723",
corpsource = "Univ. of Arkansas, Little Rock, AR, USA",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "adaptive; buffering; data compression; data
processing; data set; dynamic priority assignment;
FORTRAN; input/output control; interface; item
relocation; online information; programs; system;
utility programs",
treatment = "P Practical",
}[.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_19/Issue_03/2012.12.04 14:47:58 MSThttp://comjnl.oxfordjournals.org/content/19/3/216.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/216.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/217.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/218.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/219.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/220.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/221.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/222.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/223.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/224.tifThe Computer Journaladaptive; buffering; data compression; data processing; data set; dynamic priority assignment; FORTRAN; input/output control; interface; item relocation; online information; programs; system; utility programsacknhfbC6130 (Data handling techniques); C6150E (General utility programs)Univ. of Arkansas, Little Rock, AR, USAhttp://comjnl.oxfordjournals.org/P PracticalD. L. Dance and U. W. PoochAn adaptive on line data compression system
@Article{Dance:1976:ALD,
author = "D. L. Dance and U. W. Pooch",
title = "An adaptive on line data compression system",
journal = jCOMPJ,
volume = "19",
number = "3",
pages = "216224",
month = aug,
year = "1976",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/19.3.216",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:47:58 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/19/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_19/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/19/3/216.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/216.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/217.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/218.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/219.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/220.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/221.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/222.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/223.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/224.tif",
acknowledgement = acknhfb,
classcodes = "C6130 (Data handling techniques); C6150E (General
utility programs)",
classification = "723",
corpsource = "Univ. of Arkansas, Little Rock, AR, USA",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "adaptive; buffering; data compression; data
processing; data set; dynamic priority assignment;
FORTRAN; input/output control; interface; item
relocation; online information; programs; system;
utility programs",
treatment = "P Practical",
}
=,= Ïà"‡qc
@Article{Soulodre:1998:SES,
author = "G. A. Soulodre and T. Grusec and M. Lavoie and L.
Thibault",
key = "CRC",
title = "Subjective Evaluation of StateoftheArt 2Channel
Audio Codecs",
journal = jJAUDIOENGSOC,
volume = "46",
number = "3",
pages = "164176",
month = mar,
year = "1998",
CODEN = "ADIOA3",
ISSN = "15494950",
ISSNL = "",+‘$¢I
@Article{Song:2015:VRF,
author = "Ying Song and Jiaping Wang and LiYi Wei and Wencheng
Wang",
title = "Vector Regression Functions for Texture Compression",
journal = jTOG,
volume = "35",
number = "1",
pages = "5:15:??",
month = dec,
year = "2015",
CODEN = "ATGRDF",
DOI = "http://dx.doi.org/10.1145/2818996",
ISSN = "07300301 (print), 15577368 (electronic)",
IW‡C
@Article{Staller:2002:IJS,
author = "Alexander Staller and Peter Dillinger and Reinhard
M{\"a}nner",
title = "Implementation of the {JPEG} 2000 Standard on a Virtex
1000 {FPGA}",
journal = jLECTNOTESCOMPSCI,
volume = "2438",
pages = "503??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Tue Sep 10 19:10:28 MDT 2002",
bibsource = "http://link.springerny.com/link/service/series/0558/tocs/t2438.htm;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springerny.com/link/service/series/0558/bibs/2438/24380503.htm;
http://link.springerny.com/link/service/series/0558/papers/2438/24380503.pdf",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}¥•`«A
@Article{Sriram:1991:VPC,
author = "Kotikalapudi Sriram and R. Scott McKinney and Mostafa
Hashem Sherif",
title = "Voice Packetization and Compression in Broadband {ATM}
Networks",
journal = jIEEEJSELAREASCOMMUN,
volume = "9",
number = "3",
pages = "294304",
month = apr,
year = "1991",
CODEN = "ISACEM",
ISSN = "07338716 (print), 15580008 (electronic)",„Q‰#
@Article{Spinellis:1993:IMAd,
author = "Diomidis Spinellis",
title = "Implementing Multimedia Applications: File Storage and
Compression Methods",
journal = jWINMAGAZINE,
pages = "8083",
month = jul,
year = "1993",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/s/spinellisdiomidis.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "In Greek.",
URL = "http://kerkis.math.aegean.gr/~dspin/pubs/trade/1993Winmag/fastwin4/html/win4.html",
}¢8žq
@Article{Starosolski:2007:SFA,
author = "Roman Starosolski",
title = "Simple fast and adaptive lossless image compression
algorithm",
journal = jSPE,
volume = "37",
number = "1",
pages = "6591",
month = jan,
year = "2007",
CODEN = "SPEXBL",
DOI = "http://dx.doi.org/10.1002/spe.746",
ISSN = "00380644 (print), 1097024X (electronic)",
ISSNL = "00380644",
·ˆ!
@Article{Srisooksai:2012:PDC,
author = "Tossaporn Srisooksai and Kamol Keamarungsi and Poonlap
Lamsrichan and Kiyomichi Araki",
title = "Practical data compression in wireless sensor
networks: a survey",
journal = jJNETWCOMPUTAPPL,
volume = "35",
number = "1",
pages = "3759",
month = jan,
year = "2012",
CODEN = "JNCAF3",
ISSN = "10848045 (print), 109585
µ
é éŠ4^V3+5W;57E};[5WŒ9articledatacompression.bibLempel:1976:CFSA. Lempel and J. ZivOn the Complexity of Finite SequencesjIEEETRANSINFTHEORY22175811976IETTAW00189448 (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 TheoryackdsA. Lempel and J. ZivOn the Complexity of Finite Sequences
@Article{Lempel:1976:CFS,
author = "A. Lempel and J. Ziv",
title = "On the Complexity of Finite Sequences",
journal = jIEEETRANSINFTHEORY,
volume = "22",
number = "1",
pages = "7581",
year = "1976",
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 = "Lempel A. and J. Ziv (1976) ``On the Complexity of
Finite Sequences,'' {\it IEEE Transactions on
Information Theory}, {\bf22}(1):7581.",
}‰]]U!3'UgQ5E};UgŒtechreportdatacompression.bibHunt:1976:ADFJames W. Hunt and M. Douglas McIlroyAn Algorithm for Differential File ComparisonComputing Science Technical Report41Bell LabsMurray Hill, NJ, USAjun61976Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsJames W. Hunt and M. Douglas McIlroyAn Algorithm for Differential File Comparison
@TechReport{Hunt:1976:ADF,
author = "James W. Hunt and M. Douglas McIlroy",
title = "An Algorithm for Differential File Comparison",
type = "Computing Science Technical Report",
number = "41",
institution = "Bell Labs",
address = "Murray Hill, NJ, USA",
pages = "??",
month = jun,
year = "1976",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Hunt, James W. and M. Douglas McIlroy (1976) ``An
Algorithm for Differential File Comparison,'' Computing
Science Technical Report No. 41, Murray Hill, NJ, Bell
Labs, June.",
}
ß¬"
3½Îßˆ
@Article{Mavridis:2012:PTM,
author = "Pavlos Mavridis and Georgios Papaioannou",
title = "Parameterization and Texture Mapping: Texture
Compression using Wavelet Decomposition",
journal = jCGF,
volume = "31",
number = "7pt1",
pages = "21072116",
month = sep,
year = "2012",
CODEN = "CGFODY",
DOI = "http://dx.doi.org/10.1111/j.14678659.2012.03203.x",
ISSN = "01677
”–5¬k
@Article{Matthews:2015:HCL,
author = "Suzanne J. Matthews",
title = "Heterogeneous compression of large collections of
evolutionary trees",
journal = jTCBB,
volume = "12",
number = "4",
pages = "807814",
month = jul,
year = "2015",
CODEN = "ITCBCY",
DOI = "http://dx.doi.org/10.1109/TCBB.2014.2366756",
ISSN = "15455963 (print), 15579964 (electronic)",
ISSNL = I—x¯q
@Article{Matias:2001:EFP,
author = "Yossi Matias and Nasir Rajpoot and Cenk Sahinalp",
title = "The Effect of Flexible Parsing for Dynamic
DictionaryBased Data Compression",
journal = jACMJEXPALGORITHMICS,
volume = "6",
pages = "10:110:??",
month = "????",
year = "2001",
CODEN = "????",
DOI = "http://doi.acm.org/10.1145/945394.945404",
ISSN = "10846654",
ISSNL = P‡Ž
@Article{Massberg:2015:GHC,
author = "Jens Ma{\ss}berg",
title = "Generalized {Huffman} coding for binary trees with
choosable edge lengths",
journal = jINFOPROCLETT,
volume = "115",
number = "4",
pages = "502506",
month = apr,
year = "2015",
CODEN = "IFPLAT",
ISSN = "00200190 (print), 18726119 (electronic)",
ISSNL = "00200190",
bibdate = "Tue Jan 20 08:43:02 MST 2015",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014002634",
acknowledgement = acknhfb,
fjournal = "Information Processing Letters",
journalURL = "http://www.sciencedirect.com/science/journal/00200190/",
}
3
ž
@Article{Mathews:1996:EDC,
author = "G. Jason Mathews",
title = "Evaluating DataCompression Algorithms",
journal = jDDJ,
volume = "21",
number = "1",
pages = "5053",
month = jan,
year = "1996",
CODEN = "DDJOEB",
ISSN = "1044789X",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
ˆ%
@Article{Matela:2012:LGO,
author = "Ji{\v{r}}{\'\i} Matela and Martin {\v{S}}rom and Petr
Holub",
title = "Low {GPU} Occupancy Approach to Fast Arithmetic Coding
in {JPEG2000}",
journal = jLECTNOTESCOMPSCI,
volume = "7119",
pages = "136145",
year = "2012",
CODEN = "LNCSD9",
DOI = "http://dx.doi.org/10.1007/9783642259296_13",
ISSN = "03029743 (print), 1611
‘ˆ>}
@Article{Matei:2012:WET,
author = "Basarab Mate{\"\i} and Sylvain Meignen and Anastasia
Zakharova",
title = "On a {(W)ENO}Type Multiscale Representation Based on
Quincunx Refinement: Application to Image Compression",
journal = jLECTNOTESCOMPSCI,
volume = "6920",
pages = "473487",
year = "2012",
CODEN = "LNCSD9",
DOI = "http://dx.doi.org/10.1007/9783642274138_30",
ce = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "A new algorithm is presented for constructing
auxiliary digital search trees to aid in exactmatch
substring searching. This algorithm has the same
asymptotic running time bound as previously published
algorithms, but is more economical in space. Some
implementation considerations are discussed, and new
work on the modification of these search trees in
response to incremental changes in the strings they
index (the update problem) is presented.",
acknowledgement = ackds # " and " # acknhfb,
classification = "723; 901",
comment = "Algorithms to build, use, and modify suffix tree are
presented. The advantage of this algorithm over other
linear time algorithms to perform similar tasks is that
this algorithm uses less space. This seems to the
primary reference for suffix trees.",
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "computer programming; information science 
Information Retrieval",
rawdata = "McCreight, E. M (1976) ``A Space Economical Suffix
Tree Construction Algorithm,'' {\it Journal of the
ACM}, {\bf32}(2):262272, April.",
}_hu
h
0±G…Š;
@Article{Chow:1997:PIF,
author = "S. K. Chow and M. Gillies and S. L. Chan",
title = "Parallel Implementation of Fractal Image Compression
Using Multiple Digital Signal Processors",
journal = jLECTNOTESCOMPSCI,
volume = "1351",
pages = "I??",
year = "1997",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Tue Apr 28 08:51:33 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}‘}‡ ŽA
@Article{Constantinescu:1994:OAV,
author = "C. Constantinescu and J. A. Storer",
title = "Online Adaptive Vector Quantization with Variable Size
Codebook Entries",
journal = jINFOPROCMAN,
volume = "30",
number = "6",
pages = "745758",
year = "1994",
CODEN = "IPMADK",
ISSN = "03064573 (print), 18735371 (electronic)",
ISSNL = "03064573",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Information Processing and Management",
rawdata = "Constantinescu, C., and J. A. Storer (1994a) ``Online
Adaptive Vector Quantization with Variable Size
Codebook Entries,'' {\it Information Processing and
Management}, {\bf30}(6)745758.",
}Êå†ys
@Article{CohenOr:1999:DCS,
author = "Daniel CohenOr and Yair Mann and Shachar Fleishman",
title = "Deep compression for streaming texture intensive
animations",
journal = jCOMPGRAPHICS,
volume = "33",
number = "{Annual Conference Series}",
pages = "261268",
year = "1999",
CODEN = "CGRADI, CPGPBZ",
ISSN = "00978930 (print), 15584569 (electronic)",
ISSNL = "00978930",
bibdate = "Mon Oct 4 10:28:38 MDT 1999",
bibsource = "http://www.acm.org/pubs/toc/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/graph/311535/p261cohenor/",
acknowledgement = acknhfb,
fjournal = "Computer Graphics",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J166",
}Ø[‡W/
@Article{Cinque:2005:SLC,
author = "Luigi Cinque and Sergio {De Agostino} and Franco
Liberati and Bart Westgeest",
title = "A Simple Lossless Compression Heuristic for Grey Scale
Images",
journal = jINTJFOUNDCOMPSCI,
volume = "16",
number = "6",
pages = "1111??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "01290541 (print), 17936373 (electronic)",
ISSNL = "01290541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = acknhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journalURL = "http://www.worldscientific.com/loi/ijfcs",
}æó‰’%
@Article{Chen:2008:LZF,
author = "Gang Chen and Simon J. Puglisi and W. F. Smyth",
title = "{LempelZiv} Factorization Using Less Time {\&}
Space",
journal = jMATHCOMPUTSCI,
volume = "1",
number = "4",
pages = "605623",
month = jun,
year = "2008",
CODEN = "????",
DOI = "http://dx.doi.org/10.1007/s1178600700244",
ISSN = "16618270 (print), 16618289 (electronä
ƒƒžz_Z 313w57Eƒ;‡qe3‡3w¢uarticledatacompression.bibMcCreight:1976:SESEdward M. McCreightA SpaceEconomical Suffix Tree Construction AlgorithmjJACM232262272apr41976JACOAH00045411 (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/protein.pattern.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 MSTA new algorithm is presented for constructing auxiliary digital search trees to aid in exactmatch substring searching. This algorithm has the same asymptotic running time bound as previously published algorithms, but is more economical in space. Some implementation considerations are discussed, and new work on the modification of these search trees in response to incremental changes in the strings they index (the update problem) is presented.Journal of the Association for Computing Machinerycomputer programming; information science  Information Retrievalackdshttp://portal.acm.org/browse_dl.cfm?idx=J401J Assoc Comput MachA new algorithm is presented for constructing auxiliary digital search trees to aid in exactmatch substring searching. This algorithm has the same asymptotic running time bound as previously published algorithms, but is more economical in space. Some implementation considerations are discussed, and new work on the modification of these search trees in response to incremental changes in the strings they index (the update problem) is presented.Edward M. McCreightA SpaceEconomical Suffix Tree Construction Algorithm
@Article{McCreight:1976:SES,
author = "Edward M. McCreight",
title = "A SpaceEconomical Suffix Tree Construction
Algorithm",
journal = jJACM,
volume = "23",
number = "2",
pages = "262272",
month = apr,
year = "1976",
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/protein.pattern.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "A new algorithm is presented for constructing
auxiliary digital search trees to aid in exactmatch
substring searching. This algorithm has the same
asymptotic running time bound as previously published
algorithms, but is more economical in space. Some
implementation considerations are discussed, and new
work on the modification of these search trees in
response to incremental changes in the strings they
index (the update problem) is presented.",
acknowledgement = ackds # " and " # acknhfb,
classification = "723; 901",
comment = "Algorithms to build, use, and modify suffix tree are
presented. The advantage of this algorithm over other
linear time algorithms to perform similar tasks is that
this algorithm uses less space. This seems to the
primary reference for suffix trees.",
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "computer programming; information science 
Information Retrieval",
rawdata = "McCreight, E. M (1976) ``A Space Economical Suffix
Tree Construction Algorithm,'' {\it Journal of the
ACM}, {\bf32}(2):262272, April.",
}imager/imager.76.bib;
http://www.math.utah.edu/pub/tex/bib/cvgip.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "722; 723",
fjournal = "Computer Graphics and Image Processing",
journalURL = "http://www.sciencedirect.com/science/journal/0146664X",
journalabr = "Comput Graphics Image Process",
keywords = "character recognition equipment; data processing 
Data Reduction and Analysis; encoding graphical data,
data compression; image processing",
}`
F‹FŠBaX 3/9%W5C7;e)9‹mphdthesisdatacompression.bibNussbaum:1976:SCAHoward Steven NussbaumSource Coding and Adaptive Data Compression for Communication NetworksPh.D. thesisUniversity of California, Los AngelesLos Angeles, CA, USA2201976Fri 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/302826487Systems designacknhfbHoward Steven NussbaumSource Coding and Adaptive Data Compression for Communication Networks
@PhdThesis{Nussbaum:1976:SCA,
author = "Howard Steven Nussbaum",
title = "Source Coding and Adaptive Data Compression for
Communication Networks",
type = "{Ph.D.} thesis",
school = "University of California, Los Angeles",
address = "Los Angeles, CA, USA",
pages = "220",
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/302826487",
acknowledgement = acknhfb,
classification = "0790: Systems design",
dissertationthesisnumber = "7707677",
subject = "Systems design",
}Žr`W 3+y77C‚C;Y‚'wG1y‘articledatacompression.bibMorrin:1976:CLCT. H. Morrin, IIChainLink Compression of Arbitrary BlackWhite ImagesjCGIP52172189jun61976CGIPBG0146664X OR 0146664X0146664X OR 0146664XFri Feb 7 08:07:49 MST 1997Compendex database; Graphics/imager/imager.76.bib; http://www.math.utah.edu/pub/tex/bib/cvgip.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.02.07 08:07:49 MSTComputer Graphics and Image Processingcharacter recognition equipment; data processing  Data Reduction and Analysis; encoding graphical data, data compression; image processingacknhfbhttp://www.sciencedirect.com/science/journal/0146664XComput Graphics Image ProcessT. H. {Morrin, II}ChainLink Compression of Arbitrary BlackWhite Images
@Article{Morrin:1976:CLC,
author = "T. H. {Morrin, II}",
title = "ChainLink Compression of Arbitrary BlackWhite
Images",
journal = jCGIP,
volume = "5",
number = "2",
pages = "172189",
month = jun,
year = "1976",
CODEN = "CGIPBG",
ISSN = "0146664X",
ISSNL = "0146664X",
bibdate = "Fri Feb 7 08:07:49 MST 1997",
bibsource = "Compendex database; Graphics/imager/imager.76.bib;
http://www.math.utah.edu/pub/tex/bib/cvgip.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "722; 723",
fjournal = "Computer Graphics and Image Processing",
journalURL = "http://www.sciencedirect.com/science/journal/0146664X",
journalabr = "Comput Graphics Image Process",
keywords = "character recognition equipment; data processing 
Data Reduction and Analysis; encoding graphical data,
data compression; image processing",
}math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302770683",
acknowledgement = ackds # " and " # acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7626055",
rawdata = "Pasco, R. (1976) ``Source Coding Algorithms for Fast
Data Compression,'' Ph.D. dissertation, Dept. of
Electrical Engineering, Stanford University, Stanford,
CA.",
subject = "Electrical engineering",
}b
É“*cY 3/)q57!E‚+;[‚mM%G)u—Earticledatacompression.bibRissanen:1976:GKIJ. J. RissanenGeneralized Kraft Inequality and Arithmetic CodingjIBMJRD203198203may51976IBMJAE00188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 0018864694A1054 \#12359Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; http://www.research.ibm.com/journal/2013.01.26 12:46:16 MSTIBM Journal of Research and Developmentarithmetic coding; associated entropy; coding speed; decoding; encoding; finite alphabet; finite strings; generalised Kraft inequalityackdsB6120B (Codes); C6130 (Data handling techniques)IBM Res. Lab., San Jose, CA, USAhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520Jack K. WolfT Theoretical or MathematicalJ. J. RissanenGeneralized {Kraft} Inequality and Arithmetic Coding
@Article{Rissanen:1976:GKI,
author = "J. J. Rissanen",
title = "Generalized {Kraft} Inequality and Arithmetic Coding",
journal = jIBMJRD,
volume = "20",
number = "3",
pages = "198203",
month = may,
year = "1976",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
MRclass = "94A10",
MRnumber = "54 \#12359",
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/ibmjrd.bib;
http://www.research.ibm.com/journal/",
acknowledgement = ackds # " and " # acknhfb,
classcodes = "B6120B (Codes); C6130 (Data handling techniques)",
corpsource = "IBM Res. Lab., San Jose, CA, USA",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
keywords = "arithmetic coding; associated entropy; coding speed;
decoding; encoding; finite alphabet; finite strings;
generalised Kraft inequality",
rawdata = "Rissanen, J. J. (1976) ``Generalized Kraft Inequality
and Arithmetic Coding,'' {\it IBM Journal of Research
and Development}, {\bf20}:198203, May.",
reviewer = "Jack K. Wolf",
treatment = "T Theoretical or Mathematical",
}Œ4bV 3)3q1/C7;e93q}phdthesisdatacompression.bibPasco:1976:SCARichard Clark PascoSource Coding Algorithms for Fast Data CompressionPh.D. DissertationDepartment of Electrical Engineering, Stanford UniversityStanford, CA, USA1131976Fri 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/302770683Electrical engineeringackdsRichard Clark PascoSource Coding Algorithms for Fast Data Compression
@PhdThesis{Pasco:1976:SCA,
author = "Richard Clark Pasco",
title = "Source Coding Algorithms for Fast Data Compression",
type = "{Ph.D.} Dissertation",
school = "Department of Electrical Engineering, Stanford
University",
address = "Stanford, CA, USA",
pages = "113",
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/302770683",
acknowledgement = ackds # " and " # acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7626055",
rawdata = "Pasco, R. (1976) ``Source Coding Algorithms for Fast
Data Compression,'' Ph.D. dissertation, Dept. of
Electrical Engineering, Stanford University, Stanford,
CA.",
subject = "Electrical engineering",
}an 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/ibmjrd.bib;
http://www.research.ibm.com/journal/",
acknowledgement = ackds # " and " # acknhfb,
classcodes = "B6120B (Codes); C6130 (Data handling techniques)",
corpsource = "IBM Res. Lab., San Jose, CA, USA",
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
keywords = "arithmetic coding; associated entropy; coding speed;
decoding; encoding; finite alphabet; finite strings;
generalised Kraft inequality",
rawdata = "Rissanen, J. J. (1976) ``Generalized Kraft Inequality
and Arithmetic Coding,'' {\it IBM Journal of Research
and Development}, {\bf20}:198203, May.",
reviewer = "Jack K. Wolf",
treatment = "T Theoretical or Mathematical",
}c
. .‹OfX '3'7uK;C7;e+7uŒcmastersthesisdatacompression.bibSnow:1976:ICTRoderick Charles SnowAn investigation of clustering techniques, query methods and data base compression with respect to the enlist systemM.Sc.C.S.The University of New BrunswickFredericton, NB, Canada1976Fri 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/302820785Library scienceacknhfbRoderick Charles SnowAn investigation of clustering techniques, query methods and data base compression with respect to the enlist system
@MastersThesis{Snow:1976:ICT,
author = "Roderick Charles Snow",
title = "An investigation of clustering techniques, query
methods and data base compression with respect to the
enlist system",
type = "{M.Sc.C.S.}",
school = "The University of New Brunswick",
address = "Fredericton, NB, Canada",
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/302820785",
acknowledgement = acknhfb,
classification = "0399: Library science",
dissertationthesisnumber = "MK30462",
subject = "Library science",
}£{eZ 3)#U57Eƒ ;‰W?ƒ{MAc!C‰[#U¤oarticledatacompression.bibRubin:1976:ETFFrank RubinExperiments in Text File CompressionjCACM1911617623nov111976CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Mon Jan 22 07:17:30 MST 2001Compendex database; http://dblp.unitrier.de/db/journals/cacm/cacm19.html#Rubin76; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/}‰wdW 3/))7E};_)Œ'articledatacompression.bibRoetling:1976:HMEP. G. RoetlingHalftone Method with Edge Enhancement and Moire SuppressionjJOPTSOCAM669859891976JOSAAH00303941 OR 00303941Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTJournal of the Optical Society of AmericaackdsP. G. RoetlingHalftone Method with Edge Enhancement and Moir{\'e} Suppression
@Article{Roetling:1976:HME,
author = "P. G. Roetling",
title = "Halftone Method with Edge Enhancement and Moir{\'e}
Suppression",
journal = jJOPTSOCAM,
volume = "66",
pages = "985989",
year = "1976",
CODEN = "JOSAAH",
ISSN = "00303941",
ISSNL = "",
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 the Optical Society of America",
rawdata = "Roetling, P. G. (1976) ``Halftone Method with Edge
Enhancement and Moir\'e Suppression,'' {\it Journal of
the Optical Society of America}, {\bf66}:985989.",
}http://dblp.unitrier.de/db/journals/cacm/cacm19.html#Rubin76;
http://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "A system for the compression of data files, viewed as
strings of characters, is presented. \par
The method is general, and applies equally well to
English, to PL/I, or to digital data. The system
consists of an encoder, an analysis program, and a
decoder. \par
Two algorithms for encoding a string differ slightly
from earlier proposals. The analysis program attempts
to find an optimal set of codes for representing
substrings of the file. Four new algorithms for this
operation are described and compared. Various
parameters in the algorithms are optimized to obtain a
high degree of compression for sample texts.",
acknowledgement = acknhfb,
classcodes = "C6130 (Data handling techniques)",
classification = "723",
corpsource = "IBM, Poughkeepsie, NY, USA",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
journalabr = "Commun ACM",
keywords = "analysis program; comparison of algorithms; computer
programming  Subroutines; data file compaction; data
processing; decoder; encoder; Huffman codes; Ngram
encoding; strings of characters; text compression; text
editing; text file compression",
oldlabel = "Rubin76",
treatment = "P Practical; X Experimental",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Rubin76",
}ebib/datacompression.bib2001.01.22 07:17:30 MSTA system for the compression of data files, viewed as strings of characters, is presented. par The method is general, and applies equally well to English, to PL/I, or to digital data. The system consists of an encoder, an analysis program, and a decoder. par Two algorithms for encoding a string differ slightly from earlier proposals. The analysis program attempts to find an optimal set of codes for representing substrings of the file. Four new algorithms for this operation are described and compared. Various parameters in the algorithms are optimized to obtain a high degree of compression for sample texts.Communications of the ACManalysis program; comparison of algorithms; computer programming  Subroutines; data file compaction; data processing; decoder; encoder; Huffman codes; Ngram encoding; strings of characters; text compression; text editing; text file compressionacknhfbC6130 (Data handling techniques)IBM, Poughkeepsie, NY, USAhttp://portal.acm.org/browse_dl.cfm?idx=J79Commun ACMP Practical; X ExperimentalA system for the compression of data files, viewed as strings of characters, is presented. \par The method is general, and applies equally well to English, to PL/I, or to digital data. The system consists of an encoder, an analysis program, and a decoder. \par Two algorithms for encoding a string differ slightly from earlier proposals. The analysis program attempts to find an optimal set of codes for representing substrings of the file. Four new algorithms for this operation are described and compared. Various parameters in the algorithms are optimized to obtain a high degree of compression for sample texts.Frank RubinExperiments in Text File Compression
@Article{Rubin:1976:ETF,
author = "Frank Rubin",
title = "Experiments in Text File Compression",
journal = jCACM,
volume = "19",
number = "11",
pages = "617623",
month = nov,
year = "1976",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Mon Jan 22 07:17:30 MST 2001",
bibsource = "Compendex database;
http://dblp.unitrier.de/db/journals/cacm/cacm19.html#Rubin76;
http://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "A system for the compression of data files, viewed as
strings of characters, is presented. \par
The method is general, and applies equally well to
English, to PL/I, or to digital data. The system
consists of an encoder, an analysis program, and a
decoder. \par
Two algorithms for encoding a string differ slightly
from earlier proposals. The analysis program attempts
to find an optimal set of codes for representing
substrings of the file. Four new algorithms for this
operation are described and compared. Various
parameters in the algorithms are optimized to obtain a
high degree of compression for sample texts.",
acknowledgement = acknhfb,
classcodes = "C6130 (Data handling techniques)",
classification = "723",
corpsource = "IBM, Poughkeepsie, NY, USA",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
journalabr = "Commun ACM",
keywords = "analysis program; comparison of algorithms; computer
programming  Subroutines; data file compaction; data
processing; decoder; encoder; Huffman codes; Ngram
encoding; strings of characters; text compression; text
editing; text file compression",
oldlabel = "Rubin76",
treatment = "P Practical; X Experimental",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Rubin76",
}
…¨_h] !3'';U3#777E‚I;I‚'‹3„1‹3'I'§A$techreportdatacompression.bibAronson:1977:CSTJules AronsonComputer science and technology: data compression  a comparison of methodsNBS special publication50012Department of Commerce, National Bureau of Standards, Institute for Computer Sciences and TechnologyWashington, DC, USAiv + 31 + 1jun61977XNBSAV00831883 OR 0083188300831883 OR 00831883QC100 .U57 no. 50012Mon Jan 28 15:18:45 MST 2013cliodb.cc.columbia.edu:7090/Voyager; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; libraries.colorado.edu:210/INNOPAC; z3950.loc.gov:7090/Voyager2013.01.28 15:18:45 MSTERIC Document Number: ED149732http://ucblibraries.colorado.edu/circulation/forms/ericrequest.htm; http://www.eric.ed.gov/contentdelivery/servlet/ERICServlet?accno=ED149732This report delineates the theory and terminology of data compression. It surveys four data compression methodsnull suppression, pattern substitution, statistical encoding, and telemetry compressionand relates them to a standard statistical coding problem, i.e., the noisele€ŠxgV 3)'k!!CQ%E_;g'kbookdatacompression.bibWirth:1976:ADSNiklaus WirthAlgorithms $ + $ Data Structures $ = $ ProgramspubPHpubPH:adrSecondxvii + 36619760130224189 OR 01302241899780130224187 OR 9780130224187QA76.6 .W561Sat 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 MSTPrenticeHall Series in Automatic ComputationackdsNiklaus WirthAlgorithms $ + $ Data Structures $ = $ Programs
@Book{Wirth:1976:ADS,
author = "Niklaus Wirth",
title = "Algorithms $ + $ Data Structures $ = $ Programs",
publisher = pubPH,
address = pubPH:adr,
edition = "Second",
pages = "xvii + 366",
year = "1976",
ISBN = "0130224189",
ISBN13 = "9780130224187",
LCCN = "QA76.6 .W561",
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",
series = "PrenticeHall Series in Automatic Computation",
acknowledgement = ackds # " and " # acknhfb,
rawdata = "Wirth, N. (1976) {\it Algorithms + Data Structures =
Programs}, 2nd ed., Englewood Cliffs, NJ,
PrenticeHall.",
}year = "1977",
CODEN = "XNBSAV",
ISSN = "00831883",
ISSNL = "00831883",
LCCN = "QC100 .U57 no. 50012",
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;
libraries.colorado.edu:210/INNOPAC;
z3950.loc.gov:7090/Voyager",
note = "ERIC Document Number: ED149732",
URL = "http://ucblibraries.colorado.edu/circulation/forms/ericrequest.htm;
http://www.eric.ed.gov/contentdelivery/servlet/ERICServlet?accno=ED149732",
abstract = "This report delineates the theory and terminology of
data compression. It surveys four data compression
methodsnull suppression, pattern substitution,
statistical encoding, and telemetry compressionand
relates them to a standard statistical coding problem,
i.e., the noiseless coding problem. The well defined
solution to that problem can serve as a standard on
which to base the effectiveness of data compression
methods. The simple measure described for calculating
the effectiveness of a data compression method is based
on the characterization of the solution to the
noiseless coding problem. Finally, guidelines are
stated concerning the relevance of data compression to
data processing applications. (Author/DAG).",
acknowledgement = acknhfb,
subject = "Data compression (Computer science); Coding theory;
Comparative Analysis; Computer Programs; Computer
Storage Devices; Cost Effectiveness; Data Processing;
Databases; Federal Government; Guidelines; Information
Scientists; Information Storage; Information Theory;
Standards.",
}hss coding problem. The well defined solution to that problem can serve as a standard on which to base the effectiveness of data compression methods. The simple measure described for calculating the effectiveness of a data compression method is based on the characterization of the solution to the noiseless coding problem. Finally, guidelines are stated concerning the relevance of data compression to data processing applications. (Author/DAG).Data compression (Computer science); Coding theory; Comparative Analysis; Computer Programs; Computer Storage Devices; Cost Effectiveness; Data Processing; Databases; Federal Government; Guidelines; Information Scientists; Information Storage; Information Theory; Standards.acknhfbThis report delineates the theory and terminology of data compression. It surveys four data compression methodsnull suppression, pattern substitution, statistical encoding, and telemetry compressionand relates them to a standard statistical coding problem, i.e., the noiseless coding problem. The well defined solution to that problem can serve as a standard on which to base the effectiveness of data compression methods. The simple measure described for calculating the effectiveness of a data compression method is based on the characterization of the solution to the noiseless coding problem. Finally, guidelines are stated concerning the relevance of data compression to data processing applications. (Author/DAG).Jules AronsonERIC Document Number: ED149732Computer science and technology: data compression  a comparison of methods
@TechReport{Aronson:1977:CST,
author = "Jules Aronson",
title = "Computer science and technology: data compression 
a comparison of methods",
type = "NBS special publication",
number = "50012",
institution = "Department of Commerce, National Bureau of Standards,
Institute for Computer Sciences and Technology",
address = "Washington, DC, USA",
pages = "iv + 31 + 1",
month = jun,
year = "1977",
CODEN = "XNBSAV",
ISSN = "00831883",
ISSNL = "00831883",
LCCN = "QC100 .U57 no. 50012",
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;
libraries.colorado.edu:210/INNOPAC;
z3950.loc.gov:7090/Voyager",
note = "ERIC Document Number: ED149732",
URL = "http://ucblibraries.colorado.edu/circulation/forms/ericrequest.htm;
http://www.eric.ed.gov/contentdelivery/servlet/ERICServlet?accno=ED149732",
abstract = "This report delineates the theory and terminology of
data compression. It surveys four data compression
methodsnull suppression, pattern substitution,
statistical encoding, and telemetry compressionand
relates them to a standard statistical coding problem,
i.e., the noiseless coding problem. The well defined
solution to that problem can serve as a standard on
which to base the effectiveness of data compression
methods. The simple measure described for calculating
the effectiveness of a data compression method is based
on the characterization of the solution to the
noiseless coding problem. Finally, guidelines are
stated concerning the relevance of data compression to
data processing applications. (Author/DAG).",
acknowledgement = acknhfb,
subject = "Data compression (Computer science); Coding theory;
Comparative Analysis; Computer Programs; Computer
Storage Devices; Cost Effectiveness; Data Processing;
Databases; Federal Government; Guidelines; Information
Scientists; Information Storage; Information Theory;
Standards.",
}:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
acknowledgement = ackds # " and " # acknhfb,
classcodes = "B0240Z (Other topics in statistics); B6110
(Information theory); C1260 (Information theory); C4210
(Formal logic); C4240 (Programming and algorithm
theory)",
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",
keywords = "algorithm theory; algorithmic information theory;
functions; information theory; probability; recursive;
recursive function theory",
rawdata = "Chaitin, Gregory J. (1977) ``Algorithmic Information
Theory,'' {\it IBM Journal of Research and
Development}, {\bf21}:350359, July.",
reviewer = "Robert P. Daley",
treatment = "T Theoretical or Mathematical",
}i
;8;‰zjX 3''%/;C7;e9'‹?phdthesisdatacompression.bibChen:1977:DCBPo Hsiin ChenData Compression for Binary and MultiLevel Satellite ImageryPh.D. thesisPurdue UniversityWest Lafayette, IN, USA1761977Fri 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/302819991Electrical engineeringacknhfbPo Hsiin ChenData Compression for Binary and MultiLevel Satellite Imagery
@PhdThesis{Chen:1977:DCB,
author = "Po Hsiin Chen",
title = "Data Compression for Binary and MultiLevel Satellite
Imagery",
type = "{Ph.D.} thesis",
school = "Purdue University",
address = "West Lafayette, IN, USA",
pages = "176",
year = "1977",
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/302819991",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7730067",
subject = "Electrical engineering",
}•Ei[ 31I57'!E‚+;[‚‚C+G1Iš#
articledatacompression.bibChaitin:1977:AITGregory J. ChaitinAlgorithmic Information TheoryjIBMJRD214350359jul71977IBMJAE00188646 (print), 21518556 (electronic) OR 00188646 (print), 21518556 (electronic)00188646 OR 0018864694A15 (68A20)56 \#15151Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; http://www.research.ibm.com/journal/2013.01.26 12:46:16 MSTIBM Journal of Research and Developmentalgorithm theory; algorithmic information theory; functions; information theory; probability; recursive; recursive function theoryackdsB0240Z (Other topics in statistics); B6110 (Information theory); C1260 (Information theory); C4210 (Formal logic); C4240 (Programming and algorithm theory)IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USAhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520Robert P. DaleyT Theoretical or MathematicalGregory J. ChaitinAlgorithmic Information Theory
@Article{Chaitin:1977:AIT,
author = "Gregory J. Chaitin",
title = "Algorithmic Information Theory",
journal = jIBMJRD,
volume = "21",
number = "4",
pages = "350359",
month = jul,
year = "1977",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
MRclass = "94A15 (68A20)",
MRnumber = "56 \#15151",
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/ibmjrd.bib;
http://www.research.ibm.com/journal/",
acknowledgement = ackds # " and " # acknhfb,
classcodes = "B0240Z (Other topics in statistics); B6110
(Information theory); C1260 (Information theory); C4210
(Formal logic); C4240 (Programming and algorithm
theory)",
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",
keywords = "algorithm theory; algorithmic information theory;
functions; information theory; probability; recursive;
recursive function theory",
rawdata = "Chaitin, Gregory J. (1977) ``Algorithmic Information
Theory,'' {\it IBM Journal of Research and
Development}, {\bf21}:350359, July.",
reviewer = "Robert P. Daley",
treatment = "T Theoretical or Mathematical",
}
¯ ˆ¯‹VlX 3/ ;57E};[ Žarticledatacompression.bibLawrence:1977:NUCJohn C. LawrenceA New Universal Coding Scheme for the Binary Memoryless SourcejIEEETRANSINFTHEORY234466472jul71977IETTAW00189448 (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 TheoryackdsJohn C. LawrenceA New Universal Coding Scheme for the Binary Memoryless Source
@Article{Lawrence:1977:NUC,
author = "John C. Lawrence",
title = "A New Universal Coding Scheme for the Binary
Memoryless Source",
journal = jIEEETRANSINFTHEORY,
volume = "23",
number = "4",
pages = "466472",
month = jul,
year = "1977",
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 = "Lawrence, John C. (1977) ``A New Universal Coding
Scheme for the Binary Memoryless Source,'' {\it IEEE
Transactions on Information Theory},
{\bf23}(4):466472, July.",
}ŒukX3'{
/!57E};S{
Garticledatacompression.bibChen:1977:FCAWenHsiung Chen and C. Harrison Smith and S. C. FralickA Fast Computational Algorithm For the Discrete Cosine TransformjIEEETRANSCOMM25910041009sep91977IECMBT00906778 (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 CommunicationsackdsWenHsiung Chen and C. Harrison Smith and S. C. FralickA Fast Computational Algorithm For the Discrete Cosine Transform
@Article{Chen:1977:FCA,
author = "WenHsiung Chen and C. Harrison Smith and S. C.
Fralick",
title = "A Fast Computational Algorithm For the Discrete Cosine
Transform",
journal = jIEEETRANSCOMM,
volume = "25",
number = "9",
pages = "10041009",
month = sep,
year = "1977",
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 = "Chen, WenHsiung, C. Harrison Smith, and S. C. Fralick
(1977) ``A Fast Computational Algorithm For the
Discrete Cosine Transform,'' {\it IEEE Transactions on
Communications}, {\bf25}(9):10041009, September.",
}
€A
A0"õ‹t—i
@Article{Smith:19†oa
@Article{Schalkwijk:1972:ASC,
author = ‰.’]
@Article{Rossling:2009:VCA,
author = "Guido R{\"o}{\ss}ling and Florian Lindner",
title = "Visualizing compression algorithms onthefly",
journal = jSIGCSE,
volume = "41",
number = "3",
pages = "376376",
month = sep,
year = "2009",
CODEN = "SIGSD3",
DOI = "http://dx.doi.org/10.1145/1595496.1563018",
ISSN = "00978418",
ISSNL = "00978418",
bibdate = "Sat Nov 17 15 {’6¤o
@Article{Rubin:1976:ETF,
author = "Frank Rubin",
title = "Experiments in Text File Compression",
journal = jCACM,
volume = "19",
number = "11",
pages = "617623",
month = nov,
year = "1976",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Mon Jan 22 07:17:30 MST 2001",
bibsource = "Compendex database;
†_?
@Article{Rubin:1979:ASC,
author = "F. Rubin",
title = "Arithmetic Stream Coding Using Fixed Precision
Registers",
journal = jIEEETRANSINFTHEORY,
volume = "25",
number = "6",
pages = "672675",
month = nov,
year = "1979",
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 = "Rubin, F. (1979) ``Arithmetic Stream Coding Using
Fixed Precision Registers,'' {\it IEEE Transactions on
Information Theory}, {\bf25}(6):672675, November.",
}„ŒC
@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 = "00189„ˆ)
@Article{Ross:1994:ROD,
author = "John W. Ross",
title = "RecordOriented Data Compression",
journal = jCUJ,
volume = "12",
number = "4",
pages = "83??",
month = apr,
year = "1994",
ISSN = "08989788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "C Users Journal",
}ý‰e“K
@Article{Rubin:1979:CAD,
author = "Frank Rubin",
title = "Cryptographic Aspects of Data Compression Codes",
journal = jCRYPTOLOGIA,
volume = "3",
number = "4",
pages = "202205",
month = oct,
year = "1979",
CODEN = "CRYPE6",
DOI = "http://dx.doi.org/10.1080/0161117991854061",
ISSN = "01611194 (print), 15581586 (electronic)",
ISSNL = "01611194",
bibdate = "Mon JuŸ‰v“m
@Article{Roth:1993:DC,
author = "Mark A. Roth and Scott J. {Van Horn}",
title = "Database Compression",
journal = jSIGMOD,
volume = "22",
number = "3",
pages = "3139",
month = sep,
year = "1993",
CODEN = "SRECD8",
ISSN = "01635808 (print), 19435835 (electronic)",
ISSNL = "01635808",
bibdate = "Mon Jan 12 08:45:46 MST 2004",
bibsource = "http://portal.acm.org/;
µ5)",
MRnumber = "0471493 (57 \#11224)",
MRreviewer = "Leon Glass",
bibdate = "Wed Sep 5 09:26:37 2012",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Translated from the French",
ZMnumber = "Zbl 0376.28020",
acknowledgement = acknhfb,
tableofcontents = "I. Introduction \\
II. How long is the coast of Britain? \\
III. Uses of nonconstrained chance \\
IV. Fractal events and noises \\
V. Fractal clusters of stellar matter \\
VI. Turbulence, intermittency and curdling \\
VII. Meteorites, moon craters and soap \\
VIII. Uses of self constrained chance \\
IX. Fractional Brownian facets of rivers, relief and
turbulence \\
X. Miscellany \\
XI. Biographical and historical sketches \\
XII. Mathematical lexicon and addenda",
}m
''‰lnU 3/)i/77E};U)iŒ/articledatacompression.bibRoetling:1977:BACP. G. RoetlingBinary Approximation of Continuous Tone ImagesjPHOTOGRSCIENG2160651977PSENAC00318760 OR 0031876000318760 OR 00318760Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTPhotographic Science and EngineeringackdsP. G. RoetlingBinary Approximation of Continuous Tone Images
@Article{Roetling:1977:BAC,
author = "P. G. Roetling",
title = "Binary Approximation of Continuous Tone Images",
journal = jPHOTOGRSCIENG,
volume = "21",
pages = "6065",
year = "1977",
CODEN = "PSENAC",
ISSN = "00318760",
ISSNL = "00318760",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Photographic Science and Engineering",
rawdata = "Roetling, P. G. (1977) ``Binary Approximation of
Continuous Tone Images,'' {\it Photography Science and
Engineering}, {\bf21}:6065.",
xxjournal = "Photography Science and Engineering",
}•gmY 335W+3)E1'5!;‚;A†o)?AW˜]}bookdatacompression.bibMandelbrot:1977:FFCBenoit B. MandelbrotFractals: form, chance, and dimensionpubWHFREEMANpubWHFREEMAN:adrRevisedxvi + 36519770716704730, 0716704749 (paperback) OR 0716704730, 0716704749 (paperback)9780716704737, 9780716704744 (paperback) OR 9780716704737, 9780716704744 (paperback)QA447 .M3613 1977a69.00 (92A05)0471493 (57 \#11224)Leon GlassWed Sep 5 09:26:37 2012http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2012.09.05 09:26:37 ???Translated from the FrenchI. Introduction II. How long is the coast of Britain? III. Uses of nonconstrained chance IV. Fractal events and noises V. Fractal clusters of stellar matter VI. Turbulence, intermittency and curdling VII. Meteorites, moon craters and soap VIII. Uses of self constrained chance IX. Fractional Brownian facets of rivers, relief and turbulence X. Miscellany XI. Biographical and historical sketches XII. Mathematical lexicon and addendaZbl 0376.28020acknhfbBeno{\^\i}t B. MandelbrotTranslated from the FrenchFractals: form, chance, and dimension
@Book{Mandelbrot:1977:FFC,
author = "Beno{\^\i}t B. Mandelbrot",
title = "Fractals: form, chance, and dimension",
publisher = pubWHFREEMAN,
address = pubWHFREEMAN:adr,
edition = "Revised",
pages = "xvi + 365",
year = "1977",
ISBN = "0716704730, 0716704749 (paperback)",
ISBN13 = "9780716704737, 9780716704744 (paperback)",
LCCN = "QA447 .M3613 1977a",
MRclass = "69.00 (92A05)",
MRnumber = "0471493 (57 \#11224)",
MRreviewer = "Leon Glass",
bibdate = "Wed Sep 5 09:26:37 2012",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrotbenoit.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Translated from the French",
ZMnumber = "Zbl 0376.28020",
acknowledgement = acknhfb,
tableofcontents = "I. Introduction \\
II. How long is the coast of Britain? \\
III. Uses of nonconstrained chance \\
IV. Fractal events and noises \\
V. Fractal clusters of stellar matter \\
VI. Turbulence, intermittency and curdling \\
VII. Meteorites, moon craters and soap \\
VIII. Uses of self constrained chance \\
IX. Fractional Brownian facets of rivers, relief and
turbulence \\
X. Miscellany \\
XI. Biographical and historical sketches \\
XII. Mathematical lexicon and addenda",
}on.bib",
acknowledgement = acknhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "School of Information and Computer Sci., Georgia Inst.
of Technol., Atlanta, GA, USA",
fjournal = "International Journal of Computer and Information Sciences",
keywords = "data compression; decoding; encoding; homogeneous
text; numerical coding method; storage; storage
allocation; storage space; text compaction; text
editing; text information",
treatment = "G General Review",
}o
(Ó((pW3%;w;a57Ek;[;w”articledatacompression.bibZiv:1977:UASJacob Ziv and A. LempelA Universal Algorithm for Sequential Data CompressionjIEEETRANSINFTHEORYIT233337343may51977IETTAWhttp://dx.doi.org/10.1109/TIT.1977.105571400189448 (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/computer1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information TheoryackdsJacob Ziv and A. LempelA Universal Algorithm for Sequential Data Compression
@Article{Ziv:1977:UAS,
author = "Jacob Ziv and A. Lempel",
title = "A Universal Algorithm for Sequential Data
Compression",
journal = jIEEETRANSINFTHEORY,
volume = "IT23",
number = "3",
pages = "337343",
month = may,
year = "1977",
CODEN = "IETTAW",
DOI = "http://dx.doi.org/10.1109/TIT.1977.1055714",
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/computer1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "IEEE Transactions on Information Theory",
rawdata1 = "Ziv, Jacob, and A. Lempel (1977) ``A Universal
Algorithm for Sequential Data Compression,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT23}(3):337343.",
rawdata2 = "Ziv, J., and A. Lempel (1977) ``A Universal Algorithm
for Sequential Data Compression,'' {\it IEEE
Transactions on Information Theory},
IT23(3):337343.",
}Ž*oX 3'!}97E};‚e5!}Yarticledatacompression.bibTing:1977:CHTT. C. TingCompacting homogeneous text for minimizing storage spacejINTJCOMPUTINFSCI63211221sep91977IJCIAH00917036 OR 00917036Sat Apr 26 12:20:22 MDT 1997http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.04.26 12:20:22 MDTInternational Journal of Computer and Information Sciencesdata compression; decoding; encoding; homogeneous text; numerical coding method; storage; storage allocation; storage space; text compaction; text editing; text informationacknhfbSchool of Information and Computer Sci., Georgia Inst. of Technol., Atlanta, GA, USAG General ReviewT. C. TingCompacting homogeneous text for minimizing storage space
@Article{Ting:1977:CHT,
author = "T. C. Ting",
title = "Compacting homogeneous text for minimizing storage
space",
journal = jINTJCOMPUTINFSCI,
volume = "6",
number = "3",
pages = "211221",
month = sep,
year = "1977",
CODEN = "IJCIAH",
ISSN = "00917036",
bibdate = "Sat Apr 26 12:20:22 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "School of Information and Computer Sci., Georgia Inst.
of Technol., Atlanta, GA, USA",
fjournal = "International Journal of Computer and Information Sciences",
keywords = "data compression; decoding; encoding; homogeneous
text; numerical coding method; storage; storage
allocation; storage space; text compaction; text
editing; text information",
treatment = "G General Review",
} = "00189448",
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 = "IEEE Transactions on Information Theory",
rawdata1 = "Ziv, Jacob, and A. Lempel (1977) ``A Universal
Algorithm for Sequential Data Compression,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT23}(3):337343.",
rawdata2 = "Ziv, J., and A. Lempel (1977) ``A Universal Algorithm
for Sequential Data Compression,'' {\it IEEE
Transactions on Information Theory},
IT23(3):337343.",
}p
z ùz’rX3'Gg57E‚a;?
M[cGGg—}articledatacompression.bibEven:1978:EECShimon Even and Michael RodehEconomical Encoding of Commas Between StringsjCACM214315317apr41978CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 0001078268A1058 3648John CherniavskySat Jan 26 12:46:16 MST 2013http://dblp.unitrier.de/db/journals/cacm/cacm21.html#EvenR78; 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 MSTCommunications of the ACMcommas; data handling; delimiters; encoding; extra cost; stringsackdsC6130 (Data handling techniques)Israel Inst. of Technol., Haifa, Israelhttp://portal.acm.org/browse_dl.cfm?idx=J79T Theoretical or MathematicalShimon Even and Michael RodehEconomical Encoding of Commas Between Strings
@Article{Even:1978:EEC,
author = "Shimon Even and Michael Rodeh",
title = "Economical Encoding of Commas Between Strings",
journal = jCACM,
volume = "21",
number = "4",
pages = "315317",
month = apr,
year = "1978",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
MRclass = "68A10",
MRnumber = "58 3648",
MRreviewer = "John Cherniavsky",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm21.html#EvenR78;
http://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds # " and " # acknhfb,
classcodes = "C6130 (Data handling techniques)",
corpsource = "Israel Inst. of Technol., Haifa, Israel",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "commas; data handling; delimiters; encoding; extra
cost; strings",
oldlabel = "EvenR78",
rawdata = "Even, S. and M. Rodeh (1978) ``Economical Encoding of
Commas Between Strings,'' {\it Communications of the
ACM}, {\bf21}(4):315317, April.",
treatment = "T Theoretical or Mathematical",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/EvenR78",
}ŒqX 3G_a%3/C7;e9cephdthesisdatacompression.bibCapitantdeVillebonne:1978:DIDPatrice JeanMarie Capitant de VillebonneDesign and Implementation of DistortionFree Compression Techniques for LANDSAT Data and Television ImagesPh.D. thesisStanford UniversityStanford, CA, USA791978Fri 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/302940557Electrical engineeringacknhfbPatrice JeanMarie {Capitant de Villebonne}Design and Implementation of DistortionFree Compression Techniques for {LANDSAT} Data and Television Images
@PhdThesis{CapitantdeVillebonne:1978:DID,
author = "Patrice JeanMarie {Capitant de Villebonne}",
title = "Design and Implementation of DistortionFree
Compression Techniques for {LANDSAT} Data and
Television Images",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "79",
year = "1978",
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/302940557",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7822484",
subject = "Electrical engineering",
}erniavsky",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm21.html#EvenR78;
http://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds # " and " # acknhfb,
classcodes = "C6130 (Data handling techniques)",
corpsource = "Israel Inst. of Technol., Haifa, Israel",
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "commas; data handling; delimiters; encoding; extra
cost; strings",
oldlabel = "EvenR78",
rawdata = "Even, S. and M. Rodeh (1978) ``Economical Encoding of
Commas Between Strings,'' {\it Communications of the
ACM}, {\bf21}(4):315317, April.",
treatment = "T Theoretical or Mathematical",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/EvenR78",
}r.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Information Theory",
rawdata1 = "Gallager, Robert G. (1978) ``Variations On a Theme By
Huffman,'' {\it IEEE Transactions on Information
Theory}, {\bf IT24}(6):668674, November.",
rawdata2 = "Gallager, Robert G. (1978) ``Variations on a Theme by
Huffman,'' {\it IEEE Transactions on Information
Theory}, {\bf24}(6):668674, November.",
}s
‰ ã‰ŠWtX 3+9'%KC7;e99'Œphdthesisdatacompression.bibHooker:1978:OSQLawrence Eugene HookerOptimum Sampling and Quantizing for Multiple Channel Data Compression SystemsPh.D. thesisNorth Carolina State UniversityRaleigh, NC, USA3061978Fri 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/302897622Electrical engineeringacknhfbLawrence Eugene HookerOptimum Sampling and Quantizing for Multiple Channel Data Compression Systems
@PhdThesis{Hooker:1978:OSQ,
author = "Lawrence Eugene Hooker",
title = "Optimum Sampling and Quantizing for Multiple Channel
Data Compression Systems",
type = "{Ph.D.} thesis",
school = "North Carolina State University",
address = "Raleigh, NC, USA",
pages = "306",
year = "1978",
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/302897622",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7905490",
subject = "Electrical engineering",
}ŒsV 3/1M;57E};[1Qarticledatacompression.bibGallager:1978:VTHRobert G. GallagerVariations On a Theme By HuffmanjIEEETRANSINFTHEORYIT246668674nov111978IETTAW00189448 (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. GallagerVariations On a Theme By {Huffman}
@Article{Gallager:1978:VTH,
author = "Robert G. Gallager",
title = "Variations On a Theme By {Huffman}",
journal = jIEEETRANSINFTHEORY,
volume = "IT24",
number = "6",
pages = "668674",
month = nov,
year = "1978",
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 = "Gallager, Robert G. (1978) ``Variations On a Theme By
Huffman,'' {\it IEEE Transactions on Information
Theory}, {\bf IT24}(6):668674, November.",
rawdata2 = "Gallager, Robert G. (1978) ``Variations on a Theme by
Huffman,'' {\it IEEE Transactions on Information
Theory}, {\bf24}(6):668674, November.",
}
W
<Fû…u‹k
@PhdT…i‹U
@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",
}%†I
@PhdThesis{Miller:1995:MCD,
author = "Mark Christopher Miller",
title = "Multiscale compression of digital terrain data to meet
realtime rendering rate constraints",
type = "{Ph.D.} thesis",
school = "University of California, Davis",
address = "Davis, CA, USA",
pages = "216",
year = "1995",
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/304175054",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertationthesisnumber = "9533082",
subject = "Electrical engineering; Computer science",
}œ…t‹i
@PhdThesis{Marr:1980:TDP,
author = "James Douglas Marr",
title = "TwoDimensional Prediction for Data Rate Compression
of Lpc Parameters",
type = "{Ph.D.} thesis",
school = "Georgia Institute of Technology",
address = "Atlanta, GA, USA",
pages = "154",
year = "1980",
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/303008916",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8105828",
subject = "Electrical engineering",
}Ž†Œ3
@PhdThesis{Markas:1993:DCA,
author = "Tassos Markas",
title = "Data compression: Algorithms and architectures",
type = "{Ph.D.} thesis",
school = "Duke University",
address = "Durham, NC 27708, USA",
pages = "170",
year = "1993",
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/304040162",
acknowledgement = acknhfb,
advisor = "John H. Reif",
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertationthesisnumber = "9405986",
subject = "Electrical engineering; Computer science",
}‰…'ŠQ
@PhdThesis{Ma:1978:DC,
author = "Joong Soo Ma",
title = "Data Compression",
type = "{Ph.D.} thesis",
school = "University of Massachusetts Amherst",
address = "Amherst, MA, USA",
pages = "148",
year = "1978",
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/302919063",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7903802",
subject = "Electrical engineering",
}yviewer = "Ram Autar",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib",
acknowledgement = acknhfb,
classification = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku,
Finland",
fjournal = "Information Processing Letters",
journalURL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "bit vector compression; codes, symbolic; compression
gain; data compression; encoding; Huffman coding;
information theory  Data Compression",
treatment = "T Theoretical or Mathematical",
}u
s+s©vZ 3%{]57C„S;5…}Og{®garticledatacompression.bibLea:1978:TCAR. M. LeaText Compression with an Associative Parallel ProcessorjCOMPJ2114556feb21978CMPJA6http://dx.doi.org/10.1093/comjnl/21.1.4500104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Tue Dec 4 14:48:02 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/21/1.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_21/Issue_01/2012.12.04 14:48:02 MSThttp://comjnl.oxfordjournals.org/content/21/1/45.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/45.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/46.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/47.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/48.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/49.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21’‘RuX 31%]57E‚;I‚)ywG%a”}articledatacompression.bibJakobsson:1978:HCBM. JakobssonHuffman coding in bitvector compressionjINFOPROCLETT76304307oct101978IFPLAT00200190 (print), 18726119 (electronic) OR 00200190 (print), 18726119 (electronic)00200190 OR 0020019094B2580f:94026Ram AutarTue Nov 17 10:49:43 MST 1998Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib1998.11.17 10:49:43 MSTInformation Processing Lettersbit vector compression; codes, symbolic; compression gain; data compression; encoding; Huffman coding; information theory  Data CompressionacknhfbDept. of Computer Sci., Univ. of Turku, Turku, Finlandhttp://www.sciencedirect.com/science/journal/00200190Inf Process LettT Theoretical or MathematicalM. Jakobsson{Huffman} coding in bitvector compression
@Article{Jakobsson:1978:HCB,
author = "M. Jakobsson",
title = "{Huffman} coding in bitvector compression",
journal = jINFOPROCLETT,
volume = "7",
number = "6",
pages = "304307",
day = "??",
month = oct,
year = "1978",
CODEN = "IFPLAT",
ISSN = "00200190 (print), 18726119 (electronic)",
ISSNL = "00200190",
MRclass = "94B25",
MRnumber = "80f:94026",
MRreviewer = "Ram Autar",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib",
acknowledgement = acknhfb,
classification = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku,
Finland",
fjournal = "Information Processing Letters",
journalURL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "bit vector compression; codes, symbolic; compression
gain; data compression; encoding; Huffman coding;
information theory  Data Compression",
treatment = "T Theoretical or Mathematical",
} "Tue Dec 4 14:48:02 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/21/1.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_21/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/21/1/45.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/45.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/46.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/47.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/48.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/49.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/50.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/51.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/52.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/53.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/54.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/55.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/56.tif",
acknowledgement = acknhfb,
classcodes = "C0310 (EDP management); C6130 (Data handling
techniques)",
classification = "723; 901",
corpsource = "Dept. of Electrical Engng. and Electronics, Brunel
Univ., Uxbridge, UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "associative parallel processor; byte; compression;
computer selection and evaluation; data compression;
data processing; fixed record length system; hardware;
information retrieval systems; microprocessor system;
organised variable record length; parallel processing;
text editing; textual information; textual information
decompression",
treatment = "T Theoretical or Mathematical; X Experimental",
}v/Issue_01/tiff/50.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/51.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/52.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/53.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/54.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/55.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/56.tifThe Computer Journalassociative parallel processor; byte; compression; computer selection and evaluation; data compression; data processing; fixed record length system; hardware; information retrieval systems; microprocessor system; organised variable record length; parallel processing; text editing; textual information; textual information decompressionacknhfbC0310 (EDP management); C6130 (Data handling techniques)Dept. of Electrical Engng. and Electronics, Brunel Univ., Uxbridge, UKhttp://comjnl.oxfordjournals.org/T Theoretical or Mathematical; X ExperimentalR. M. LeaText Compression with an Associative Parallel Processor
@Article{Lea:1978:TCA,
author = "R. M. Lea",
title = "Text Compression with an Associative Parallel
Processor",
journal = jCOMPJ,
volume = "21",
number = "1",
pages = "4556",
month = feb,
year = "1978",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/21.1.45",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:48:02 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/21/1.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_21/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/21/1/45.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/45.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/46.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/47.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/48.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/49.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/50.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/51.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/52.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/53.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/54.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/55.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/56.tif",
acknowledgement = acknhfb,
classcodes = "C0310 (EDP management); C6130 (Data handling
techniques)",
classification = "723; 901",
corpsource = "Dept. of Electrical Engng. and Electronics, Brunel
Univ., Uxbridge, UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "associative parallel processor; byte; compression;
computer selection and evaluation; data compression;
data processing; fixed record length system; hardware;
information retrieval systems; microprocessor system;
organised variable record length; parallel processing;
text editing; textual information; textual information
decompression",
treatment = "T Theoretical or Mathematical; X Experimental",
}
, œ,ˆmyV 3!%%SC7;e9%ŠQphdthesisdatacompression.bibMa:1978:DCJoong Soo MaData CompressionPh.D. thesisUniversity of Massachusetts AmherstAmherst, MA, USA1481978Fri 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/302919063Electrical engineeringacknhfbJoong Soo MaData Compression
@PhdThesis{Ma:1978:DC,
author = "Joong Soo Ma",
title = "Data Compression",
type = "{Ph.D.} thesis",
school = "University of Massachusetts Amherst",
address = "Amherst, MA, USA",
pages = "148",
year = "1978",
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/302919063",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7903802",
subject = "Electrical engineering",
}¤yx[ 35+…;qE‚;Š9I5Š9+…[¡uarticledatacompression.bibLouisGavet:1978:DAIGuy LouisGavetDiverses applications issues d'une fonction $f$ de compactage basee sur une etude mathematique du langage naturel (compactage de donnees, comparaison de textes, hashcoding). [Various Applications Issued from a Compression Function $f$ Based on a Mathematical Study of the Natural Language (Data Compression, Comparison of Texts, HashCoding)]RAIRO Informatique/Computer Science (Revue Francaise d'Automatique, d'Informatique et de Recherche Operationnelle)12147711978RSINDNSat Jan •‰]wV 3)%{%3/C7;e9%{‹+phdthesisdatacompression.bibLinde:1978:DTTYoseph LindeThe Design of Tree and Trellis Data Compression SystemsPh.D. thesisStanford UniversityStanford, CA, USA1421978Fri 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/302929849Electrical engineeringacknhfbYoseph LindeThe Design of Tree and Trellis Data Compression Systems
@PhdThesis{Linde:1978:DTT,
author = "Yoseph Linde",
title = "The Design of Tree and Trellis Data Compression
Systems",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "142",
year = "1978",
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/302929849",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7808809",
subject = "Electrical engineering",
} (Data Compression, Comparison of Texts, HashCoding)]",
journal = "RAIRO Informatique/Computer Science (Revue
Fran{\c{c}}aise d'Automatique, d'Informatique et de
Recherche Operationnelle)",
volume = "12",
number = "1",
pages = "4771",
month = "????",
year = "1978",
CODEN = "RSINDN",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Various compression techniques are discussed, along
with numerous applications. A method of compression is
considered which is based on a mathematical study
concerned with the repartition of characters in a set
natural language. A high rate of compression without
risk of redundancies is obtained. It is about 1/30
(sometimes much higher) when operating in an
interrogational mode and about one quarter when we want
to find again the original data. The applications
described demonstrate the interest of this approach:
compression of keywords of a thesaurus, of namesfirst
names, of titlesauthors of books; comparison of texts,
and applications in Hashcoding.",
acknowledgement = acknhfb,
classification = "723",
journalabr = "RAIRO Inf Comput Sci",
keywords = "computer programming languages",
language = "French",
}x25 17:38:12 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib1997.01.25 17:38:12 MSTVarious compression techniques are discussed, along with numerous applications. A method of compression is considered which is based on a mathematical study concerned with the repartition of characters in a set natural language. A high rate of compression without risk of redundancies is obtained. It is about 1/30 (sometimes much higher) when operating in an interrogational mode and about one quarter when we want to find again the original data. The applications described demonstrate the interest of this approach: compression of keywords of a thesaurus, of namesfirst names, of titlesauthors of books; comparison of texts, and applications in Hashcoding.computer programming languagesFrenchacknhfbRAIRO Inf Comput SciVarious compression techniques are discussed, along with numerous applications. A method of compression is considered which is based on a mathematical study concerned with the repartition of characters in a set natural language. A high rate of compression without risk of redundancies is obtained. It is about 1/30 (sometimes much higher) when operating in an interrogational mode and about one quarter when we want to find again the original data. The applications described demonstrate the interest of this approach: compression of keywords of a thesaurus, of namesfirst names, of titlesauthors of books; comparison of texts, and applications in Hashcoding.Guy LouisGavetDiverses applications issues d'une fonction $f$ de compactage bas{\'e}e sur une {\'e}tude math{\'e}matique du langage naturel (compactage de donn{\'e}es, comparaison de textes, hashcoding). [Various Applications Issued from a Compression Function $f$ Based on a Mathematical Study of the Natural Language (Data Compression, Comparison of Texts, HashCoding)]
@Article{LouisGavet:1978:DAI,
author = "Guy LouisGavet",
title = "Diverses applications issues d'une fonction $f$ de
compactage bas{\'e}e sur une {\'e}tude math{\'e}matique
du langage naturel (compactage de donn{\'e}es,
comparaison de textes, hashcoding). [Various
Applications Issued from a Compression Function $f$
Based on a Mathematical Study of the Natural Language
(Data Compression, Comparison of Texts, HashCoding)]",
journal = "RAIRO Informatique/Computer Science (Revue
Fran{\c{c}}aise d'Automatique, d'Informatique et de
Recherche Operationnelle)",
volume = "12",
number = "1",
pages = "4771",
month = "????",
year = "1978",
CODEN = "RSINDN",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Various compression techniques are discussed, along
with numerous applications. A method of compression is
considered which is based on a mathematical study
concerned with the repartition of characters in a set
natural language. A high rate of compression without
risk of redundancies is obtained. It is about 1/30
(sometimes much higher) when operating in an
interrogational mode and about one quarter when we want
to find again the original data. The applications
described demonstrate the interest of this approach:
compression of keywords of a thesaurus, of namesfirst
names, of titlesauthors of books; comparison of texts,
and applications in Hashcoding.",
acknowledgement = acknhfb,
classification = "723",
journalabr = "RAIRO Inf Comput Sci",
keywords = "computer programming languages",
language = "French",
}
E)
®L ÂŒ)k„ˆ5
@InProceedings{Wu:2000:OPE,
author = "Xiaolin Wu and Zixiang Xiong",
title = "Optimal packetization of embedded bitstreams",
crossref = "Storer:2000:DPD",
pages = "????",
year = "2000",
DOI = "http://dx.doi.org/10.1109/DCC.2000.838227",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838227",
acknowledgement = acknhfb,
}ÕG
@InProceedings{Wyner:1991:FDB,
„ˆ?
@InProceedings{Wu:2002:OMR,
author = "Xiaolin Wu and S. Dumitrescu",
title = "On optimal multiresolution scalar quantization",
crossref = "Storer:2002:DPD",
pages = "322331",
year = "2002",
DOI = "http://dx.doi.org/10.1109/DCC.2002.999970",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999970",
acknowledgement = acknhfb,
}µ„4ˆi
@InProceedings{Wu:1999:LCH,
author = "X. Wu",
title = "Low complexity highorder context modeling of embedded
wavelet bit streams",
crossref = "Storer:1999:DPD",
pages = "112120",
year = "1999",
DOI = "http://dx.doi.org/10.1109/DCC.1999.755660",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755660",
acknowledgement = acknhfb,
}R„D‰
@InProceedings{Wu:1999:CQF,
author = "X. Wu",
title = "Context quantization with {Fisher} discriminant for
adaptive embedded wavelet image coding",
crossref = "Storer:1999:DPD",
pages = "102111",
year = "1999",
DOI = "http://dx.doi.org/10.1109/DCC.1999.755659",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755659",
acknowledgement = acknhfb,
}Q„B‰
@InProceedings{Wu:1998:LII,
author = "X. Wu and WaiKin Choi and N. Memon",
title = "Lossless interframe image compression via context
modeling",
crossref = "Storer:1998:PDD",
pages = "378387",
year = "1998",
DOI = "http://dx.doi.org/10.1109/DCC.1998.672169",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672169",
acknowledgement = acknhfb,
}±„`‰A
@InProceedings{Wu:1997:CHF,
author = "Xiaolin Wu and Wai Kin Choi and P. Bao",
title = "{$L_\infty$}constrained highfidelity image
compression via adaptive context modeling",
crossref = "Storer:1997:DDC",
pages = "91100",
year = "1997",
DOI = "http://dx.doi.org/10.1109/DCC.1997.581978",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581978",
acknowledgement = acknhfb,
}„P‰!
@InProceedings{Wu:1997:CEC,
author = "Xiaolin Wu and Jiang Wen and Wing Hung Wong",
title = "Conditional entropy coding of {VQ} indexes for image
compression",
crossref = "Storer:1997:DDC",
pages = "347356",
year = "1997",
DOI = "http://dx.doi.org/10.1109/DCC.1997.582058",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582058",
acknowledgement = acknhfb,
}ÿ
ÄƒÄ‡<{V'3+[}%E;[}‡9
inproceedingsdatacompression.bibStorer:1978:MMDJames A. Storer and Thomas G. SzymanskiThe macro model for data compression (Extended Abstract)ACM:1978:CRT30391978Wed Feb 20 18:33:31 MST 2002http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2002.02.20 18:33:31 MSTacknhfbJames A. Storer and Thomas G. SzymanskiThe macro model for data compression (Extended Abstract)
@InProceedings{Storer:1978:MMD,
author = "James A. Storer and Thomas G. Szymanski",
title = "The macro model for data compression (Extended
Abstract)",
crossref = "ACM:1978:CRT",
pages = "3039",
year = "1978",
bibdate = "Wed Feb 20 18:33:31 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
}ˆzzU3_U!E};__UŠwbookdatacompression.bibRabiner:1978:DPSLawrence R. Rabiner and Ronald W. SchaferDigital Processing of Speech SignalspubPHpubPH:adr1978Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTPrenticeHall Series in Signal ProcessingackdsLawrence R. Rabiner and Ronald W. SchaferDigital Processing of Speech Signals
@Book{Rabiner:1978:DPS,
author = "Lawrence R. Rabiner and Ronald W. Schafer",
title = "Digital Processing of Speech Signals",
publisher = pubPH,
address = pubPH:adr,
pages = "??",
year = "1978",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "PrenticeHall Series in Signal Processing",
acknowledgement = ackds,
rawdata = "Rabiner, Lawrence R. and Ronald W. Schafer (1978) {\it
Digital Processing of Speech Signals}, Englewood
Cliffs, NJ, PrenticeHall Series in Signal
Processing.",
}e = "Compendex database;
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 = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku,
Finland",
fjournal = "Information Processing Letters",
journalURL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "clustered bit vectors; codes, symbolic; compression
method; data compression; encoding; fixed to variable
encoding; information theory  Data Compression;
variable to fixed encoding; variable to variable
encoding",
rawdata = "Teuhola, J. (1978) ``A Compression Method for
Clustered BitVectors,'' {\it Information Processing
Letters}, {\bf7}:308311, October.",
treatment = "T Theoretical or Mathematical",
}
‰s}X 3%%3C7;e9%‹9phdthesisdatacompression.bibYalabik:1978:CDCNese YalabikContour Data Compression Exploiting CurveToCurve DependencePh.D. thesisBrown UniversityProvidence, RI, USA1001978Fri 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/302882442Electrical engineeringacknhfbNese YalabikContour Data Compression Exploiting CurveToCurve Dependence
@PhdThesis{Yalabik:1978:CDC,
author = "Nese Yalabik",
title = "Contour Data Compression Exploiting CurveToCurve
Dependence",
type = "{Ph.D.} thesis",
school = "Brown University",
address = "Providence, RI, USA",
pages = "100",
year = "1978",
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/302882442",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "7906632",
subject = "Electrical engineering",
}“rX 3'i57E‚;Iƒ9ywG'i˜Karticledatacompression.bibTeuhola:1978:CMCJukka TeuholaA Compression Method for Clustered BitVectorsjINFOPROCLETT76308311oct101978IFPLAT00200190 (print), 18726119 (electronic) OR 00200190 (print), 18726119 (electronic)00200190 OR 00200190Sat Jan 26 12:46:16 MST 2013Compendex database; http://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 Lettersclustered bit vectors; codes, symbolic; compression method; data compression; encoding; fixed to variable encoding; information theory  Data Compression; variable to fixed encoding; variable to variable encodingackdsDept. of Computer Sci., Univ. of Turku, Turku, Finlandhttp://www.sciencedirect.com/science/journal/00200190Inf Process LettT Theoretical or MathematicalJukka TeuholaA Compression Method for Clustered BitVectors
@Article{Teuhola:1978:CMC,
author = "Jukka Teuhola",
title = "A Compression Method for Clustered BitVectors",
journal = jINFOPROCLETT,
volume = "7",
number = "6",
pages = "308311",
day = "??",
month = oct,
year = "1978",
CODEN = "IFPLAT",
ISSN = "00200190 (print), 18726119 (electronic)",
ISSNL = "00200190",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
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 = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku,
Finland",
fjournal = "Information Processing Letters",
journalURL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "clustered bit vectors; codes, symbolic; compression
method; data compression; encoding; fixed to variable
encoding; information theory  Data Compression;
variable to fixed encoding; variable to variable
encoding",
rawdata = "Teuhola, J. (1978) ``A Compression Method for
Clustered BitVectors,'' {\it Information Processing
Letters}, {\bf7}:308311, October.",
treatment = "T Theoretical or Mathematical",
} ISSNL = "00189448",
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 = "IEEE Transactions on Information Theory",
rawdata1 = "Ziv, Jacob and A. Lempel (1978) ``Compression of
Individual Sequences via VariableRate Coding,'' {\it
IEEE Transactions on Information Theory}, {\bf
IT24}(5):530536.",
rawdata2 = "Ziv, J., and A. Lempel (1978) ``Compression of
Individual Sequences via VariableRate Coding,'' {\it
IEEE Transactions on Information Theory}
IT24(5):530536.",
}~
ý2ý†2V !3)1I'‚1I†stechreportdatacompression.bibBeebe:1979:IFDNelson H. F. BeebeIntegral File Data CompressioninstCLSCinstCLSC:adr3918may51979http://www.math.utah.edu/pub/bibnet/authors/b/beebenelsonhf.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bibNelson H. F. BeebeIntegral File Data Compression
@TechReport{Beebe:1979:IFD,
author = "Nelson H. F. Beebe",
title = "Integral File Data Compression",
institution = instCLSC,
address = instCLSC:adr,
pages = "39",
day = "18",
month = may,
year = "1979",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/b/beebenelsonhf.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}K~Y3%;;a57Ek;[;”+articledatacompression.bibZiv:1978:CISJacob Ziv and A. LempelCompression of Individual Sequences via VariableRate CodingjIEEETRANSINFTHEORYIT245530536sep91978IETTAWhttp://dx.doi.org/10.1109/TIT.1978.105593400189448 (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/computer1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information TheoryackdsJacob Ziv and A. LempelCompression of Individual Sequences via VariableRate Coding
@Article{Ziv:1978:CIS,
author = "Jacob Ziv and A. Lempel",
title = "Compression of Individual Sequences via VariableRate
Coding",
journal = jIEEETRANSINFTHEORY,
volume = "IT24",
number = "5",
pages = "530536",
month = sep,
year = "1978",
CODEN = "IETTAW",
DOI = "http://dx.doi.org/10.1109/TIT.1978.1055934",
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/computer1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "IEEE Transactions on Information Theory",
rawdata1 = "Ziv, Jacob and A. Lempel (1978) ``Compression of
Individual Sequences via VariableRate Coding,'' {\it
IEEE Transactions on Information Theory}, {\bf
IT24}(5):530536.",
rawdata2 = "Ziv, J., and A. Lempel (1978) ``Compression of
Individual Sequences via VariableRate Coding,'' {\it
IEEE Transactions on Information Theory}
IT24(5):530536.",
}
›‹X 3;U%=C7;e;UŒphdthesisdatacompression.bibHouston:1979:AFMGeorge Branston HoustonThe Application of Formal Models to a Fully Adaptive General Purpose Digital Data Compression SystemPh.D. thesisUniversity of WashingtonSeattle, WA, USA3591979Fri 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/302947120Computer scienceacknhfbGeorge Branston HoustonThe Application of Formal Models to a Fully Adaptive General Purpose Digital Data Compression System
@PhdThesis{Houston:1979:AFM,
author = "George Branston Houston",
title = "The Application of Formal Models to a Fully Adaptive
General Purpose Digital Data Compression System",
type = "{Ph.D.} thesis",
school = "University of Washington",
address = "Seattle, WA, USA",
pages = "359",
year = "1979",
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/302947120",
acknowledgement = acknhfb,
classification = "0984: Computer science",
dissertationthesisnumber = "7927805",
subject = "Computer science",
}†aV'3)Ag%E;Ag†einproceedingsdatacompression.bibGalil:1979:NFGZvi Galil and Amnon NaamadNetwork flow and generalized path compressionACM:1979:CRE13261979Wed Feb 20 18:33:31 MST 2002http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2002.02.20 18:33:31 MSTacknhfbZvi Galil and Amnon NaamadNetwork flow and generalized path compression
@InProceedings{Galil:1979:NFG,
author = "Zvi Galil and Amnon Naamad",
title = "Network flow and generalized path compression",
crossref = "ACM:1979:CRE",
pages = "1326",
year = "1979",
bibdate = "Wed Feb 20 18:33:31 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
}‹X 3)1‚%9GC7;e31‚phdthesisdatacompression.bibEvans:1979:SREArnold Kerry EvansStatistical Representation of Electrocardiographic Body Surface Maps for Feature Identification, Data Compression and ClassificationPh.D. thesisThe University of UtahSalt Lake City, UT 84112, USA961979Fri 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/302988278Biomedical researchacknhfbArnold Kerry EvansStatistical Representation of Electrocardiographic Body Surface Maps for Feature Identification, Data Compression and Classification
@PhdThesis{Evans:1979:SRE,
author = "Arnold Kerry Evans",
title = "Statistical Representation of Electrocardiographic
Body Surface Maps for Feature Identification, Data
Compression and Classification",
type = "{Ph.D.} thesis",
school = "The University of Utah",
address = "Salt Lake City, UT 84112, USA",
pages = "96",
year = "1979",
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/302988278",
acknowledgement = acknhfb,
classification = "0541: Biomedical research",
dissertationthesisnumber = "7924352",
subject = "Biomedical research",
}
**D
E
N§–Œ2˜e
@PhdThesis{Pigeon:2001:CCD,
author = "Steven Pigeon",
title = "Contributions {\`a} la compression de donn{\'e}es.
({French}) [Contributions to Data Compression]",
type = "{Ph.D.} Thesis",
school = "D{\'e}partement d'informatique et de recherche
op{\'e}rationnelle, Facult{\'e} des Arts \& Sciences,
Universit{\'e} de Montr{\'e}al",
address = "Montr{\'e}al, QC, Canada",
pages = "xviY…n‹]
@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†Œ1
@PhdThesis{Mohammed:2004:HDR,
author = "Falah H. M. Ahmad Mohammed",
title = "High Data Rate Pulse Compression Using NonLinear
Transmission Line ({NLTL}) Technology",
type = "{Ph.D.} thesis",
school = "Queen's University of Belfast",
address = "Belfast, Northern Ireland",
pages = "249",
year = "2004",
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/305088588",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "C819979",
subject = "Electrical engineering",
}˜†Œ
@PhdThesis{Namphol:1991:NNB,
author = "Aran Namphol",
title = "Neural network based data compression",
type = "{Ph.D.} thesis",
school = "The Catholic University of America",
address = "Washington, DC, USA",
pages = "276",
year = "1991",
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/303929431",
acknowledgement = acknhfb,
advisor = "Mohammed Arozullah",
classification = "0317: Neurology; 0544: Electrical engineering",
dissertationthesisnumber = "9123107",
subject = "Electrical engineering; Neurology",
}Ì…u‹m
@PhdThesis{Nussbaum:1976:SCA,
author = "Howard Steven Nussbaum",
title = "Source Coding and Adaptive Data Compression for
Communication Networks",
type = "{Ph.D.} thesis",
school = "University of California, Los Angeles",
address = "Los Angeles, CA, USA",
pages = "220",
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/302826487",
acknowledgement = acknhfb,
classification = "0790: Systems design",
dissertationthesisnumber = "7707677",
subject = "Systems design",
}a…9Šs
@PhdThesis{NevillManning:1996:ISS,
author = "C. G. NevillManning",
title = "Inferring Sequential Structure",
type = "{Ph.D.} Thesis",
school = "Department of Computer Science, University of
Waikato",
address = "Waikato, NZ",
pages = "??",
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "NevillManning, C. G. (1996) ``Inferring Sequential
Structure,'' Ph.D. thesis, Department of Computer
Science, University of Waikato, New Zealand.",
}G
ætæ‹
V 3)};57E};[}?articledatacompression.bibRubin:1979:ASCF. RubinArithmetic Stream Coding Using Fixed Precision RegistersjIEEETRANSINFTHEORY256672675nov111979IETTAW00189448 (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 TheoryackdsF. RubinArithmetic Stream Coding Using Fixed Precision Registers
@Article{Rubin:1979:ASC,
author = "F. Rubin",
title = "Arithmetic Stream Coding Using Fixed Precision
Registers",
journal = jIEEETRANSINFTHEORY,
volume = "25",
number = "6",
pages = "672675",
month = nov,
year = "1979",
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 = "Rubin, F. (1979) ``Arithmetic Stream Coding Using
Fixed Precision Registers,'' {\it IEEE Transactions on
Information Theory}, {\bf25}(6):672675, November.",
}‰U 3')u+?/E};)u‹5miscdatacompression.bibRice:1979:SPURobert F. RiceSome Practical Universal Noiseless Coding TechniquesJPL Publication7922Jet Propulsion LaboratoryPasadena, CA, USAmar31979Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTackdsRobert F. RiceSome Practical Universal Noiseless Coding Techniques
@Misc{Rice:1979:SPU,
author = "Robert F. Rice",
title = "Some Practical Universal Noiseless Coding Techniques",
type = "JPL Publication",
number = "7922",
institution = "Jet Propulsion Laboratory",
address = "Pasadena, CA, USA",
pages = "??",
month = mar,
year = "1979",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Rice, Robert F. (1979) ``Some Practical Universal
Noiseless Coding Techniques,'' Jet Propulsion
Laboratory, JPL Publication 7922, Pasadena, CA,
March.",
}n 30 15:38:28 MDT 2008",
bibsource = "http://ourworld.compuserve.com/homepages/crypto/BIBALL.HTM;
http://www.dean.usma.edu/math/pubs/cryptologia/;
http://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "See also {\em Comm. ACM}, 19 (November 1976):
616623.",
URL = "http://www.informaworld.com/smpp/content~content=a741902806~db=all~order=page",
acknowledgement = acknhfb,
fjournal = "Cryptologia",
journalURL = "http://www.tandfonline.com/loi/ucry20",
romanvolume = "III",
xxtitle = "Crypto of Data Compression Codes",
xxtitle = "Experiments in Text File Compression",
}…
npn‰~V 3)7%3/C7;e97‹Aphdthesisdatacompression.bibSmith:1979:SPAGeorge Heavener SmithSpectral Peak Amplitude Coding for Voice Data CompressionPh.D. thesisStanford UniversityStanford, CA, USA1011979Fri 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/302972664Electrical engineeringacknhfbGeorge Heavener SmithSpectral Peak Amplitude Coding for Voice Data Compression
@PhdThesis{Smith:1979:SPA,
author = "George Heavener Smith",
title = "Spectral Peak Amplitude Coding for Voice Data
Compression",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "101",
year = "1979",
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/302972664",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8002017",
subject = "Electrical engineering",
}‘X 3)#k'c57EƒC;u'#W#{k“Karticledatacompression.bibRubin:1979:CADFrank RubinCryptographic Aspects of Data Compression CodesjCRYPTOLOGIA34202205oct101979CRYPE6http://dx.doi.org/10.1080/016111799185406101611194 (print), 15581586 (electronic) OR 01611194 (print), 15581586 (electronic)01611194 OR 01611194Mon Jun 30 15:38:28 MDT 2008http://ourworld.compuserve.com/homepages/crypto/BIBALL.HTM; http://www.dean.usma.edu/math/pubs/cryptologia/; http://www.math.utah.edu/pub/tex/bib/cryptologia.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2008.06.30 15:38:28 MDTSee also em Comm. ACM, 19 (November 1976): 616623.http://www.informaworld.com/smpp/content~content=a741902806~db=all~order=pageCryptologiaacknhfbhttp://www.tandfonline.com/loi/ucry20Frank RubinSee also {\em Comm. ACM}, 19 (November 1976): 616623.Cryptographic Aspects of Data Compression Codes
@Article{Rubin:1979:CAD,
author = "Frank Rubin",
title = "Cryptographic Aspects of Data Compression Codes",
journal = jCRYPTOLOGIA,
volume = "3",
number = "4",
pages = "202205",
month = oct,
year = "1979",
CODEN = "CRYPE6",
DOI = "http://dx.doi.org/10.1080/0161117991854061",
ISSN = "01611194 (print), 15581586 (electronic)",
ISSNL = "01611194",
bibdate = "Mon Jun 30 15:38:28 MDT 2008",
bibsource = "http://ourworld.compuserve.com/homepages/crypto/BIBALL.HTM;
http://www.dean.usma.edu/math/pubs/cryptologia/;
http://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "See also {\em Comm. ACM}, 19 (November 1976):
616623.",
URL = "http://www.informaworld.com/smpp/content~content=a741902806~db=all~order=page",
acknowledgement = acknhfb,
fjournal = "Cryptologia",
journalURL = "http://www.tandfonline.com/loi/ucry20",
romanvolume = "III",
xxtitle = "Crypto of Data Compression Codes",
xxtitle = "Experiments in Text File Compression",
}base;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "Several fast algorithms are presented for computing
functions defined on paths in trees under various
assumptions. The algorithms are based on tree
manipulation methods first used to efficiently
represent equivalence relations. The algorithms have
$O((m + n) \alpha (m + n,n))$ running times, where $m$
and $n$ are measures of the problem size and $\alpha$
is a functional inverse of Ackermann's function. By
using one or more of these algorithms in combination
with other techniques, it is possible to solve several
graph problems in $O(m \alpha (m,n))$ time, where $m$
is the number of edges and $n$ is the number of
vertices in the problem graph.",
acknowledgement = acknhfb,
classification = "723; 921",
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "computer programming  Subroutines; data processing;
mathematical techniques  Trees",
}‡
‹ã‹´
ÁÒô†gO
@Book{Byrnes:1994:WTA,
editor = "James S. Byrnes and Jennifer L. Byrnes and Kathryn A.
Hargreaves and Karl Berry",
booktitle = "Wavelets and Their Applications",
title = "Wavelets and Their Applications",
volume = "442",
publisher = pubKLUWER,
address = pubKLUWER:adr,
year = "1994",
ISBN = "0792330781",
ISBN13 = "9780792330783",
bibdate = "Fri Mar 31 11:11:22 MST 1995",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/w/wickerhausermvictor.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Proceedings of the NATO Advanced Study Institute at Il
Ciocco, Barga, Italy in August, 1992",
series = "NATO ASI Series C: Mathematical and Physical
Sciences",
}
\‹G—
@Book{Cormen:2001:IA,
author = "Thomas H. Cormen and Charles E. Leiserson and Ronald
L. Rivest and Clifford Stein",
title = "Introduction to Algorithms",
publisher = "MIT Press and McGrawHill",
address = "Cambridge, MA, USA, and New York, NY, USA",
edition = "Second",
pages = "xxi + 1180",
year = "2001",
ISBN = "0262531968 (paperback), 0262032937 (hardcover),
0070131511 (M2X›1
@Book{Buttcher:2010:IRI,
author = "Stefan B{\"u}ttcher and Charles L. A. Clarke and
Gordon V. Cormack",
title = "Information Retrieval: Implementing and Evaluating
Search Engines",
publisher = pubMIT,
address = pubMIT:adr,
pages = "xxiv + 606",
year = "2010",
ISBN = "0262026511 (hardcover)",
ISBN13 = "9780262026512 (hardcover)",
LCCN = "TK5105.884 .B98 2010",
b ¬@¡
@Book{Choe:2005:CET,
author = "Geon Ho Choe",
title = "Computational ergodic theory",
volume = "13",
publisher = pubSV,
address = pubSV:adr,
pages = "xix + 453",
year = "2005",
ISBN = "3540231218 (hardcover)",
ISBN13 = "9783540231219 (hardcover)",
ISSN = "14311550",
LCCN = "QA313 .C485 2005",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "http://www.math.utaŒƒq‡c
@Book{Chaitin:1997:LM,
author = "Gregory J. Chaitin",
title = "The Limits of Mathematics",
publisher = pubSV,
address = pubSV:adr,
pages = "??",
year = "1997",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Chaitin, Gregory J. (1997) {\it The Limits of
Mathematics}, Singapore, SpringerVerlag.",
}Œ†J
@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)",
}Ç
ˆˆžtZ 3+3q57E‚;Šq=e3Š3q'articledatacompression.bibTarjan:1979:APCRobert Endre TarjanApplications of Path Compression on Balanced TreesjJACM264690715oct101979JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 00045411Wed Jan 15 18:12:53 MST 1997Compendex database; 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 MSTSeveral fast algorithms are presented for computing functions defined on paths in trees under various assumptions. The algorithms are based on tree manipulation methods first used to efficiently represent equivalence relations. The algorithms have $O((m + n) alpha (m + n,n))$ running times, where $m$ and $n$ are measures of the problem size and $alpha $ is a functional inverse of Ackermann's function. By using one or more of these algorithms in combination with other techniques, it is possible to solve several graph problems in $O(m alpha (m,n))$ time, where $m$ is the number of edges and $n$ is the number of vertices in the problem graph.Journal of the Association for Computing Machinerycomputer programming  Subroutines; data processing; mathematical techniques  Treesacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J401J Assoc Comput MachSeveral fast algorithms are presented for computing functions defined on paths in trees under various assumptions. The algorithms are based on tree manipulation methods first used to efficiently represent equivalence relations. The algorithms have $O((m + n) \alpha (m + n,n))$ running times, where $m$ and $n$ are measures of the problem size and $\alpha$ is a functional inverse of Ackermann's function. By using one or more of these algorithms in combination with other techniques, it is possible to solve several graph problems in $O(m \alpha (m,n))$ time, where $m$ is the number of edges and $n$ is the number of vertices in the problem graph.Robert Endre TarjanApplications of Path Compression on Balanced Trees
@Article{Tarjan:1979:APC,
author = "Robert Endre Tarjan",
title = "Applications of Path Compression on Balanced Trees",
journal = jJACM,
volume = "26",
number = "4",
pages = "690715",
month = oct,
year = "1979",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Wed Jan 15 18:12:53 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "Several fast algorithms are presented for computing
functions defined on paths in trees under various
assumptions. The algorithms are based on tree
manipulation methods first used to efficiently
represent equivalence relations. The algorithms have
$O((m + n) \alpha (m + n,n))$ running times, where $m$
and $n$ are measures of the problem size and $\alpha$
is a functional inverse of Ackermann's function. By
using one or more of these algorithms in combination
with other techniques, it is possible to solve several
graph problems in $O(m \alpha (m,n))$ time, where $m$
is the number of edges and $n$ is the number of
vertices in the problem graph.",
acknowledgement = acknhfb,
classification = "723; 921",
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "computer programming  Subroutines; data processing;
mathematical techniques  Trees",
}
°š°‹f X 3++5%!77Em;i7[+5Œ}articledatacompression.bibDunham:1980:AASJames G. DunhamAbstract Alphabet SlidingBlock Entropy Compression Coding with a Fidelity CriterionjANNPROBAB8610851092dec121980APBYAE00911798 OR 0091179800911798 OR 00911798Sun Apr 20 10:44:17 MDT 2014http://www.math.utah.edu/pub/tex/bib/annprobab1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2014.04.20 10:44:17 MDThttp://projecteuclid.org/euclid.aop/1176994570Annals of Probabilityacknhfbhttp://projecteuclid.org/all/euclid.aopJames G. DunhamAbstract Alphabet SlidingBlock Entropy Compression Coding with a Fidelity Criterion
@Article{Dunham:1980:AAS,
author = "James G. Dunham",
title = "Abstract Alphabet SlidingBlock Entropy Compression
Coding with a Fidelity Criterion",
journal = jANNPROBAB,
volume = "8",
number = "6",
pages = "10851092",
month = dec,
year = "1980",
CODEN = "APBYAE",
ISSN = "00911798",
ISSNL = "00911798",
bibdate = "Sun Apr 20 10:44:17 MDT 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/annprobab1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://projecteuclid.org/euclid.aop/1176994570",
acknowledgement = acknhfb,
fjournal = "Annals of Probability",
journalURL = "http://projecteuclid.org/all/euclid.aop",
}ˆbX 31/;+/%E7;7;‰phdthesisdatacompression.bibBorjesson:1980:DCSPer Ola BorjessonData compression and signal estimation with application to digitized electrocardiogramsDoctoral thesisLunds universitetLund, Sweden441980Mon Jan 28 15:23:08 MST 2013catalog.crl.edu:210/INNOPAC; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.28 15:23:08 MSTacknhfbPer Ola B{\"o}rjessonData compression and signal estimation with application to digitized electrocardiograms
@PhdThesis{Borjesson:1980:DCS,
author = "Per Ola B{\"o}rjesson",
title = "Data compression and signal estimation with
application to digitized electrocardiograms",
type = "Doctoral thesis",
school = "Lunds universitet",
address = "Lund, Sweden",
pages = "44",
year = "1980",
LCCN = "????",
bibdate = "Mon Jan 28 15:23:08 MST 2013",
bibsource = "catalog.crl.edu:210/INNOPAC;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
}
ã…ã
–×Ò–_?
@Article{Burtscher:2009:FHS,
author = "M. Burtscher and P. Ratanaworabhan",
title = "{FPC}: a HighSpeed Compressor for DoublePrecision
FloatingPoint Data",
journal = jIEEETRANSCOMPUT,
volume = "58",
number = "1",
pages = "1831",
month = jan,
year = "2009",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2008.131",
ISSN = "00189340 (print), 15579956 (e I†Œ
@Article{Calude:1998:TNL,
author = "Cristian Calude and Tudor Zamfirescu",
title = "The Typical Number is a Lexicon",
journal = jNEWZEALANDJMATH,
volume = "27",
pages = "713",
year = "1998",
CODEN = "",
ISSN = "11716096 (print), 11794984 (electronic)",
ISSNL = "11716096",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "New Zealand Journal of Mathematics",
rawdata = "Calude, Cristian and Tudor Zamfirescu (1998) ``The
Typical Number is a Lexicon,'' {\it New Zealand Journal
of Mathematics}, {\bf27}:713.",
} ‡=Ž{
@Article{Cai:2006:DIW,
author = "Weiting Cai and Malek Adjouadi",
title = "Design and Implementation of WaveletDomain Video
Compression Using Multiresolution Motion Estimation and
Compensation",
journal = jINTJIMAGEGRAPHICS,
volume = "6",
number = "4",
pages = "533549",
month = oct,
year = "2006",
CODEN = "????",
DOI = "http://dx.doi.org/10.1142/S0219467806002471",
ISSN = "02194678",
bibdate = "Tue Aug 31 08:38:01 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = acknhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journalURL = "http://www.worldscientific.com/worldscinet/ijig",
} ˆˆ'
@Article{Buyanovsky:1994:AC,
author = "George Buyanovsky",
title = "Associative Coding",
journal = "Monitor",
volume = "8",
pages = "1019",
month = aug,
year = "1994",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Hard copies of the Russian source and English
translation are available from the authors of tÛ†ys
@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.",
}®
'oØPoÏ4Â
]TÃ…#ŠI
@Article{Fang:19Z„Z‰5
@Article{Culik:1993:ICUb,
author = "Karel {Culik II} and Jarkko Kari",
title = "Image compression using weighted finite automata",
journal = jLECTNOTESCOMPSCI,
volume = "711",
pages = "392??",
year = "1993",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Mon May 13 11:49:00 MDT 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}m
Š@•
@Article{Culik:1997:FAB,
author = "Karel {Culik II} and Vladimir Valenta",
title = "Finite Automata Based Compression of BiLevel and
Simple Color Images",
journal = jCOMPUTERSANDGRAPHICS,
volume = "21",
number = "1",
pages = "6168",
month = jan # "" # feb,
year = "1997",
CODEN = "COGRD2",
ISSN = "00978493 (print), 18737684 (electronic)",
ISSNL = "00978493",
d†lY
@Article{Davis:1996:IIM,
author = "Geoffrey Davis",
title = "Implicit image models in image fractal compression",
journal = jPROCSPIE,
volume = "2569",
number = "??",
pages = "8897",
month = "????",
year = "1996",
CODEN = "PSISDG",
ISBN = "0819422134",
ISBN13 = "9780819422132",
ISSN = "????",
ISSNL = "0277786X",
LCCN = "TS510.S63 v.2825",
bibdate = "Sat Sep 8 13:53:06 2012",
bibsource = "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/datacompression.bib",
fjournal = "Proceedings of the SPIE  The International Society for Optical Engineering",
}ýw“4¦k
@Article{Dance:1976:ALD,
author = "D. L. Dance and U. W. Pooch",
title = "An adaptive on line data compression system",
journal = jCOMPJ,
volume = "19",
number = "3",
pages = "216224",
month = aug,
year = "1976",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/19.3.216",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "n6‡pa
@Article{DeCanne:1994:ERC,
author = Ñ‰I“
@Article{DeAgostino:2000:EPC,
author = "Sergio {De Agostino}",
title = "Erratum to {``Pcomplete Problems in Data
Compression'' [Theoret. Comput. Sci. 127 (1994)
181186]}",
journal = jTHEORCOMPSCI,
volume = "234",
number = "12",
pages = "325326",
day = "6",
month = mar,
year = "2000",
CODEN = "TCSCDI",
ISSN = "03043975 (print), 18792294 (eÔÞ‡*ŽU
@Article{Craft:1998:FHD,
author = "D. J. Craft",
title = "A fast hardware data compression algorithm and some
algorithmic extensions",
journal = jIBMJRD,
volume = "42",
number = "6",
pages = "733745",
month = "????",
year = "1998",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Mon Feb 12 08:11:29 2001",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
URL = "http://www.almaden.ibm.com/journal/rd/426/craft.html",
acknowledgement = acknhfb,
fjournal = "IBM Journal of Research and Development",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}.,
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 = "Frank, Amalie J., J. D. Daniels, and Diane R. Unangst
(1980) ``Progressive Image Transmission Using a
GrowthGeometry Coding,'' {\it Proceedings of the
IEEE}, {\bf68}(7):897909, July.",
}Š
^ I^‹gV3+Em#57E};;EmŽ
articledatacompression.bibHunter:1980:IDFR. Hunter and A. H. RobinsonInternational Digital Facsimile Coding StandardsjPROCIEEE687854867jul71980IEEPAD00189219 (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 MSTProceedings of the IEEEackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5R. Hunter and A. H. RobinsonInternational Digital Facsimile Coding Standards
@Article{Hunter:1980:IDF,
author = "R. Hunter and A. H. Robinson",
title = "International Digital Facsimile Coding Standards",
journal = jPROCIEEE,
volume = "68",
number = "7",
pages = "854867",
month = jul,
year = "1980",
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 = "Hunter, R., and A. H. Robinson (1980) ``International
Digital Facsimile Coding Standards,'' {\it Proceedings
of the IEEE}, {\bf68}(7):854867, July.",
}3
X3)y#57E};;y
articledatacompression.bibFrank:1980:PITAmalie J. Frank and J. D. Daniels and Diane R. UnangstProgressive Image Transmission Using a GrowthGeometry CodingjPROCIEEE687897909jul71980IEEPAD00189219 (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 MSTProceedings of the IEEEackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5Amalie J. Frank and J. D. Daniels and Diane R. UnangstProgressive Image Transmission Using a GrowthGeometry Coding
@Article{Frank:1980:PIT,
author = "Amalie J. Frank and J. D. Daniels and Diane R.
Unangst",
title = "Progressive Image Transmission Using a GrowthGeometry
Coding",
journal = jPROCIEEE,
volume = "68",
number = "7",
pages = "897909",
month = jul,
year = "1980",
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 = "Frank, Amalie J., J. D. Daniels, and Diane R. Unangst
(1980) ``Progressive Image Transmission Using a
GrowthGeometry Coding,'' {\it Proceedings of the
IEEE}, {\bf68}(7):897909, July.",
} "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 = "Knowlton, Kenneth (1980) ``Progressive Transmission of
GreyScale and Binary Pictures by Simple, Efficient,
and Lossless Encoding Schemes,'' {\it Proceedings of
the IEEE}, {\bf68}(7):885896, July.",
}Œ
™ ™Œy
V3)Sc/57E};SScwarticledatacompression.bibLinde:1980:AVQY. Linde and A. Buzo and R. M. GrayAn Algorithm for Vector Quantization DesignjIEEETRANSCOMMCOM288495jan11980IECMBT00906778 (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 CommunicationsackdsY. Linde and A. Buzo and R. M. GrayAn Algorithm for Vector Quantization Design
@Article{Linde:1980:AVQ,
author = "Y. Linde and A. Buzo and R. M. Gray",
title = "An Algorithm for Vector Quantization Design",
journal = jIEEETRANSCOMM,
volume = "COM28",
pages = "8495",
month = jan,
year = "1980",
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 = "Linde,~Y., A. Buzo, and R. M. Gray (1980) ``An
Algorithm for Vector Quantization Design,'' {\it IEEE
Transactions on Communications}, {\bf COM28}:8495,
January.",
rawdata2 = "Linde,~Y., A. Buzo, and R. M. Gray (1980) ``An
Algorithm for Vector Quantization Design,'' {\it IEEE
Transactions on Communications}, COM28:8495,
January.",
}fX 3/i#57E};;i=articledatacompression.bibKnowlton:1980:PTGKenneth KnowltonProgressive Transmission of GreyScale and Binary Pictures by Simple, Efficient, and Lossless Encoding SchemesjPROCIEEE687885896jul71980IEEPAD00189219 (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 MSTProceedings of the IEEEackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5Kenneth KnowltonProgressive Transmission of GreyScale and Binary Pictures by Simple, Efficient, and Lossless Encoding Schemes
@Article{Knowlton:1980:PTG,
author = "Kenneth Knowlton",
title = "Progressive Transmission of GreyScale and Binary
Pictures by Simple, Efficient, and Lossless Encoding
Schemes",
journal = jPROCIEEE,
volume = "68",
number = "7",
pages = "885896",
month = jul,
year = "1980",
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 = "Knowlton, Kenneth (1980) ``Progressive Transmission of
GreyScale and Binary Pictures by Simple, Efficient,
and Lossless Encoding Schemes,'' {\it Proceedings of
the IEEE}, {\bf68}(7):885896, July.",
}utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "IEEE Transactions on Communications",
rawdata1 = "Linde,~Y., A. Buzo, and R. M. Gray (1980) ``An
Algorithm for Vector Quantization Design,'' {\it IEEE
Transactions on Communications}, {\bf COM28}:8495,
January.",
rawdata2 = "Linde,~Y., A. Buzo, and R. M. Gray (1980) ``An
Algorithm for Vector Quantization Design,'' {\it IEEE
Transactions on Communications}, COM28:8495,
January.",
}
2²ø ê”¨%
@Article{Pan:1993:DAC,
author = "Davis Yen Pan",
title = "Digital Audio Compression",
journal = jDECTECHJ,
volume = "5",
number = "2",
pages = "2833 (or 2840??)",
month = "S†Œ/
@Article{Ornstein:1990:UAS,
author = "Donald S. Ornstein and Paul C. Shields",
title = "Universal Almost Sure Data Compression",
journal = jANNPROBAB,
volume = "18",
number = "2",
pages = "441452",
month = apr,
year = "‡vm
@Article{Olano:2011:ETV,
author = "M. Olano and D. Baker and W. Griffin and J. Barczak",
title = "Efficient Textures: Variable Bit Rate {GPU} Texture
Decompression",
journal = jCGF,
volume = "30",
number = "4",
pages = "12991308",
month = jun,
year = "2011",
CODEN = "CGFODY",
DOI = "http://dx.doi.org/10.1111/j.14678659.2011.01989.x",
ISSN = "01677055 (print), 14
$‡8Žq
@Article{Okazaki:2002:DCM,
author = "Takumi Okazaki and Kunihiko Sadakane and Hiroshi
Imai",
title = "Data Compression Method Combining Properties of {PPM}
and {CTW}",
journal = jLECTNOTESCOMPSCI,
volume = "2281",
pages = "268??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Tue Sep 10 19:09:10 MDT 2002",
bibsource = "http://link.springerny.com/link/service/series/0558/tocs/t2281.htm;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springerny.com/link/service/series/0558/bibs/2281/22810268.htm;
http://link.springerny.com/link/service/series/0558/papers/2281/22810268.pdf",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}’†~}
@Article{OConnell:2003:PJD,
author = "S. J. O'Connell and N. Winterbottom",
title = "Performing joins without decompression in a compressed
database system",
journal = jSIGMOD,
volume = "32",
number = "1",
pages = "611",
month = mar,
year = "2003",
CODEN = "SRECD8",
ISSN = "01635808 (print), 19435835 (electronic)",
ISSNL = "01635808",
bibdate = "Mon Jan 12 07:43:36 MST 2004",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/sigmod.bib",
acknowledgement = acknhfb,
fjournal = "SIGMOD Record (ACM Special Interest Group on
Management of Data)",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J689",
}‡L
@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.",
}
t
ÊtŠRV31C?#57E};;C?ŒG)articledatacompression.bibNetravali:1980:PCPA. Netravali and J. O. LimbPicture Coding: a PreviewjPROCIEEE683664061980IEEPAD00189219 (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 MSTProceedings of the IEEEackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5A. Netravali and J. O. LimbPicture Coding: a Preview
@Article{Netravali:1980:PCP,
author = "A. Netravali and J. O. Limb",
title = "Picture Coding: a Preview",
journal = jPROCIEEE,
volume = "68",
pages = "366406",
year = "1980",
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 = "Netravali, A. and J. O. Limb (1980) ``Picture Coding:
A Preview,'' {\it Proceedings of the IEEE},
{\bf68}:366406.",
}Š2X 3'1%KC7;e91‹iphdthesisdatacompression.bibMarr:1980:TDPJames Douglas MarrTwoDimensional Prediction for Data Rate Compression of Lpc ParametersPh.D. thesisGeorgia Institute of TechnologyAtlanta, GA, USA1541980Fri 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/303008916Electrical engineeringacknhfbJames Douglas MarrTwoDimensional Prediction for Data Rate Compression of Lpc Parameters
@PhdThesis{Marr:1980:TDP,
author = "James Douglas Marr",
title = "TwoDimensional Prediction for Data Rate Compression
of Lpc Parameters",
type = "{Ph.D.} thesis",
school = "Georgia Institute of Technology",
address = "Atlanta, GA, USA",
pages = "154",
year = "1980",
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/303008916",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8105828",
subject = "Electrical engineering",
}
WÔWŠyV 3)m;57E};[marticledatacompression.bibStout:1980:IPEQuentin F. StoutImproved Prefix Encodings of the Natural NumbersjIEEETRANSINFTHEORY265607609sep91980IETTAW00189448 (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 TheoryackdsQuentin F. StoutImproved Prefix Encodings of the Natural Numbers
@Article{Stout:1980:IPE,
author = "Quentin F. Stout",
title = "Improved Prefix Encodings of the Natural Numbers",
journal = jIEEETRANSINFTHEORY,
volume = "26",
number = "5",
pages = "607609",
month = sep,
year = "1980",
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 = "Stout, Quentin F. (1980) ``Improved Prefix Encodings
of the Natural Numbers,'' {\it IEEE Transactions on
Information Theory}, {\bf26}(5):607609, September.",
}Ž([ 3/3 57=‚C;1?c35 Žarticledatacompression.bibPeterson:1980:CPDJames Lyle PetersonComputer Programs for Detecting and Correcting Spelling ErrorsjCACM2312676687dec121980CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Sun Feb 04 16:47:16 1996http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib1996.02.04 16:47:16 ???See remarks cite Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES.Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79James Lyle PetersonSee remarks \cite{Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.Computer Programs for Detecting and Correcting Spelling Errors
@Article{Peterson:1980:CPD,
author = "James Lyle Peterson",
title = "Computer Programs for Detecting and Correcting
Spelling Errors",
journal = jCACM,
volume = "23",
number = "12",
pages = "676687",
month = dec,
year = "1980",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sun Feb 04 16:47:16 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/spell.bib",
note = "See remarks
\cite{Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}nt), 15579484 (electronic)",
ISSNL = "01635999",
bibdate = "Thu Jun 26 10:58:02 MDT 2008",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
abstract = "This paper deals with the economic tradeoffs
associated with data compression in a packet switching
environment. In section II we present the data profile
concept and the compression analysis of typical
filetransfer data strings. This is followed by a
compression cost saving model that is developed in
section III. Upper bounds for an economically effective
compression service are derived there, and the paper
concludes with an example of these bounds based on
state of the art technology.",
acknowledgement = acknhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journalURL = "http://portal.acm.org/toc.cfm?id=J618",
}’
š_[3'CW%]57E‚;‡eeW‡eCW™ articledatacompression.bibAleh:1981:DUBAvner Aleh and K. Dan LevinThe determination of upper bounds for economically effective compression in packet switching networksjSIGMETRICS1116472Spring1981http://doi.acm.org/10.1145/800047.80169401635999 (print), 15579484 (electronic) OR 01635999 (print), 15579484 (electronic)01635999 OR 01635999Thu Jun 26 10:58:02 MDT 2008http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/sigmetrics.bib2008.06.26 10:58:02 MDTThis paper deals with the economic tradeoffs associated with data compression in a packet switching environment. In section II we present the data profile concept and the compression analysis of typical filetransfer data strings. This is followed by a compression cost saving model that is developed in section III. Upper bounds for an economically effective compression service are derived there, and the paper concludes with an example of these bounds based on state of the art technology.ACM SIGMETRICS Performance Evaluation Reviewacknhfbhttp://portal.acm.org/toc.cfm?id=J618This paper deals with the economic tradeoffs associated with data compression in a packet switching environment. In section II we present the data profile concept and the compression analysis of typical filetransfer data strings. This is followed by a compression cost saving model that is developed in section III. Upper bounds for an economically effective compression service are derived there, and the paper concludes with an example of these bounds based on state of the art technology.Avner Aleh and K. Dan LevinThe determination of upper bounds for economically effective compression in packet switching networks
@Article{Aleh:1981:DUB,
author = "Avner Aleh and K. Dan Levin",
title = "The determination of upper bounds for economically
effective compression in packet switching networks",
journal = jSIGMETRICS,
volume = "11",
number = "1",
pages = "6472",
month = "Spring",
year = "1981",
CODEN = "????",
DOI = "http://doi.acm.org/10.1145/800047.801694",
ISSN = "01635999 (print), 15579484 (electronic)",
ISSNL = "01635999",
bibdate = "Thu Jun 26 10:58:02 MDT 2008",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
abstract = "This paper deals with the economic tradeoffs
associated with data compression in a packet switching
environment. In section II we present the data profile
concept and the compression analysis of typical
filetransfer data strings. This is followed by a
compression cost saving model that is developed in
section III. Upper bounds for an economically effective
compression service are derived there, and the paper
concludes with an example of these bounds based on
state of the art technology.",
acknowledgement = acknhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journalURL = "http://portal.acm.org/toc.cfm?id=J618",
}
/
ø/•E[3)k57E‚;IƒI}w#k™Earticledatacompression.bibDavis:1981:DCLR. H. Davis and C. Rinaldi and C. J. TrebilcockData Compression in Limited Capacity Microcomputer SystemsjINFOPROCLETT1345138141End1981IFPLAT00200190 (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 Letterscomputers, microprocessor; data base systems; data compression; data reduction; data reduction and analysis; database; information retrieval; information theory  Data Compression; microcomputer systems; storage capacityacknhfbThis issue was labelled End 1981, instead of Day Month 1981.Dept. of Computer Sci., HeriotWatt Univ., Edinburgh, UKhttp://www.sciencedirect.com/science/journal/00200190Inf Process LettP PracticalR. H. Davis and C. Rinaldi and C. J. TrebilcockData Compression in Limited Capacity Microcomputer Systems
@Article{Davis:1981:DCL,
author = "R. H. Davis and C. Rinaldi and C. J. Trebilcock",
title = "Data Compression in Limited Capacity Microcomputer
Systems",
journal = jINFOPROCLETT,
volume = "13",
number = "45",
pages = "138141",
day = "??",
month = "End",
year = "1981",
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,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "723; 731; C6120 (File organisation); C6130 (Data
handling techniques); C7250L (Nonbibliographic
retrieval systems)",
corpsource = "Dept. of Computer Sci., HeriotWatt Univ., Edinburgh,
UK",
fjournal = "Information Processing Letters",
journalURL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "computers, microprocessor; data base systems; data
compression; data reduction; data reduction and
analysis; database; information retrieval; information
theory  Data Compression; microcomputer systems;
storage capacity",
treatment = "P Practical",
}ŠX 3)% %C/C7;e9% ‹Iphdthesisdatacompression.bibBarba:1981:MADJoseph BarbaA Modified Adaptive Delta Modulator for Video Data CompressionPh.D. thesisCity University of New YorkNew York, NY, USA2191981Fri 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/303098954Electrical engineeringacknhfbJoseph BarbaA Modified Adaptive Delta Modulator for Video Data Compression
@PhdThesis{Barba:1981:MAD,
author = "Joseph Barba",
title = "A Modified Adaptive Delta Modulator for Video Data
Compression",
type = "{Ph.D.} thesis",
school = "City University of New York",
address = "New York, NY, USA",
pages = "219",
year = "1981",
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/303098954",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8203266",
subject = "Electrical engineering",
}0190",
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,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "723; 731; C6120 (File organisation); C6130 (Data
handling techniques); C7250L (Nonbibliographic
retrieval systems)",
corpsource = "Dept. of Computer Sci., HeriotWatt Univ., Edinburgh,
UK",
fjournal = "Information Processing Letters",
journalURL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "computers, microprocessor; data base systems; data
compression; data reduction; data reduction and
analysis; database; information retrieval; information
theory  Data Compression; microcomputer systems;
storage capacity",
treatment = "P Practical",
}”
p p‘Z3%;w1!7Cƒu;‚O;{’5articledatacompression.bibEng:1981:SPBK. Y. Eng and O. C. YueSpectral Properties and BandLimiting Effects of TimeCompressed TV Signals in a TimeCompression Multiplexing SystemjBELLSYSTTECHJ60921672185nov111981BSTJAN00058580 OR 00058580Tue Nov 9 11:15:56 MST 2010http://bstj.belllabs.com/oldfiles/year.1981/BSTJ.1981.6009.html; http://www.alcatellucent.com/bstj/vol601981/bstjvol60issue09.html; http://www.math.utah.edu/pub/tex/bib/bstj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2010.11.09 11:15:56 MSThttp://bstj.belllabs.com/BSTJ/images/Vol60/bstj6092167.pdf; http://www.alcatellucent.com/bstj/vol601981/articles/bstj6092167.pdfThe Bell System Technical Journalacknhfbhttp://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/K. Y. Eng and O. C. YueSpectral Properties and BandLimiting Effects of TimeCompressed {TV} Signals in a TimeCompression Multiplexing System
@Article{Eng:1981:SPB,
author = "K. Y. Eng and O. C. Yue",
title = "Spectral Properties and BandLimiting Effects of
TimeCompressed {TV} Signals in a TimeCompression
Multiplexing System",
journal = jBELLSYSTTECHJ,
volume = "60",
number = "9",
pages = "21672185",
month = nov,
year = "1981",
CODEN = "BSTJAN",
ISSN = "00058580",
bibdate = "Tue Nov 9 11:15:56 MST 2010",
bibsource = "http://bstj.belllabs.com/oldfiles/year.1981/BSTJ.1981.6009.html;
http://www.alcatellucent.com/bstj/vol601981/bstjvol60issue09.html;
http://www.math.utah.edu/pub/tex/bib/bstj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://bstj.belllabs.com/BSTJ/images/Vol60/bstj6092167.pdf;
http://www.alcatellucent.com/bstj/vol601981/articles/bstj6092167.pdf",
acknowledgement = acknhfb,
fjournal = "The Bell System Technical Journal",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/",
}yY 3/3{57=‚C;!?c3%Žcarticledatacompression.bibDunlavey:1981:LESMichael R. DunlaveyLetter to the Editor: On Spelling Correction and BeyondjCACM249608608sep91981CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Sun Feb 04 16:48:13 1996http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib1996.02.04 16:48:13 ???See cite Peterson:1980:CPD,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES.Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Michael R. DunlaveySee \cite{Peterson:1980:CPD,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.Letter to the {Editor}: On Spelling Correction and Beyond
@Article{Dunlavey:1981:LES,
author = "Michael R. Dunlavey",
title = "Letter to the {Editor}: On Spelling Correction and
Beyond",
journal = jCACM,
volume = "24",
number = "9",
pages = "608608",
month = sep,
year = "1981",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sun Feb 04 16:48:13 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/spell.bib",
note = "See
\cite{Peterson:1980:CPD,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}9 11:15:56 MST 2010",
bibsource = "http://bstj.belllabs.com/oldfiles/year.1981/BSTJ.1981.6009.html;
http://www.alcatellucent.com/bstj/vol601981/bstjvol60issue09.html;
http://www.math.utah.edu/pub/tex/bib/bstj1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://bstj.belllabs.com/BSTJ/images/Vol60/bstj6092167.pdf;
http://www.alcatellucent.com/bstj/vol601981/articles/bstj6092167.pdf",
acknowledgement = acknhfb,
fjournal = "The Bell System Technical Journal",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)15387305/issues/",
}–
.
9
7j.…}‹}
@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",
}0†;Œw
@PhdThesis{Sayano:1992:ACC,
author = "Masahiro Sayano",
title = "Analyses of coding and compression strategies for data
storage and transmission",
type = "{Ph.D.} thesis",
school = "California Institute of Technology",
address = "Pasadena, CA, USA",
pages = "121",
year = "1992",
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/303987736",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertationthesisnumber = "9232221",
subject = "Electrical engineering; Computer science",
}>…K‹
@PhdThesis{Sandman:1989:EPA,
author = "Aubrey Max Sandman",
title = "Errors  a Positive Approach (Polynomial Data
Compression)",
type = "{Ph.D.} thesis",
school = "The City University",
address = "London, UK",
pages = "187",
year = "1989",
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/303820371",
acknowledgement = acknhfb,
classification = "0790: Systems design",
dissertationthesisnumber = "DX92220",
subject = "Systems design",
}C†Œ
@PhdThesis{Rubinstein:1988:SCC,
author = "Roy Steven Rubinstein",
title = "Structural complexity classes of sparse sets:
Intractability, data compression and printability",
type = "{Ph.D.} thesis",
school = "Northeastern University",
address = "Boston, MA, USA",
pages = "79",
year = "1988",
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/303720650",
acknowledgement = acknhfb,
classification = "0984: Computer science",
dissertationthesisnumber = "8904853",
subject = "Computer science",
}(…E‹
@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",
}
ê
ˆê‹V33SS;57E};[SS9 articledatacompression.bibKrichevsky:1981:PUCR. E. Krichevsky and V. K. TrofimovThe Performance of Universal CodingjIEEETRANSINFTHEORYIT27199207mar31981IETTAW00189448 (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 TheoryackdsR. E. Krichevsky and V. K. TrofimovThe Performance of Universal Coding
@Article{Krichevsky:1981:PUC,
author = "R. E. Krichevsky and V. K. Trofimov",
title = "The Performance of Universal Coding",
journal = jIEEETRANSINFTHEORY,
volume = "IT27",
pages = "199207",
month = mar,
year = "1981",
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 = "Krichevsky, R. E., and V. K. Trofimov (1981) ``The
Performance of Universal Coding,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT27}:199207, March.",
}ŠtX 3')G%=3C7;e9)GŒ)phdthesisdatacompression.bibFong:1981:DOAChungBin FongThe Decision Oriented Approach to InformationPreserving Data Compression of Digitized ImagesPh.D. thesisUniversity of PittsburghPittsburgh, PA, USA1471981Fri 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/303140921Electrical engineeringacknhfbChungBin FongThe Decision Oriented Approach to InformationPreserving Data Compression of Digitized Images
@PhdThesis{Fong:1981:DOA,
author = "ChungBin Fong",
title = "The Decision Oriented Approach to
InformationPreserving Data Compression of Digitized
Images",
type = "{Ph.D.} thesis",
school = "University of Pittsburgh",
address = "Pittsburgh, PA, USA",
pages = "147",
year = "1981",
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/303140921",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8214505",
subject = "Electrical engineering",
}
÷
÷ŠX 3%%%97C7;e9%‹Gphdthesisdatacompression.bibLee:1981:DCSDong Hee LeeData Compression with Source Coding for Unknown Source StatisticsPh.D. thesisUniversity of MarylandCollege Park, MD, USA861981Fri 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/303164012Electrical engineeringacknhfbDong Hee LeeData Compression with Source Coding for Unknown Source Statistics
@PhdThesis{Lee:1981:DCS,
author = "Dong Hee Lee",
title = "Data Compression with Source Coding for Unknown Source
Statistics",
type = "{Ph.D.} thesis",
school = "University of Maryland",
address = "College Park, MD, USA",
pages = "86",
year = "1981",
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/303164012",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8205240",
subject = "Electrical engineering",
}‹V3U}/57E};SU}Ž;
articledatacompression.bibLangdon:1981:CBWGlen G. Langdon and ~and J. RissanenCompression of Black White Images with Arithmetic CodingjIEEETRANSCOMMCOM296858867jun61981IECMBT00906778 (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 CommunicationsackdsGlen G. Langdon and ~and J. RissanenCompression of Black White Images with Arithmetic Coding
@Article{Langdon:1981:CBW,
author = "Glen G. Langdon and ~and J. Rissanen",
title = "Compression of Black White Images with Arithmetic
Coding",
journal = jIEEETRANSCOMM,
volume = "COM29",
number = "6",
pages = "858867",
month = jun,
year = "1981",
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 = "Langdon, Glen G.,~and J. Rissanen (1981) ``Compression
of Black White Images with Arithmetic Coding,'' {\it
IEEE Transactions on Communications}, {\bf
COM29}(6):858867, June.",
}
\
P\pY 3++{57=‚C;%?c+)Ž[articledatacompression.bibMiller:1981:LESLance A. MillerLetter to the Editor: On Spelling Correction and BeyondjCACM249608609sep91981CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Sun Feb 04 16:49:22 1996http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib1996.02.04 16:49:22 ???See cite Peterson:1980:CPD,Dunlavey:1981:LES,Nix:1981:ESE,Peterson:1981:LES.Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Lance A. MillerSee \cite{Peterson:1980:CPD,Dunlavey:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.Letter to the {Editor}: On Spelling Correction and Beyond
@Article{Miller:1981:LES,
author = "Lance A. Miller",
title = "Letter to the {Editor}: On Spelling Correction and
Beyond",
journal = jCACM,
volume = "24",
number = "9",
pages = "608609",
month = sep,
year = "1981",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sun Feb 04 16:49:22 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/spell.bib",
note = "See
\cite{Peterson:1980:CPD,Dunlavey:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}‹,X'3)WE‚A;sWŒq
inproceedingsdatacompression.bibLynch:1981:ADCClifford A. Lynch and E. B. BrownriggApplication of Data Compression to a Large Bibliographic Data BaseZaniolo:1981:VLD4354471981Fri Jan 12 07:50:27 MST 2001http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/vldb.bib; http://www.vldb.org/dblp/db/conf/vldb/vldb81.html2001.01.12 07:50:27 MSThttp://www.vldb.org/dblp/db/conf/vldb/LynchB81.htmlacknhfbClifford A. Lynch and E. B. BrownriggApplication of Data Compression to a Large Bibliographic Data Base
@InProceedings{Lynch:1981:ADC,
author = "Clifford A. Lynch and E. B. Brownrigg",
title = "Application of Data Compression to a Large
Bibliographic Data Base",
crossref = "Zaniolo:1981:VLD",
pages = "435447",
year = "1981",
bibdate = "Fri Jan 12 07:50:27 MST 2001",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/vldb.bib;
http://www.vldb.org/dblp/db/conf/vldb/vldb81.html",
URL = "http://www.vldb.org/dblp/db/conf/vldb/LynchB81.html",
acknowledgement = acknhfb,
authorurl = "http://www.vldb.org/dblp/db/indices/atree/l/Lynch:Clifford_A=.html;
http://www.vldb.org/dblp/db/indices/atree/b/Brownrigg:E=_B=.html",
}
"ó
3âŒ;˜w
@Article{Storer:1997:ERO,
author = "James A. Storer and John H. Reif",
title = "ErrorResilient Optimal Data Compression",
journal = jSIAMJCOMPUT,
volume = "26",
number = "4",
pages = "934949",
month = aug,
year = "1997",
CODEN = "SMJCAT",
DOI = "http://dx.doi.org/10.1137/S0097539792240789",
ISSN = "00975397 (print), 10957111 (electronic)",
ISSNL = "00975397",
MRcl¬“%¦K
@Article{Storer:1991:PAH,
author = "James A. Storer and John H. Reif",
title = "A parallel architecture for highspeed data
compression",
journal = jJPARDISTCOMP,
volume = "13",
number = "2",
pages = "222227",
month = oct,
year = "1991",
CODEN = "JPDCER",
ISSN = "07437315 (print), 10960848 (electronic)",
ISSNL = "07437315",
bibdate = "Sat Apr 12 19:06:3"Š”
@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.uÙ†O
@Article{Stout:1980:IPE,
author = "Quentin F. Stout",
title = "Improved Prefix Encodings of the Natural Numbers",
journal = jIEEETRANSINFTHEORY,
volume = "26",
number = "5",
pages = "607609",
month = sep,
year = "1980",
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 = "Stout, Quentin F. (1980) ``Improved Prefix Encodings
of the Natural Numbers,'' {\it IEEE Transactions on
Information Theory}, {\bf26}(5):607609, September.",
}‘ŒS™'
@Article{Storer:1997:LIC,
author = "James A. Storer and Harald Helfgott",
title = "Lossless Image Compression by Block Matching",
journal = jCOMPJ,
volume = "40",
number = "23",
pages = "137145",
month = "????",
year = "1997",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/40.2_and_3.137",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "0010462®Š`•A
@Article{Stollnitz:1995:WCGa,
author = "Eric J. Stollnitz and Tony D. DeRose and David H.
Salesin",
title = "Wavelets for Computer Graphics: a Primer, Part 1",
journal = jIEEECGA,
volume = "15",
number = "3",
pages = "7684",
month = may,
year = "1995",
CODEN = "ICGADZ",
ISSN = "02721716 (print), 15581756 (electronic)",
ISSNL = "02721716",
bibdate = "Sat J¨‰=’{
@Article{Storer:1982:DCT,
author = "James A. Storer and Thomas G. Szymanski",
title = "Data Compression via Textual Substitution",
journal = jJACM,
volume = "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 = "httÎ6 12:46:16 MST 2013",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm24.html#Nix81;
http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/spell.bib",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
mynote = "Computing Practices, Note",
oldlabel = "Nix81",
rawdata = "Nix, R. (1981) ``Experience With a Space Efficient Way
to Store a Dictionary,'' {\it Communications of the
ACM}, {\bf24}(5):297298.",
remark = "Comment on \cite{Peterson:1981:LES}",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Nix81",
}
ÒÒ’*Y 3%'[57E„C;?Oc'–yarticledatacompression.bibNix:1981:ESERobert P. NixExperience With a Space Efficient Way to Store a DictionaryjCACM2452972981981CACMA2http://dx.doi.org/10.1145/358645.35865400010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Sat Jan 26 12:46:16 MST 2013http://dblp.unitrier.de/db/journals/cacm/cacm24.html#Nix81; http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib2013.01.26 12:46:16 MSTCommunications of the ACMComment on cite Peterson:1981:LESackdshttp://portal.acm.org/browse_dl.cfm?idx=J79Robert P. NixExperience With a Space Efficient Way to Store a Dictionary
@Article{Nix:1981:ESE,
author = "Robert P. Nix",
title = "Experience With a Space Efficient Way to Store a
Dictionary",
journal = jCACM,
volume = "24",
number = "5",
pages = "297298",
year = "1981",
CODEN = "CACMA2",
DOI = "http://dx.doi.org/10.1145/358645.358654",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm24.html#Nix81;
http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/spell.bib",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
mynote = "Computing Practices, Note",
oldlabel = "Nix81",
rawdata = "Nix, R. (1981) ``Experience With a Space Efficient Way
to Store a Dictionary,'' {\it Communications of the
ACM}, {\bf24}(5):297298.",
remark = "Comment on \cite{Peterson:1981:LES}",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Nix81",
}
¼ ¼ŠIV 3/)a!57E};)aŒKarticledatacompression.bibReghbati:1981:ODCH. K. ReghbatiAn Overview of Data Compression TechniquesjCOMPUTER14471761981CPTRB400189162 (print), 15580814 (electronic) OR 00189162 (print), 15580814 (electronic)00189162 OR 00189162Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTComputerackdshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2H. K. ReghbatiAn Overview of Data Compression Techniques
@Article{Reghbati:1981:ODC,
author = "H. K. Reghbati",
title = "An Overview of Data Compression Techniques",
journal = jCOMPUTER,
volume = "14",
number = "4",
pages = "7176",
year = "1981",
CODEN = "CPTRB4",
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/datacompression.bib",
acknowledgement = ackds,
fjournal = "Computer",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
rawdata = "Reghbati, H. K. (1981) ``An Overview of Data
Compression Techniques,'' {\it IEEE Computer},
{\bf14}(4):7176.",
}sY 3//{57=‚C;!?c/%Ž_articledatacompression.bibPeterson:1981:LESJames L. PetersonLetter to the Editor: On Spelling Correction and BeyondjCACM249609609sep91981CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Sun Feb 04 16:49:21 1996http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib1996.02.04 16:49:21 ???See cite Peterson:1980:CPD,Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE.Communications of the ACMacknhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79James L. PetersonSee \cite{Peterson:1980:CPD,Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE}.Letter to the {Editor}: On Spelling Correction and Beyond
@Article{Peterson:1981:LES,
author = "James L. Peterson",
title = "Letter to the {Editor}: On Spelling Correction and
Beyond",
journal = jCACM,
volume = "24",
number = "9",
pages = "609609",
month = sep,
year = "1981",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sun Feb 04 16:49:21 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/spell.bib",
note = "See
\cite{Peterson:1980:CPD,Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE}.",
acknowledgement = acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}cm/cacm24.html#RobinsonS81;
http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/spell.bib",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
mynote = "Computing Practices, Note",
oldlabel = "RobinsonS81",
rawdata = "Robinson, P. and D. Singer (1981) ``Another Spelling
Correction Program,'' {\it Communications of the ACM},
{\bf24}(5):296297.",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RobinsonS81",
}
˜˜d W3/IS57E„O;?cIS•articledatacompression.bibRobinson:1981:ASCP. J. Robinson and Dave SingerAnother Spelling Correction ProgramjCACM2452962971981CACMA200010782 (print), 15577317 (electronic) OR 00010782 (print), 15577317 (electronic)00010782 OR 00010782Sat Jan 26 12:46:16 MST 2013http://dblp.unitrier.de/db/journals/cacm/cacm24.html#RobinsonS81; http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib2013.01.26 12:46:16 MSTCommunications of the ACMackdshttp://portal.acm.org/browse_dl.cfm?idx=J79P. J. Robinson and Dave SingerAnother Spelling Correction Program
@Article{Robinson:1981:ASC,
author = "P. J. Robinson and Dave Singer",
title = "Another Spelling Correction Program",
journal = jCACM,
volume = "24",
number = "5",
pages = "296297",
year = "1981",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://dblp.unitrier.de/db/journals/cacm/cacm24.html#RobinsonS81;
http://www.math.utah.edu/pub/bibnet/subjects/accstabnumalg.bib;
http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/spell.bib",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
mynote = "Computing Practices, Note",
oldlabel = "RobinsonS81",
rawdata = "Robinson, P. and D. Singer (1981) ``Another Spelling
Correction Program,'' {\it Communications of the ACM},
{\bf24}(5):296297.",
XMLdata = "ftp://ftp.informatik.unitrier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RobinsonS81",
}12:46:16 MST 2013",
bibsource = "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",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
rawdata = "Rodeh, Michael, Vaughan R. Pratt and Shimon Even
(1981) ``Linear Algorithm for Data Compression via
String Matching,'' Journal of the ACM,
{\bf28}(1):1624, January.",
}¡
ÙkÙ‰"V 37=%3/C7;e97=Šaphdthesisdatacompression.bibStewart:1981:TDCLawrence Colm StewartTrellis Data CompressionPh.D. thesisStanford UniversityStanford, CA, USA1371981Fri 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/303177936Electrical engineeringacknhfbLawrence Colm StewartTrellis Data Compression
@PhdThesis{Stewart:1981:TDC,
author = "Lawrence Colm Stewart",
title = "Trellis Data Compression",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "137",
year = "1981",
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/303177936",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8124158",
subject = "Electrical engineering",
}!W3)q57E‚Q;qeq’ articledatacompression.bibRodeh:1981:LADMichael Rodeh and Vaughan R. Pratt and Shimon EvenLinear Algorithm for Data Compression via String MatchingjJACM2811624jan11981JACOAH00045411 (print), 1557735X (electronic) OR 00045411 (print), 1557735X (electronic)00045411 OR 00045411Sat Jan 26 12:46:16 MST 2013ftp://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.bib2013.01.26 12:46:16 MSTJournal of the Association for Computing Machineryackdshttp://portal.acm.org/browse_dl.cfm?idx=J401Michael Rodeh and Vaughan R. Pratt and Shimon EvenLinear Algorithm for Data Compression via String Matching
@Article{Rodeh:1981:LAD,
author = "Michael Rodeh and Vaughan R. Pratt and Shimon Even",
title = "Linear Algorithm for Data Compression via String
Matching",
journal = jJACM,
volume = "28",
number = "1",
pages = "1624",
month = jan,
year = "1981",
CODEN = "JACOAH",
ISSN = "00045411 (print), 1557735X (electronic)",
ISSNL = "00045411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "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",
acknowledgement = ackds # " and " # acknhfb,
fjournal = "Journal of the Association for Computing Machinery",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
rawdata = "Rodeh, Michael, Vaughan R. Pratt and Shimon Even
(1981) ``Linear Algorithm for Data Compression via
String Matching,'' Journal of the ACM,
{\bf28}(1):1624, January.",
}
Ï
ÛŸ®Ï¥S&[3)q57E‚ ;s]‚}sq¢Sarticledatacompression.bibIshii:1982:HEDAtsushi Ishii and Kenji Kouno and Yasunori MaezawaHighly Efficient Data Compression Method for Newspaper Image DatajFUJITSUSCITECHJV 18N 2199225jun61982FUSTA400162523 OR 00162523Mon 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 MSTA highly efficient image data compression unit is considered which reduces data file size and data transfer time in computerized typesetting systems. In a study of the correlation between picture elements, it is found that in the prÇ¡%[3'?a_57C„S;‰35ƒY[O#?e¥Qarticledatacompression.bibBell:1982:KSCD. A. Bell and S. M. DeenKey Space Compression and Hashing in PRECIjCOMPJ254486492nov111982CMPJA6http://dx.doi.org/10.1093/comjnl/25.4.48600104620 (print), 14602067 (electronic) OR 00104620 (print), 14602067 (electronic)00104620 OR 00104620Tue Dec 4 14:48:13 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/25/4.toc; http://www.mÄŠ8$Y 3131a9E5;7‹¿bookdatacompression.bibAnonymous:1982:DCHAnonymousData compression hardware and software market: Data compression products in the U.SFrost and Sullivan106 Fulton Strett, New York 10038, NY, USAvii + 184may51982HD9696.D383 U6316 1982Mon 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 MSTData transmission equipment industry; United States; Market surveysacknhfbAnonymousData compression hardware and software market: Data compression products in the {U.S}
@Book{Anonymous:1982:DCH,
author = "Anonymous",
title = "Data compression hardware and software market: Data
compression products in the {U.S}",
publisher = "Frost and Sullivan",
address = "106 Fulton Strett, New York 10038, NY, USA",
pages = "vii + 184",
month = may,
year = "1982",
LCCN = "HD9696.D383 U6316 1982",
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",
acknowledgement = acknhfb,
subject = "Data transmission equipment industry; United States;
Market surveys",
}Š!#V 3)Oy%/;C7;e9Oy‹[phdthesisdatacompression.bibYazdi:1981:ELDMohammad Ali Jezu Tabatabai YazdiEdge Location and Data Compression for Digital ImageryPh.D. thesisPurdue UniversityWest Lafayette, IN, USA1781981Fri 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/303174746Electrical engineeringacknhfbMohammad Ali Jezu Tabatabai YazdiEdge Location and Data Compression for Digital Imagery
@PhdThesis{Yazdi:1981:ELD,
author = "Mohammad Ali Jezu Tabatabai Yazdi",
title = "Edge Location and Data Compression for Digital
Imagery",
type = "{Ph.D.} thesis",
school = "Purdue University",
address = "West Lafayette, IN, USA",
pages = "178",
year = "1981",
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/303174746",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8210265",
subject = "Electrical engineering",
}e Dec 4 14:48:13 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/25/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_25/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/25/4/486.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/486.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/487.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/488.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/489.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/490.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/491.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/492.tif",
acknowledgement = acknhfb,
classcodes = "C6120 (File organisation); C6130 (Data handling
techniques); C6160 (Database management systems
(DBMS))",
classification = "723",
corpsource = "School of Computer Sci., Ulster Polytech.,
Newtonabbey, UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "data handling; data processing; database designer's;
database management systems; DBMS; direct access
performance; hash trees; hashing; key; PRECI;
sequential access; space compression; storage; table
lookup; toolkit; utilization",
treatment = "P Practical",
}¥
¶¥
j”{¶‰s“g
@Article{Deorowicz:2002:SSA,
author = "Sebastian Deorowicz",
title = "Second step algorithms in the {BurrowsWheeler}
compression algorithm",
journal = jSPE,
volume = "32",
number = "2",
pages = "99111",
month = feb,
year = "2002",
CODEN = "SPEXBL",
DOI = "http://dx.doi.org/10.1002/spe.426",
ISSN = "00380644 (print), 1097024X (electronic)",
ISSNL = "00‚˜h±Q
@Article{Deligiannis:2014:PRW,
author = "Nikos Deligiannis and Frederik Verbist and J{\"u}rgen
Slowack and Rik van de Walle and Peter Schelkens and
Adrian Munteanu",
title = "Progressively refined {WynerZiv} video coding for
visual sensors",
journal = jTOSN,
volume = "10",
number = "2",
pages = "21:121:??",
month = jan,
year = "2014",
CODEN = "????"
‡eK
@Article{Deng:2012:VIA,
author = "Aidong Deng and Jianeng Tang and Li Zhao and Cairong
Zou",
title = "The variableinterval arithmetic coding using
asymptotic deterministic randomness for data
compression and encryption",
journal = jJSTATCOMPUTSIMUL,
volume = "82",
number = "10",
pages = "15451555",
year = "2012",
CODEN = "JSCSAJ",
DOI = "http://dx.doi.org/10.1080/00949655.2011.587423",
ISSN = "00949655 (print), 10267778 (electronic), 15635163",
ISSNL = "00949655",
bibdate = "Tue Apr 22 09:13:07 MDT 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib",
acknowledgement = acknhfb,
fjournal = "Journal of Statistical Computation and Simulation",
journalURL = "http://www.tandfonline.com/loi/gscs20",
}™Š)”S
@Article{Deorowicz:2000:IBW,
author = "Sebastian Deorowicz",
title = "Improvements to {BurrowsWheeler} compression
algorithm",
journal = jSPE,
volume = "30",
number = "13",
pages = "14651483",
day = "10",
month = nov,
year = "2000",
CODEN = "SPEXBL",
DOI = "http://dx.doi.org/10.1002/1097024X(20001110)30:13<1465::AIDSPE345>3.0.CO;2D",
ISSN = "00380Ø‡%ŽK
@Article{Deng:2012:OAC,
author = "Xi Deng and Yuanyuan Yang",
title = "Online Adaptive Compression in Delay Sensitive
Wireless Sensor Networks",
journal = jIEEETRANSCOMPUT,
volume = "61",
number = "10",
pages = "14291442",
month = oct,
year = "2012",
CODEN = "ITCOB4",
DOI = "http://dx.doi.org/10.1109/TC.2011.174",
ISSN = "00189340 (print), 15579956 (electronic)",
ISSNL = "00189340",
bibdate = "Wed Aug 29 17:46:04 2012",
bibsource = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = acknhfb,
fjournal = "IEEE Transactions on Computers",
journalURL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}˜Š5”k
@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",øath.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_25/Issue_04/2012.12.04 14:48:13 MSThttp://comjnl.oxfordjournals.org/content/25/4/486.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/486.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/487.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/488.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/489.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/490.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/491.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/492.tifThe Computer Journaldata handling; data processing; database designer's; database management systems; DBMS; direct access performance; hash trees; hashing; key; PRECI; sequential access; space compression; storage; table lookup; toolkit; utilizationacknhfbC6120 (File organisation); C6130 (Data handling techniques); C6160 (Database management systems (DBMS))School of Computer Sci., Ulster Polytech., Newtonabbey, UKhttp://comjnl.oxfordjournals.org/P PracticalD. A. Bell and S. M. DeenKey Space Compression and Hashing in {PRECI}
@Article{Bell:1982:KSC,
author = "D. A. Bell and S. M. Deen",
title = "Key Space Compression and Hashing in {PRECI}",
journal = jCOMPJ,
volume = "25",
number = "4",
pages = "486492",
month = nov,
year = "1982",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/25.4.486",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
bibdate = "Tue Dec 4 14:48:13 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/25/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_25/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/25/4/486.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/486.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/487.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/488.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/489.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/490.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/491.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/492.tif",
acknowledgement = acknhfb,
classcodes = "C6120 (File organisation); C6130 (Data handling
techniques); C6160 (Database management systems
(DBMS))",
classification = "723",
corpsource = "School of Computer Sci., Ulster Polytech.,
Newtonabbey, UK",
fjournal = "The Computer Journal",
journalURL = "http://comjnl.oxfordjournals.org/",
keywords = "data handling; data processing; database designer's;
database management systems; DBMS; direct access
performance; hash trees; hashing; key; PRECI;
sequential access; space compression; storage; table
lookup; toolkit; utilization",
treatment = "P Practical",
} "Compendex database;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/typeset.bib",
abstract = "A highly efficient image data compression unit is
considered which reduces data file size and data
transfer time in computerized typesetting systems. In a
study of the correlation between picture elements, it
is found that in the predictive coding method, which
reduces redundancy in screen dot image data, the most
efficient reference picture elements were information
on three neighboring screen dots. Based on this
finding, an adaptive predictive split coding method is
developed which predicts and encodes screen dot image
data and character image data according to the most
adaptive reference picture elements. This coding method
utilizes a variable length control code system to
prevent reduction of the compression factor when
different kinds of data are used. It proves to be a
highly efficient compression method for encoding
fullpage, page segment, and character font data.",
acknowledgement = acknhfb,
classification = "731; 741; 745",
fjournal = "Fujitsu scientific and technical journal",
keywords = "adaptive predictive split coding; codes, symbolic;
control code; image processing; information theory 
data compression; screen dot image data; typesetting
 computer applications",
}¦
ñ
ž¯Ð¿ñ‡];
@Article{Liu:1991:RDC,
author = "Chengwen Liu and Clement Yu",
title = "Research: Data compression using word encoding with
{Huffman} code",
journal = jJAMSOCINFSCI,
volume = "42",
number = "9",
pages = "685698",
month = oct,
year = "1991",
CODEN = "AISJB6",
DOI = "http://dx.doi.org/10.1002/(SICI)10974571(199110)42:9<685::AIDASI7>3.0.CO%3B21",
ISSN = "00028231 (print), 10974571 (electronic)",
ISSNL = "00028231",
bibdate = "Fri Sep 11 09:03:47 MDT 2015",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jasis.bib",
acknowledgement = acknhfb,
fjournal = "Journal of the American Society for Information
Science",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)23301643",
onlinedate = "7 Jan 1999",
}¾3 i
@Article{Ling:1975:BOI,
author = "H. Ling and F. P. Palermo",
title = "BlockOriented 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;
baŸC
@Article{Lippert:1997:CDV,
author = "L. Lippert and M. H. Gross and C. Kurmann",
title = "Compression Domain Volume Rendering for Distributed
Environments",
journal = jCGF,
volume = "16",
number = "3",
pages = "C95C107",
day = "48",
month = sep,
year = "1997",
CODEN = "CGFODY",
ISSN = "01677055 (print), 14678659 (electronic)",
ISSNL = "01677055",
b ;
@Article{Lindley:1995:JLIb,
author = "Craig A. Lindley",
title = "{JPEGLike} Image Compression. Part 2",
journal = jDDJ,
volume = "20",
number = "8",
pages = "62, 6466, 102105",
month = aug,
year = "1995",
CODEN = "DDJOEB",
ISSN = "1044789X",
bibdate = "Tue Sep 03 09:16:52 1996",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
‹}Ÿ{
@Article{Lindley:1995:JLIa,
author = "Craig A. Lindley",
title = "{JPEG}like Image Compression. Part 1",
journal = jDDJ,
volume = "20",
number = "7",
pages = "50, 52, 5458",
month = jul,
year = "1995",
CODEN = "DDJOEB",
ISSN = "1044789X",
bibdate = "Tue Sep 03 09:16:51 1996",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
‰†qc
@Article{Liou:1991:OPK,
author = "Ming Liou",
title = "Overview of the p$ \times $ 64 kbits/s Video Coding
Standard",
journal = jCACM,
volume = "34",
number = "4",
pages = "5963",
month = apr,
year = "1991",
CODEN = "CACMA2",
ISSN = "00010782 (print), 15577317 (electronic)",
ISSNL = "00010782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Communications of the ACM",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
rawdata = "Liou, Ming (1991) ``Overview of the p$\times$64
kbits/s Video Coding Standard,'' {\it Communications of
the ACM}, {\bf34}(4):5963, April.",
}»edictive coding method, which reduces redundancy in screen dot image data, the most efficient reference picture elements were information on three neighboring screen dots. Based on this finding, an adaptive predictive split coding method is developed which predicts and encodes screen dot image data and character image data according to the most adaptive reference picture elements. This coding method utilizes a variable length control code system to prevent reduction of the compression factor when different kinds of data are used. It proves to be a highly efficient compression method for encoding fullpage, page segment, and character font data.Fujitsu scientific and technical journaladaptive predictive split coding; codes, symbolic; control code; image processing; information theory  data compression; screen dot image data; typesetting  computer applicationsacknhfbA highly efficient image data compression unit is considered which reduces data file size and data transfer time in computerized typesetting systems. In a study of the correlation between picture elements, it is found that in the predictive coding method, which reduces redundancy in screen dot image data, the most efficient reference picture elements were information on three neighboring screen dots. Based on this finding, an adaptive predictive split coding method is developed which predicts and encodes screen dot image data and character image data according to the most adaptive reference picture elements. This coding method utilizes a variable length control code system to prevent reduction of the compression factor when different kinds of data are used. It proves to be a highly efficient compression method for encoding fullpage, page segment, and character font data.Atsushi Ishii and Kenji Kouno and Yasunori MaezawaHighly Efficient Data Compression Method for Newspaper Image Data
@Article{Ishii:1982:HED,
author = "Atsushi Ishii and Kenji Kouno and Yasunori Maezawa",
title = "Highly Efficient Data Compression Method for Newspaper
Image Data",
journal = jFUJITSUSCITECHJ,
volume = "V 18",
number = "N 2",
pages = "199225",
month = jun,
year = "1982",
CODEN = "FUSTA4",
ISSN = "00162523",
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 = "A highly efficient image data compression unit is
considered which reduces data file size and data
transfer time in computerized typesetting systems. In a
study of the correlation between picture elements, it
is found that in the predictive coding method, which
reduces redundancy in screen dot image data, the most
efficient reference picture elements were information
on three neighboring screen dots. Based on this
finding, an adaptive predictive split coding method is
developed which predicts and encodes screen dot image
data and character image data according to the most
adaptive reference picture elements. This coding method
utilizes a variable length control code system to
prevent reduction of the compression factor when
different kinds of data are used. It proves to be a
highly efficient compression method for encoding
fullpage, page segment, and character font data.",
acknowledgement = acknhfb,
classification = "731; 741; 745",
fjournal = "Fujitsu scientific and technical journal",
keywords = "adaptive predictive split coding; codes, symbolic;
control code; image processing; information theory 
data compression; screen dot image data; typesetting
 computer applications",
}
€
ã€Ž_(X 335I+3CQOK1E‚;e)?I‘Ñbookdatacompression.bibMandelbrot:1982:FGNBenoit B. MandelbrotThe Fractal Geometry of NaturepubWHFREEMANpubWHFREEMAN:adrv + 46019820716711869 OR 07167118699780716711865 OR 9780716711865QA447 .M25 1982; QA447 .M357 198200A69 (5101 54F45 85A35 86A99)665254 (84h:00021)S. DubucSat Jan 26 12:46:16 MST 2013http://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 MSTSchriftenreihe fur den Referenten. [Series for the Referee]Revised edition of cite Mandelbrot:1977:FFC.Zbl 0504.28001ackdsBeno{\^\i}t B. MandelbrotSchriftenreihe f{\"u}r den Referenten. [Series for the Referee]The Fractal Geometry of Nature
@Book{Mandelbrot:1982:FGN,
author = "Beno{\^\i}t B. Mandelbrot",
title = "The Fractal Geometry of Nature",
publisher = pubWHFREEMAN,
address = pubWHFREEMAN:adr,
pages = "v + 460",
year = "1982",
ISBN = "0716711869",
ISBN13 = "9780716711865",
LCCN = "QA447 .M25 1982; QA447 .M357 1982",
MRclass = "00A69 (5101 54F45 85A35 86A99)",
MRnumber = "665254 (84h:00021)",
MRreviewer = "S. Dubuc",
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",
note = "Schriftenreihe f{\"u}r den Referenten. [Series for the
Referee]",
ZMnumber = "Zbl 0504.28001",
acknowledgement = ackds # " and " # acknhfb,
rawdata = "Mandelbrot, B. (1982) {\it The Fractal Geometry of
Nature}, San Francisco, CA, W. H. Freeman.",
remark = "Revised edition of \cite{Mandelbrot:1977:FFC}.",
}Š'V 3)#O;57E};[#SŒ' articledatacompression.bibLloyd:1982:LSQS. P. LloydLeast Squares Quantization in PCMjIEEETRANSINFTHEORYIT28129137mar31982IETTAW00189448 (print), 15579654 (electronic) OR 00189448 (print), 15579654 (electronic)00189448 OR 00189448Sat Jan 26 12:46:12 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:12 MSTIEEE Transactions on Information TheoryackdsS. P. LloydLeast Squares Quantization in {PCM}
@Article{Lloyd:1982:LSQ,
author = "S. P. Lloyd",
title = "Least Squares Quantization in {PCM}",
journal = jIEEETRANSINFTHEORY,
volume = "IT28",
pages = "129137",
month = mar,
year = "1982",
CODEN = "IETTAW",
ISSN = "00189448 (print), 15579654 (electronic)",
ISSNL = "00189448",
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 Information Theory",
rawdata = "Lloyd, S. P. (1982) ``Least Squares Quantization in
PCM,'' {\it IEEE Transactions on Information Theory},
{\bf IT28}:129137, March.",
}S. Dubuc",
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",
note = "Schriftenreihe f{\"u}r den Referenten. [Series for the
Referee]",
ZMnumber = "Zbl 0504.28001",
acknowledgement = ackds # " and " # acknhfb,
rawdata = "Mandelbrot, B. (1982) {\it The Fractal Geometry of
Nature}, San Francisco, CA, W. H. Freeman.",
remark = "Revised edition of \cite{Mandelbrot:1977:FFC}.",
}¨
33
s"Õˆ$I
@Article{Said:1996:NFE,
author = "A. Said and W. A. Pearlman",
title = "A New Fast and Efficient Image Codec Based on Set
Partitioning in Hierarchical Trees",
journal = jIEEETRANSCIRCUITSSYSTVIDEOTECH,
volume = "6",
number = "6",
pages = "243250",
month = jun,
year = "1996",
CODEN = "ITCTEM",
ISSN = "10518215 (print), 15582205 (electronic)",
ISSNL = "1051821%†\9
@Article{Sadakane:1999:CDT,
author = "K. Sadakane and H. Imai",
title = "A Cooperative Distributed Text Database Management
Method Unifying Search and Compression Based on the
{BurrowsWheeler} Transformation",
journal = jLECTNOTESCOMPSCI,
volume = "1552",
pages = "434445",
y‡y
@Article{Ruiters:2009:AMR,
author = "Roland Ruiters and Reinhard Klein",
title = "Appearance Measurement and Rendering: {BTF}
Compression via Sparse Tensor Decomposition",
journal = jCGF,
volume = "28",
number = "4",
pages = "11811188",
month = jun,
year = "2009",
CODEN = "CGFODY",
DOI = "http://dx.doi.org/10.1111/j.14678659.2009.01495.x",
ISSN = "01677055 (prin }†O
@Article{Rytter:2003:ALZ,
author = "Wojciech Rytter",
title = "Application of {LempelZiv} factorization to the
approximation of grammarbased compression",
journal = jTHEORCOMPSCI,
volume = "302",
number = "13",
pages = "211222",
day = "13",
month = jun,
year = "2003",
CODEN = "TCSCDI",
ISSN = "03043975 (print), 18792294 (electronic)",
ISSNL = "03043975",
bibdate = "Wed Nov 5 08:45:40 MST 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
acknowledgement = acknhfb,
fjournal = "Theoretical Computer Science",
journalURL = "http://www.sciencedirect.com/science/journal/03043975",
})‡Ž9
@Article{Rytter:2002:ALZ,
author = "Wojciech Rytter",
title = "Application of {LempelZiv} Factorization to the
Approximation of GrammarBased Compression",
journal = jLECTNOTESCOMPSCI,
volume = "2373",
pages = "20??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Tue Sep 10 19:09:57 MDT 2002",
bibsource = "http://link.springerny.com/link/service/series/0558/tocs/t2373.htm;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springerny.com/link/service/series/0558/bibs/2373/23730020.htm;
http://link.springerny.com/link/service/series/0558/papers/2373/23730020.pdf",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}œˆ
@Article{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 = Aì‡
”ª¡ì„o‰_
@Article{Hlavac:1997:ANL,
author = "V. Hlavac and J. Fojtik",
title = "Adaptive Nonlinear Predictor for Lossless Image
Compression",
j^‰5’m
@Article{Hilbert:1891:SAL,
author = "D. Hilbert",
title = "{{\"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]",
journal = jMATHANN,
volume = "38",
n‡ Ž
@Article{Howard:1992:NML,
author = "Paul G. Howard and J. S. Vitter",
title = "New Methods for Lossless Image Compression Using
Arithmetic Coding",
journal = jINFOPROCMAN,
volume = "28",
number = "6",
pages = "765779",
year = "1992",
CODEN = "IPMADK",
ISSN = "03064573 (print), 18735371 (electronic)",
ISSNL = "03064573",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
fjournal = "Information Processing and Management",
rawdata = "Howard, Paul G., and J. S. Vitter (1992a) ``New
Methods for Lossless Image Compression Using Arithmetic
Coding,'' {\it Information Processing and Management},
{\bf28}(6):765779.",
}#•‡dI
@Article{Hoces:1996:MRB,
author = "Carlos Hoces",
title = "Media Reviews: a Broad Guide to Data Compression:
{{\em Introduction to Data Compression} by Khalid
Sayood (Morgan Kaufmann Publishers, 1995, 600 pp.,
\$64.95, ISBN 1558603468)}",
journal = jIEEEMULTIMEDIA,
volume = "3",
number = "3",
pages = "9192",
month = "Fall",
year = "1996",
CODEN = "IEMUE4",
ISSN = "1070986X (print), 19410166 (electronic)",
ISSNL = "1070986X",
bibdate = "Mon Jan 29 16:49:42 MST 2001",
bibsource = "http://www.computer.org/multimedia/mu1996/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
URL = "http://dlib.computer.org/mu/books/mu1996/pdf/u3090.pdf",
acknowledgement = acknhfb,
fjournal = "IEEE MultiMedia",
}^‰5’m
@Article{Hilbert:1891:SAL,
author = "D. Hilbert",
title = "{{\"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]",
journal = jMATHANN,
volume = "38",
pages = "459460",
year = "1891",
CODEN = "MAANA3",
ISSN = "00255831 (print), 14321807 (electronic)",
ISSNL = "00255831",
bibdate "†sg
@Article{Hautamaki:2012:RBC,
author = "Ville Hautam{\"a}ki",
title = "Review of {{\booktitle{A Concise Introduction to Data
Compression}} by David Salomon}",
journal = jSIGACT,
volume = "43",
number = "2",
pages = "910",
month = jun,
year = "2012",
CODEN = "SIGNDM",
DOI = "http://dx.doi.org/10.1145/2261417.2261420",
ISSN = "01635700 (print), 19435827 (electronic)",
ISSNL = "01635700",
bibdate = "Tue Nov 6 17:32:01 MST 2012",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = acknhfb,
fjournal = "ACM SIGACT News",
journalURL = "http://dl.acm.org/citation.cfm?id=J697",
}§
Q ¡QŒL*Y'3+=E%!E};=EŽwinproceedingsdatacompression.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 ProcessingAdaptive 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.",
}Œ[)W 31k57E‚e;?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/browse_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’Üø…b‹E
@PhdThesis{Elnahas:1984:DCA,
author = "Sharaf Eldin Elnahas",
title = "Data Compression with Applications to Digital
Radiology",
type = "{D.Sc.} thesis",
school = "Washington University",
address = "St. Louis, MO, USA",
pages = "162",
year = "1984",
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/303316909",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8524758",
subject = "Electrical engineering",
}»…4Šk
@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",
}7…C‹
@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",
}†;Œw
@PhdThesis{Chow:1996:SRC,
author = "James G. Chow",
title = "Successive refinement and the compression of
multidimensional data",
type = "{Ph.D.} thesis",
school = "Cornell University",
address = "Ithaca, NY, USA",
pages = "100",
year = "1996",
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/304303621",
acknowledgement = acknhfb,
advisor = "Jian Min Wang",
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertationthesisnumber = "9629624",
subject = "Electrical engineering; Computer science",
}õ†jU
@PhdThesis{Chen:1999:SDC,
author = "Xiao Chen",
title = "Study on Data Compression Coding in Multimedia
Communication",
type = "{D.Eng.} thesis",
school = "Huazhong (Central China) University of Science and
Technology",
address = "Huazhong, Peoples Republic of China",
year = "1999",
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/1027904819",
acknowledgement = acknhfb,
advisor = "Yao Ting Zhu and Guang Xi Zhu and Guang Xi",
classification = "9998: No UMI subject assigned",
dissertationthesisnumber = "H144800",
language = "Chinese",
subject = "No UMI subject assigned",
}Òp://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.",
}«
3ƒ3ŠL,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.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",
}Ž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 = "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.",
}
Í
‹?.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.26 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.",
}Œ/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/science/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",
}at 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.",
}¯
Ú qÚ0W3/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 = "Aviezri 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",
}/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 Transmission
@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.",
} 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",
}°
“H“‹v3X 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 Information 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.",
}‰72U 3[!7E};O[Œarticledatacompression.bibLangdon:1983:ARLGlenn G. LangdonAn Adaptive Run Length Coding AlgorithmjIBMTDB267B37833785dec121983IBMTAA00188689 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.",
}‰41V 3+']%G+C7;e9']Šphdthesisdatacompression.bibKurien:1983:PDCThomas KurienA Partitioned Data Compression AlgorithmPh.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",
}
""
¡Ã)²åˆ A
@Article{Ma:1996:MRB,
author = "KaiKuang Ma",
title = "Media Reviews: Block Truncation Coding in Perspective:
{{\em Image Data Compression: Block Truncation Coding},
by Belur V. Dasarathy (IEEE Computer Society Press,
1995, 284 pp., \$50 list, \$40 members, ISBN
08918668764)}",
journal = jIEEEMULTIMEDIA,
volume = "3",
number = "2",
pages = "8384",
month =
@Article{Marking:1990:DGI,
author = "Michael P. Marking",
title = "Decoding Group 3 Images",
journal = jCUJ,
volume = "8",
number = "6",
pages = "4554",
–$¬I
@Article{Manber:1997:TCS,
author = "Udi Manber",
ti‡Ž1
@Article{Mahapatra:2003:PAA,
author = "Nihar R. Mahapatra and Jiangjiang Liu and Krishnan
Sundaresan",
title = "The performance advantage of applying compression to
the memory system",
journal = jSIGPLAN,
volume = "38",
number = "2s",
pages = "8696",
month = feb,
year = "2003",
CODEN = "SINODQ",
ISSN = "03621340 (print), 15232867 (print), 15581160
(electronic)",
ISSNL = "03621340",
bibdate = "Thu May 15 12:23:14 MDT 2003",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
acknowledgement = acknhfb,
fjournal = "ACM SIGPLAN Notices",
journalURL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
}Žœ5
@Article{Maglo:2015:MCS,
author = "Adrien Maglo and Guillaume Lavou{\'e} and Florent
Dupont and C{\'e}line Hudelot",
title = "{$3$D} Mesh Compression: Survey, Comparisons, and
Emerging Trends",
journal = jCOMPSURV,
volume = "47",
number = "3",
pages = "44:144:??",
month = apr,
year = "2015",
CODEN = "CMSVAN",
DOI = "http://dx.doi.org/10.1145/2693443",
ISEC¡
@Article{Makinen:1989:ITA,
author = "E. M{\"a}kinen",
title = "On implementing two adaptive datacompression
schemes",
journal = jCOMPJ,
volume = "32",
number = "3",
pages = "238240",
month = jun,
year = "1989",
CODEN = "CMPJA6",
DOI = "http://dx.doi.org/10.1093/comjnl/32.3.238",
ISSN = "00104620 (print), 14602067 (electronic)",
ISSNL = "00104620",
,šY
@Article{Maa:1994:IEB,
author = "ChiaYiu Y. Maa",
title = "Identifying the Existence of Bar Codes in Compressed
Images",
journal = jCVGIPGMIP,
volume = "56",
number = "4",
pages = "352356",
month = jul,
year = "1994",
CODEN = "CGMPE5",
DOI = "http://dx.doi.org/10.1006/cgip.1994.1032",
ISSN = "10499652",
ISSNL = "10499652",
bibdate = "Wed Mar 8 †n_
@Article{Lynn:1969:QCC,
author = "Kenneth C. Lynn",
title = "A quantitative comparison of conventional information
compression techniques in dental literature",
journal = jAMDOC,
volume = "20",
number = "2",
pages = "149151",
month = apr,
year = "1969",
CODEN = "AMDOA7",
DOI = "http://dx.doi.org/10.1002/asi.4630200206",
ISSN = "0096946X",
ISSNL = "0096946X",
bibdate = "Fri Sep 11 06:21:31 MDT 2015",
bibsource = "http://www.math.utah.edu/pub/tex/bib/amdoc.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = acknhfb,
fjournal = "American Documentation",
journalURL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)23301643/",
onlinedate = "19 Apr 2007",
} 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",
}´
××À~Ö‡Ž5
@PhdThesis{Ginesta:1995:DHO,
author = "Xavier Ginesta",
title = "Design of highorder statistical models of an
information source and their application to data
compression",
type = "{Ph.D.} thesis",
school = "Polytechnic University",
addres…g‹Q
@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",
}K†Œ)
@PhdThesis{Fong:1981:DOA,
author = "ChungBin Fong",
title = "The Decision Oriented Approach to
InformationPreserving Data Compression of Digitized
Images",
type = "{Ph.D.} thesis",
school = "University of Pittsburgh",
address = "Pittsburgh, PA, USA",
pages = "147",
year = "1981",
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/303140921",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8214505",
subject = "Electrical engineering",
}—‡&ŽM
@PhdThesis{Gadallah:1991:DCT,
author = "M. E. Gadallah",
title = "Data Compression Techniques for Isolated and Connected
Word Recognition (Speech Signals, Template Matching)",
type = "{Ph.D.} thesis",
school = "Cranfield University",
address = "Cranfield, Bedfordshire MK43 0AL, UK",
pages = "301",
year = "1991",
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/303965529",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering; 0800: Artificial
intelligence; 0984: Computer science",
dissertationthesisnumber = "DX94719",
subject = "Computer science; Electrical engineering; Artificial
intelligence",
}š‡Ž
@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",
}Í
PPŠ5X 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: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",
}Ž{4Z '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. Nadim",
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",
}tah.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",
}¶
1
aM1 8!9‚žq
@Book{Khaled:2013:IAC,
editor = "Elleithy Khaled and Sobh Tarek",
booktitle = "Innovations and advances in computer, information,
systems sciences, and engineering",
title = "Innovations and advances in computer, information,
systems sciences, and engineering",
volume = "152",
publisher = pubSV,
address = pubSV:adr,
year = "2013",
DOI = "http://dx.doi.org/10.1007/9781461435358"‡iS
@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.",
}è†*ŒW
@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.",
}F„ˆ'
@Book{Kleijn:1995:SCS,
author = "W. B. Kleijn and K. K. Paliwal",
title = "Speech Coding and Synthesis",
publisher = pubELSEVIER,
address = pubELSEVIER:adr,
pages = "??",
year = "1995",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Kleijn, W. B., and K. K. Paliwal (1995) {\it Speech
Coding and Synthesis}, Elsevier, Amsterdam.",
}…„ˆ'
@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.",
}…Š;
@Book{Kay:1995:GFF,
author = "David C. Kay and John R. Levine",
title = "Graphics File Formats",
publisher = pubWINDCREST,
address = pubWINDCREST:adr,
edition = "Second",
pages = "xx + 476",
year = "1995",
ISBN = "0070340250",
ISBN13 = "9780070340251",
LCCN = "T385.K376 1995",
bibdate = "Sat Oct 10 12:44:04 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/master.bib",
price = "US\$29.95",
acknowledgement = acknhfb,
libnote = "Not yet in my library.",
}~
®‹$7X %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 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",
}N6X 3+%g57Ea;E‚}wG%g”articledatacompression.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",
}
é Ý\m ±¡Â
@Book{MacCormick:2012:NAC,
author = "John MacCormick",
title = "Nine algorithms that changed the future: the ingenious
ideas that drive today's computers",
publisher = pubPRINCETON,
address = pubPRINCETON:adr,
pages = "x + 2 + 219",
year = "2012",
ISBN = "0691147140 (hardcover), 0691158193 (paperback)",
ISBN13 = "9780691147147 (hardcover), 9780691158198
(paperback)"
Œ…K‹
@Book{Lopes:2012:ICS,
author = "Dorsey Lopes",
title = "Important concepts in signal processing, image
processing and data compression",
publisher = "University Publications",
address = "Delhi, India",
pages = "????",
year = "2012",
ISBN = "8132336046",
ISBN13 = "9788132336044",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:39 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = acknhfb,
subject = "Image processing; Signal processing; Data compression
(Computer science)",
}Àˆ/_
@Book{Li:1997:VDC,
editor = "Hua Harry Li and Shan Sun and Haluk Derin",
title = "Video data compression for multimedia computing:
statistically based and biologically inspired
techniques",
volume = "{SECS 378}",
publisher = pubKLUWER,
address = pubKLUWER:adr,
pages = "xvi + 421",
year = "1997",
ISBN = "0792397908",
ISBN13 = "9780792397908",
LCCN = "QA76.„‰
@Book{Lee:2008:VHV,
author = "J. B. Lee and H. Kalva",
title = "The {VC1} and {H.264} Video Compression Standards for
Broadband Video Services",
publisher = pubSV,
address = pubSV:adr,
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ackds,
rawdata = "Lee, J. B. and H. Kalva (2008) {\it The VC1 and H.264
Video Compression Standards for Broadband Video
Services}, New York, Springer Verlag.",
}
Ú†
Œ
@Book{Lange:2010:AP,
author = "Kenneth Lange",
title = "Applied probability",
publisher = "Springer Science+Business Media, LLC",
address = "New York, NY, USA",
edition = "Second",
pages = "xv + 436",
year = "2010",
DOI = "http://dx.doi.org/10.1007/9781441971654",
ISBN = "1441971653, 1441971645",
ISBN13 = "9781441971654, 9781441971647",
LCCN = "QA273 .L36 2010",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
series = "Springer texts in statistics.",
acknowledgement = acknhfb,
subject = "Probabilities",
}Ñ†Œ+
@Book{Lafe:2000:CAT,
author = "Olu Lafe",
title = "Cellular automata transforms: theory and applications
in multimedia compression, encryption and modeling",
volume = "MMSA16",
publisher = pubKLUWER,
address = pubKLUWER:adr,
pages = "xii + 177",
year = "2000",
ISBN = "0792378571",
ISBN13 = "9780792378570",
LCCN = "QA267.5.C45 L34 2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Multimedia systems and applications series",
acknowledgement = acknhfb,
keywords = "cellular automata",
}’
»
Ð»Ž9X3+K/57E};SK’Oarticledatacompression.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
String 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.",
}Š,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 2013http://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",
}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.",
}¹ "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,
}º
èëè‰;V 35{%71C7;e95{‹Ephdthesisdatacompression.bibElnahas:1984:DCASharaf Eldin ElnahasData Compression with Applications to Digital RadiologyD.Sc. thesisWashington UniversitySt. Louis, MO, USA1621984Fri 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/303316909Electrical engineeringacknhfbSharaf Eldin ElnahasData Compression with Applications to Digital Radiology
@PhdThesis{Elnahas:1984:DCA,
author = "Sharaf Eldin Elnahas",
title = "Data Compression with Applications to Digital
Radiology",
type = "{D.Sc.} thesis",
school = "Washington University",
address = "St. Louis, MO, USA",
pages = "162",
year = "1984",
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/303316909",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8524758",
subject = "Electrical engineering",
}”:\3!=};…Q5†!’miscdatacompression.bibEastman:1984:AMCWillard L. Eastman and Abraham Lempel and Jacob Ziv and Martin CohnApparatus and method for compressing data signals and restoring the signal3964027aug81984Thu Feb 14 10:33:02 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.14 10:33:02 ???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.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,
}
É™†wo
@PhdThesis{Spaan:2000:ERC,
author = "Franciscus Henricus Petrus Spaan",
title = "Error resilient compression of digital video data",
type = "Doctoral",
school = "Technische Universiteit Delft",
address = "Delft, The Netherlands",
pages = "157",
year = "2000",
ISBN = "909013218X",
ISBN13 = "9789090132181",
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/304672016",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertationthesisnumber = "C803360",
subject = "Electrical engineering; Computer science",
}Ã†.Œ]
@PhdThesis{Stauffer:1994:PHS,
author = "Lynn Marie Stauffer",
title = "Parallel and highspeed data compression",
type = "{Ph.D.} thesis",
school = "University of California, Irvine",
address = "Irvine, CA, USA",
pages = "113",
year = "1994",
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/304084505",
acknowledgement = acknhfb,
advisor = "Daniel S. Hirschberg",
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertationthesisnumber = "9500585",
subject = "Computer science; Electrical engineering",
}…6Šo
@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",
}*‡Ž7
@PhdThesis{Southard:1995:VQN,
author = "David Alan Southard",
title = "Vector quantization and nearest neighbor clustering
with applications to image compression and data
visualization",
type = "{Sc.D.} thesis",
school = "University of Massachusetts Lowell",
address = "Lowell, MA, USA",
pages = "169",
year = "1995",
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/304200450",
acknowledgement = acknhfb,
advisor = "Georges G. Grinstein",
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertationthesisnumber = "9612675",
subject = "Computer science; Electrical engineering",
}º…`‹A
@PhdThesis{Smith:1979:SPA,
author = "George Heavener Smith",
title = "Spectral Peak Amplitude Coding for Voice Data
Compression",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "101",
year = "1979",
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/302972664",
acknowledgement = acknhfb,
classification = "0544: Electrical engineering",
dissertationthesisnumber = "8002017",
subject = "Electrical engineering",
}†ISSNL = "00063835",
MRclass = "68R10 (68P05)",
MRnumber = "85b:68040",
bibdate = "Wed Jan 4 18:52:18 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=00063835&volume=24&issue=1;
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=24&issue=1&spage=19",
acknowledgement = acknhfb,
fjournal = "BIT (Nordisk tidskrift for informationsbehandling)",
journalURL = "http://link.springer.com/journal/10543",
}¼
·‹=V3/SM;57E};[SQMarticledatacompression.bibFerguson:1984:SSHT. J. Ferguson and J. H. RabinowitzSelfSynchronizing Huffman codesjIEEETRANSINFTHEORY304687693jul71984IETTAW00189448 (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 TheoryackdsT. J. Ferguson and J. H. RabinowitzSelfSynchronizing {Huffman} codes
@Article{Ferguson:1984:SSH,
author = "T. J. Ferguson and J. H. Rabinowitz",
title = "SelfSynchronizing {Huffman} codes",
journal = jIEEETRANSINFTHEORY,
volume = "30",
number = "4",
pages = "687693",
month = jul,
year = "1984",
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 = "Ferguson, T. J. and J. H. Rabinowitz (1984)
``SelfSynchronizing Huffman codes,'' {\it IEEE
Transactions on Information Theory},
{\bf30}(4):687693, July.",
}EU'3)CE'C};CE…w 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,
}ib/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",
}¿
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 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.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",
}
z`z‰bAW !3+
3+#E};+
Œ/techreportdatacompression.bibLangdon:1984:PVMGlen G. LangdonOn Parsing vs. MixedOrder Model Structures for Data CompressionIBM research reportRJ4163 (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.",
}‰@W 3%wE};{Šomiscdatacompression.bibISO:1984:IPSISOInformation Processing Systems  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.",
}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,
}Â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,
}
³]BY 3)3O1m/=c;3™#™%3O¬phdthesisdatacompression.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/fullcit/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 élife.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",
}Ã
A½AŠxDY 3))=};‚Y5)‚ŠI
miscdatacompression.bibWelch:1984:HSDTerry A. WelchHigh speed data compression and decompression apparatus and method1107aug81984Thu 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. 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,
}”?CZ 3)1Y=)57E‚#;k/ƒ7w5kY—i
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 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",
} "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}.",
}Åïah.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}.",
}
‡
œ‡ŒGY 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 MSTData 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)",
}†oFU3+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.",
}ÂWEY 3))o!57Ek;S)oÍarticledatacompression.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)00189162 OR 00189162Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/computer1980.bib; http://www.math.utî
°
U°‰!IU 3'![377E};g!_‹5articledatacompression.bibCole:1985:NPPA. J. ColeA Note on Peano Polygons and Gray 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.",
}‹'HY'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.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.",
}ibliography/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.",
}Ê
È
÷ ·ÈŒ}™{
@Article{Cheng:1996:FHR,
author = "J.M. Cheng and L. M. Duyanovich and D. J. Craft",
title = "A fast, highly reliable data compression chip and
algorithm for storage systems",
journal = jIBMJRD,
volume = "40",
number = "6",
pages = "603613",
month = nov,
year = "1996",
CODEN = "IBMJAE",
ISSN =‡re
@Article{Chen:2006:GCD,
author = "ChihChun Chen and JungHong Chuang",
title = "Geometry Compression and Decompression: Texture
Adaptation for Progressive Meshes",
journal = jCGF,
volume = "25",
number = "3",
pages = "343350",
month = sep,
year = "2006",
CODEN = "CGFODY",
DOI = "http://dx.doi.org/10.1111/j.14678659.2006.00953.x",
ISSN = "01677055 (print), 1467†`A
@Article{Chen:2005:TSC,
author = "Zhe Chen and David Dagan Feng and Weidong Cai",
title = "Temporal and Spatial Compression of Dynamic Positron
Emission Tomography in Sinogram Domain",
journal = jINTJIMAGEGRAPHICS,
volume = "5",
number = "4",
pages = "839??",
month = oct,
year = "2005",
CODEN = "????",
ISSN = "02194678",
bibdate = "Wed Aug 23 08:55:54 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = acknhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journalURL = "http://www.worldscientific.com/worldscinet/ijig",
}âˆ?
@Article{Chen:1999:MEF,
author = "HongChung Chen and YueLi Wang and YuFeng Lan",
title = "A memoryefficient and fast {Huffman} decoding
algorithm",
journal = jINFOPROCLETT,
volume = "69",
number = "3",
pages = "119122",
day = "12",
month = feb,
year = "1999",
CODEN = "IFPLAT",
ISSN = "00200190 (print), 18726119 (electronic)",
ISSNL = "00200190",
SŒ˜7
@Article{Chen:1996:ABPb,
author = "ICheng K. Chen and John T. Coffey and Trevor N.
Mudge",
title = "Analysis of Branch Prediction Via Data Compression",
journal = jSIGPLAN,
volume = "31",
number = "9",
pages = "128137",
month = sep,
year = "1996",
CODEN = "SINODQ",
ISBN = "0897917677",
ISBN13 = "9780897917674",
ISSN = "03621340 (print), 15232867 (Ó†Œ1
@Article{Chen:1996:ABPa,
author = "ICheng K. Chen and John T. Coffey and Trevor N.
Mudge",
title = "Analysis of branch prediction via data compression",
journal = jOPERSYSREV,
volume = "30",
number = "5",
pages = "128137",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "01635980 (print), 1943586X (electronic)",
ISSNL = "01635980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = acknhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
}î A
@Article{Chen:1994:CCI,
author = "YungSheng S. Chen and HungTien T. Yen and WenHsing
H. Hsu",
title = "Compression of Color Image via the Technique of
Surface Fitting",
journal = jCVGIPGMIP,
volume = "56",
number = "3",
pages = "272279",
month = may,
year = "1994",
CODEN = "CGMPE5",
DOI = "http://dx.doi.org/10.1006/cgip.1994.1024",
ISSN = "104ÝŒŸ” VŒŸ)ó‡gO
@Article{Jahnke:2010:SCM,
author = "Tobias Jahnke and Tudor Udrescu",
title = "Solving chemical master equations by adaptive wavelet
compression",
journal = jJCOMPUTPHYS,
volume = "229",
number = "16",
pages = "57245741",
day = "10",
month = aug,
year = "2010",
CODEN = "JCTPAH",
DOI = "http://dx.doi.org/10.1016/j.jcp.2010.04.015",
ISSN = "00219991 (print), 10902716 (electronic)",
ISSNL = "00219991",
bibdate = "Sat Dec 31 11:58:30 MST 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/jcomputphys2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0021999110001919",
acknowledgement = acknhfb,
fjournal = "Journal of Computational Physics",
journalURL = "http://www.sciencedirect.com/science/journal/00219991",
}Å…
Š
@Article{Kasperovich:1993:FDC,
author = "L. V. Kasperovich and V. F. Babkin",
title = "Fast Discrete Cosine Transform Approximatic“b§E
@Article{Jayant:1995:ACT,
author = "Nikil S. Jayant and Edward Y. Chen",
title = "Audio compression: technology and applications",
journal = jATTTECHJ,
volume = "74",
number = "2",
pages = "2334",
year = "1995",
CODEN = "ATJOEM",
ISSN = "87562324",
bibdate = "Fri Nov 12 13:11:10 2010",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/bstj1990.bib;
s:†wo
@Article{Kampf:1998:PFC,
author = "F. A. Kampf",
title = "Performance as a function of compression",
journal = jIBMJRD,
volume = "42",
number = "6",
pages = "759766",
month = "????",
year = "1998",
CODEN = "IBMJAE",
ISSN = "00188646 (print), 21518556 (electronic)",
ISSNL = "00188646",
bibdate = "Mon Feb 12 08:11:30 2001",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex†0Œa
@Article{Ilie:2006:SCS,
author = "Lucian Ilie and Cristian Popescu",
title = "The Shortest Common Superstring Problem and Viral
Genome Compression",
journal = jFUNDINFO,
volume = "73",
number = "12",
pages = "153164",
month = oct,
year = "2006",
CODEN = "FUMAAJ",
ISSN = "01692968 (print), 18758681 (electronic)",
ISSNL = "01692968",
bibdate = "Sat Mar 5 17:04:36 MST 2016",
bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = acknhfb,
fjournal = "Fundamenta Informaticae",
journalURL = "http://content.iospress.com/journals/fundamentainformaticae",
} º)†n]
@Article{Iwata:2002:LZC,
author = "Kazunori Iwata and Naohiro Ishii",
title = "{LempelZiv} Coding in Reinforcement Learning",
journal = jLECTNOTESCOMPSCI,
volume = "2412",
pages = "531??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "03029743 (print), 16113349 (electronic)",
ISSNL = "03029743",
bibdate = "Tue Sep 10 19:10:19 MDT 2002",
bibsource = "http://link.springerny.com/link/service/series/0558/tocs/t2412.htm;
http://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springerny.com/link/service/series/0558/bibs/2412/24120531.htm;
http://link.springerny.com/link/service/series/0558/papers/2412/24120531.pdf",
acknowledgement = acknhfb,
fjournal = "Lecture Notes in Computer Science",
}n
ÜÜ” J[ 3/W!57E„;?+‚!Ec/W–marticledatacompression.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/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/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.",
}ce = "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",
}Ë
®®žNKZ 335y57E%;;‰ƒ'yy]#5y¤Garticledatacompression.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; polyhedron; 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",
}
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.",
}Ì
È]ÈMX 3+7‚q%C7;e97‚uŽphdthesisdatacompression.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 Transmission 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",
}‘LZ3)m =)57E‚u;/wm ”karticledatacompression.bibDemko:1985:CFOStephen Demko and Laurie Hodges and 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.",
}
H ùH‹OX!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.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.",
}ŒNW%3/IAO!E};/IOAŽkincollectiondatacompression.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. Apostolico 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.",
}
Þ
ŠÞ‡(RW 3E};5ˆmiscdatacompression.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.''",
}¦yQ[39W]57E‚y;‚yqƒŒgKe3‚y[]ª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; algoý‹mPX '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 MSThttp://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",
} "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.",
}Ñrithms; computer 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.",
}835",
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.",
}Ó
††vSZ 31+)U57Eƒ;MqY+“yarticledatacompression.bibJakobsson: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.",
} "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",
}Ô