@Preamble{
"\input path.sty " #
"\ifx \undefined \booktitle \def \booktitle #1{{{\em #1}}} \fi" #
"\ifx \undefined \pkg \def \pkg #1{{{\tt #1}}} \fi"
}
@String{ack-ds = "David Salomon,
Professor Emeritus,
Department of Computer Science,
California State University, Northridge,
Northridge, CA 91330, USA"}
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|https://www.math.utah.edu/~beebe/|"}
@String{inst-CLSC = "College of Science Computer, University of
Utah"}
@String{inst-CLSC:adr = "Salt Lake City, UT 84112, USA"}
@String{j-ACM-J-EXP-ALGORITHMICS = "ACM Journal of Experimental Algorithmics"}
@String{j-ACTA-INFO = "Acta Informatica"}
@String{j-ADV-COMPUT-MATH = "Advances in Computational Mathematics"}
@String{j-ALGORITHMICA = "Algorithmica"}
@String{j-ALGORITHMS-BASEL = "Algorithms ({Basel})"}
@String{j-AM-DOC = "American Documentation"}
@String{j-AMER-MATH-MONTHLY = "American Mathematical Monthly"}
@String{j-ANN-MATH-STAT = "Annals of Mathematical Statistics"}
@String{j-ANN-PROBAB = "Annals of Probability"}
@String{j-APPL-MATH-COMP = "Applied Mathematics and Computation"}
@String{j-APPL-NUM-MATH = "Applied Numerical Mathematics: Transactions
of IMACS"}
@String{j-ATT-BELL-LAB-TECH-J = "AT\&T Bell Laboratories Technical Journal"}
@String{j-ATT-TECH-J = "AT\&T Technical Journal"}
@String{j-AUSTRALIAN-COMP-J = "Australian Computer Journal"}
@String{j-AUSTRALIAN-COMP-SCI-COMM = "Australian Computer Science
Communications"}
@String{j-BELL-SYST-TECH-J = "The Bell System Technical Journal"}
@String{j-BIT = "BIT (Nordisk tidskrift for
informationsbehandling)"}
@String{j-BULL-SOC-R-SCI-LIEGE = "Bulletin de la Soci{\'e}t{\'e} royale des
sciences de Li{\`e}ge"}
@String{j-BYTE = "Byte Magazine"}
@String{j-CACM = "Communications of the ACM"}
@String{j-CCCUJ = "C/C++ Users Journal"}
@String{j-CCPE = "Concurrency and Computation: Prac\-tice and
Experience"}
@String{j-CELL-SYST = "Cell Systems"}
@String{j-CGF = "Computer Graphics Forum"}
@String{j-CGIP = "Computer Graphics and Image Processing"}
@String{j-COMM-PURE-APPL-MATH = "Communications on Pure and Applied
Mathematics (New York)"}
@String{j-COMP-ARCH-NEWS = "ACM SIGARCH Computer Architecture News"}
@String{j-COMP-GRAPHICS = "Computer Graphics"}
@String{j-COMP-J = "The Computer Journal"}
@String{j-COMP-LANG-MAG = "Computer Language Magazine"}
@String{j-COMP-NET-AMSTERDAM = "Computer Networks (Amsterdam, Netherlands:
1999)"}
@String{j-COMP-PHYS-COMM = "Computer Physics Communications"}
@String{j-COMP-SURV = "ACM Computing Surveys"}
@String{j-COMP-SYS = "Computing systems: the journal of the
USENIX Association"}
@String{j-COMP-VIS-IMAGE-UNDERSTANDING = "Computer Vision and Image
Understanding: CVIU"}
@String{j-COMPUT-ANIM-VIRTUAL-WORLDS = "Computer Animation and Virtual Worlds"}
@String{j-COMPUT-MATH-APPL = "Computers and Mathematics with Applications"}
@String{j-COMPUT-MECH = "Computational mechanics"}
@String{j-COMPUT-SCI-ENG = "Computing in Science and Engineering"}
@String{j-COMPUT-SECUR = "Computers \& Security"}
@String{j-COMPUT-SOFTW-BIG-SCI = "Computing and Software for Big Science"}
@String{j-COMPUT-STAT-DATA-ANAL = "Computational Statistics \& Data Analysis"}
@String{j-COMPUT-SYST-SCI-ENG = "Computer Systems Science and Engineering"}
@String{j-COMPUTER = "Computer"}
@String{j-COMPUTERS-AND-GRAPHICS = "Computers and Graphics"}
@String{j-COMPUTING = "Computing: Archiv f{\"u}r informatik und
numerik"}
@String{j-CPE = "Concurrency: Prac\-tice and Experience"}
@String{j-CROSSROADS = "ACM Crossroads"}
@String{j-CRYPTOLOGIA = "Cryptologia"}
@String{j-CUJ = "C Users Journal"}
@String{j-CVGIP = "Computer Vision, Graphics, and Image
Processing"}
@String{j-CVGIP-GMIP = "Computer Vision, Graphics, and Image
Processing. Graphical Models and Image
Processing"}
@String{j-DATAMATION = "Datamation"}
@String{j-DDJ = "Dr. Dobb's Journal of Software Tools"}
@String{j-DEC-TECH-J = "Digital Technical Journal"}
@String{j-DESIGNS-CODES-CRYPTOGR = "Designs, Codes, and Cryptography"}
@String{j-DISCRETE-APPL-MATH = "Discrete Applied Mathematics"}
@String{j-ELECT-COMPOSITION-IMAGING = "Electronic Composition and Imaging"}
@String{j-EPODD = "Electronic
Pub\-lish\-ing\emdash{}Orig\-i\-na\-tion,
Dissemination, and Design"}
@String{j-ESAIM-PROBAB-STATIST = "ESAIM: Probability and Statistics"}
@String{j-FIB-QUART = "Fibonacci Quarterly"}
@String{j-FRACTALS = "Fractals"}
@String{j-FUJITSU-SCI-TECH-J = "Fujitsu scientific and technical journal"}
@String{j-FUND-INFO = "Fundamenta Informaticae"}
@String{j-FUT-GEN-COMP-SYS = "Future Generation Computer Systems"}
@String{j-FUTURE-INTERNET = "Future Internet"}
@String{j-GRAPH-MODELS = "Graphical Models"}
@String{j-GRAPH-MODELS-IMAGE-PROC = "Graphical models and image processing:
GMIP"}
@String{j-HEWLETT-PACKARD-J = "Hewlett--Packard Journal"}
@String{j-IBM-JRD = "IBM Journal of Research and Development"}
@String{j-IBM-SYS-J = "IBM Systems Journal"}
@String{j-IBM-TDB = "IBM Technical Disclosure Bulletin"}
@String{j-IEEE-ACM-TASLP = "IEEE\slash ACM Transactions on Audio, Speech,
and Language Processing"}
@String{j-IEEE-ANN-HIST-COMPUT = "IEEE Annals of the History of Computing"}
@String{j-IEEE-CGA = "IEEE Computer Graphics and Applications"}
@String{j-IEEE-COMPUT-ARCHIT-LETT = "IEEE Computer Architecture Letters"}
@String{j-IEEE-COMMUN-LET = "IEEE Communications Letters"}
@String{j-IEEE-J-SEL-AREAS-COMMUN = "IEEE Journal on Selected Areas in
Communications"}
@String{j-IEEE-MICRO = "IEEE Micro"}
@String{j-IEEE-MULTIMEDIA = "IEEE MultiMedia"}
@String{j-IEEE-SIGNAL-PROCESS-MAG = "IEEE signal processing magazine"}
@String{j-IEEE-SPECTRUM = "IEEE Spectrum"}
@String{j-IEEE-TRANS-BIG-DATA = "IEEE Transactions on Big Data"}
@String{j-IEEE-TRANS-BROADCAST = "IEEE Transactions on Broadcasting"}
@String{j-IEEE-TRANS-CIRCUITS-SYST-VIDEO-TECH = "IEEE Transactions on Circuits
and Systems for Video Technology"}
@String{j-IEEE-TRANS-COMM = "IEEE Transactions on Communications"}
@String{j-IEEE-TRANS-COMPUT = "IEEE Transactions on Computers"}
@String{j-IEEE-TRANS-IMAGE-PROCESS = "IEEE Transactions on Image Processing"}
@String{j-IEEE-TRANS-INF-THEORY = "IEEE Transactions on Information Theory"}
@String{j-IEEE-TRANS-NETWORKING = "IEEE\slash ACM Transactions on Networking"}
@String{j-IEEE-TRANS-PAR-DIST-SYS = "IEEE Transactions on Parallel and
Distributed Systems"}
@String{j-IEEE-TRANS-PATT-ANAL-MACH-INTEL = "IEEE Transactions on Pattern
Analysis and Machine Intelligence"}
@String{j-IEEE-TRANS-PROF-COMMUN = "IEEE Transactions on Professional
Communication"}
@String{j-IEEE-TRANS-SIG-PROC = "IEEE Transactions on Signal Processing"}
@String{j-IEEE-TRANS-SOFTW-ENG = "IEEE Transactions on Software Engineering"}
@String{j-IEEE-TRANS-VIS-COMPUT-GRAPH = "IEEE Transactions on Visualization
and Computer Graphics"}
@String{j-IEICE-TRANS-FUND-ELECT = "IEICE Transactions on Fundamentals of
Electronics Communications and Computer
Sciences"}
@String{j-IEICE-TRANS-FUND-ELECT= "IEICE Transactions on Fundamentals of
Electronics Communications and Computer
Sciences"}
@String{j-IJHPCA = "The International Journal of High
Performance Computing Applications"}
@String{j-IJQC = "International Journal of Quantum Chemistry"}
@String{j-IMAGE-VIDEO-PROCESS = "Image and Video Processing"}
@String{j-IMWUT = "Proceedings of the ACM on Interactive,
Mobile, Wearable and Ubiquitous
Technologies (IMWUT)"}
@String{j-INF-RETR = "Information Retrieval"}
@String{j-INFO-PROC-LETT = "Information Processing Letters"}
@String{j-INFO-PROC-MAN = "Information Processing and Management"}
@String{j-INFO-SCI = "Information Sciences"}
@String{j-INFOWORLD = "InfoWorld"}
@String{j-INT-J-COMP-PROC-ORIENTAL-LANG = "International Journal of Computer
Processing of Oriental Languages (IJCPOL)"}
@String{j-INT-J-COMPUT-APPL = "International Journal of Computer
Applications"}
@String{j-INT-J-COMPUT-INF-SCI = "International Journal of Computer and
Information Sciences"}
@String{j-INT-J-COMPUT-MATH = "International Journal of Computer
Mathematics"}
@String{j-INT-J-FOUND-COMP-SCI = "International Journal of Foundations of
Computer Science (IJFCS)"}
@String{j-INT-J-HIGH-SPEED-COMPUTING = "International Journal of High Speed
Computing (IJHSC)"}
@String{j-INT-J-IMAGE-GRAPHICS = "International Journal of Image and Graphics
(IJIG)"}
@String{j-INT-J-INFO-SEC = "International Journal of Information
Security"}
@String{j-INT-J-PAR-EMER-DIST-SYS = "International Journal of Parallel,
Emergent and Distributed Systems: IJPEDS"}
@String{j-INT-J-PARALLEL-PROG = "International Journal of Parallel
Programming"}
@String{j-INT-J-SOFTW-TOOLS-TECHNOL-TRANSFER = "International Journal on
Software Tools for Technology Transfer (STTT)"}
@String{j-INT-J-WAVELETS-MULTIRESOLUT-INF-PROCESS = "International Journal of
Wavelets, Multiresolution and
Information Processing"}
@String{j-INTERNET-MATH = "Internet Mathematics"}
@String{j-IRE-TRANS-ELEC-COMPUT = "IRE Transactions on Electronic Computers"}
@String{j-IRE-TRANS-INF-THEORY = "IRE Transactions on Information Theory"}
@String{j-J-ACM = "Journal of the ACM"}
@String{j-J-ALG = "Journal of Algorithms"}
@String{j-J-AM-SOC-INF-SCI = "Journal of the American Society for
Information Science"}
@String{j-J-AM-SOC-INF-SCI-TECHNOL = "Journal of the American Society for
Information Science and Technology: JASIST"}
@String{j-J-AM-STAT-ASSOC = "Journal of the American Statistical
Association"}
@String{j-J-AUDIO-ENG-SOC = "Journal of the Audio Engineering Society"}
@String{j-J-AUTOM-REASON = "Journal of Automated Reasoning"}
@String{j-J-COMP-SYS-SCI = "Journal of Computer and System Sciences"}
@String{j-J-COMPUT-APPL-MATH = "Journal of Computational and Applied
Mathematics"}
@String{j-J-COMPUT-BIOL = "Journal of Computational Biology"}
@String{j-J-COMPUT-CHEM = "Journal of Computational Chemistry"}
@String{j-J-COMPUT-PHYS = "Journal of Computational Physics"}
@String{j-J-CRYPTOLOGY = "Journal of Cryptology: the journal of the
International Association for Cryptologic
Research"}
@String{j-J-DISCR-MATH-SCI-CRYPTO = "Journal of Discrete Mathematical Sciences
and Cryptography"}
@String{j-J-ELECTRON-IMAGING = "Journal of Electronic Imaging"}
@String{j-J-GRAPHICS-TOOLS = "Journal of Graphics Tools: JGT"}
@String{j-J-GRID-COMP = "Journal of Grid Computing"}
@String{j-J-INFO-SCI-PRINCIPLES-PRACTICE = "Journal of Information Science,
Principles and Practice"}
@String{j-J-MATH-PHYS = "Journal of Mathematical Physics"}
@String{j-J-NETW-COMPUT-APPL = "Journal of Network and Computer
Applications"}
@String{j-J-OPT-SOC-AM = "Journal of the Optical Society of America"}
@String{j-J-PAR-DIST-COMP = "Journal of Parallel and Distributed
Computing"}
@String{j-J-SCI-COMPUT = "Journal of Scientific Computing"}
@String{j-J-SIAM = "Journal of the Society for Industrial and
Applied Mathematics"}
@String{j-J-STAT-COMPUT-SIMUL = "Journal of Statistical Computation and
Simulation"}
@String{j-J-SUPERCOMPUTING = "The Journal of Supercomputing"}
@String{j-J-SYST-SOFTW = "The Journal of Systems and Software"}
@String{j-J-THEOR-BIOL = "Journal of Theoretical Biology"}
@String{j-J-UCS = "J.UCS: The Journal of Universal Computer
Science"}
@String{j-J-VIS-COMMUN-IMAGE-REPRESENT = "Journal of Visual Communication and
Image Representation"}
@String{j-J-VIS-COMP-ANIMATION = "Journal of Visualization and Computer
Animation"}
@String{j-JDIQ = "Journal of Data and Information
Quality (JDIQ)"}
@String{j-JOCCH = "Journal on Computing and Cultural Heritage
(JOCCH)"}
@String{j-JOURNAL-Q = "Journalism Quarterly"}
@String{j-LECT-NOTES-COMP-SCI = "Lecture Notes in Computer Science"}
@String{j-LINEAR-ALGEBRA-APPL = "Linear Algebra and its Applications"}
@String{j-LINUX-J = "Linux Journal"}
@String{j-LOGIN = ";login: the USENIX Association newsletter"}
@String{j-MATH-ANN = "Mathematische Annalen"}
@String{j-MATH-COMPUT = "Mathematics of Computation"}
@String{j-MATH-COMPUT-SCI = "Mathematics in Computer Science"}
@String{j-MATH-INTEL = "The Mathematical Intelligencer"}
@String{j-MATH-MAG = "Mathematics Magazine"}
@String{j-MATHEMATICA-J = "Mathematica Journal"}
@String{j-MULTISCALE-MODELING-SIMUL = "Multiscale Modeling \& Simulation"}
@String{j-NAMS = "Notices of the {American Mathematical
Society}"}
@String{j-NATURE = "Nature"}
@String{j-NEW-ZEALAND-J-MATH = "{New Zealand} Journal of Mathematics"}
@String{j-NORDIC-J-COMPUT = "Nordic Journal of Computing"}
@String{j-NUMER-ALGORITHMS = "Numerical Algorithms"}
@String{j-NATURE = "Nature"}
@String{j-NUM-LIN-ALG-APPL = "Numerical Linear Algebra with Applications"}
@String{j-ONLINE = "Online"}
@String{j-OPER-SYS-REV = "Operating Systems Review"}
@String{j-OPTICAL-ENG = "Optical Engineering"}
@String{j-PARALLEL-COMPUTING = "Parallel Computing"}
@String{j-PARALLEL-DIST-COMP-PRACT = "PDCP: Parallel and Distributed Computing
Practices"}
@String{j-PARALLEL-PROCESS-LETT = "Parallel Processing Letters"}
@String{j-PHOTOGR-SCI-ENG = "Photographic Science and Engineering"}
@String{j-PROBAB-ENGRG-INFORM-SCI = "Probability in the Engineering and
Informational Sciences"}
@String{j-PROBAB-THEORY-RELAT-FIELDS = "Probability Theory and Related Fields"}
@String{j-PROC-IEEE = "Proceedings of the IEEE"}
@String{j-PROC-IRE = "Proceedings of the Institute of Radio
Engineers"}
@String{j-PROC-SPIE = "Proceedings of the SPIE --- The
International Society for Optical
Engineering"}
@String{j-PROC-VLDB-ENDOWMENT = "Proceedings of the VLDB Endowment"}
@String{j-REV-INST-INT-STATIST = "Revue de l'Institut international de
statistique = Review of the International
Statistical Institute"}
@String{j-SCI-AMER = "Scientific American"}
@String{j-SCI-COMPUT-PROGRAM = "Science of Computer Programming"}
@String{j-SCI-PROG = "Scientific Programming"}
@String{j-SIAM-J-COMPUT = "SIAM Journal on Computing"}
@String{j-SIAM-J-CONTROL-OPTIM = "SIAM Journal on Control and Optimization"}
@String{j-SIAM-J-DISCR-MATH = "SIAM Journal on Discrete Mathematics"}
@String{j-SIAM-J-IMAGING-SCI = "SIAM Journal on Imaging Sciences"}
@String{j-SIAM-J-NUMER-ANAL = "SIAM Journal on Numerical Analysis"}
@String{j-SIAM-J-SCI-COMP = "SIAM Journal on Scientific Computing"}
@String{j-SIAM-REVIEW = "SIAM Review"}
@String{j-SIGACT = "ACM SIGACT News"}
@String{j-SIGCSE = "SIGCSE Bulletin (ACM Special Interest Group
on Computer Science Education)"}
@String{j-SIGMETRICS = "ACM SIGMETRICS Performance Evaluation
Review"}
@String{j-SIGMICRO = "ACM SIGMICRO Newsletter"}
@String{j-SIGMOD = "ACM SIG{\-}MOD Record"}
@String{j-SIGPLAN = "ACM SIGPLAN Notices"}
@String{j-SOFTWAREX = "SoftwareX"}
@String{j-SPE = "Soft\-ware --- Prac\-tice and Experience"}
@String{j-SPELMAN-SCI-MATH-J = "Spelman Science and Mathematics Journal"}
@String{j-SUPERFRI = "Supercomputing Frontiers and Innovations"}
@String{j-TACO = "ACM Transactions on Architecture and
Code Optimization"}
@String{j-TALG = "ACM Transactions on Algorithms"}
@String{j-TCBB = "IEEE\slash ACM Transactions on
Computational Biology and Bioinformatics"}
@String{j-TECHNOMETRICS = "Technometrics"}
@String{j-TECS = "ACM Transactions on Embedded Computing
Systems"}
@String{j-THEOR-COMP-SCI = "Theoretical Computer Science"}
@String{j-TISSEC = "ACM Transactions on Information and System
Security"}
@String{j-TMIS = "ACM Transactions on Management Information
Systems (TMIS)"}
@String{j-TOCS = "ACM Transactions on Computer Systems"}
@String{j-TOCL = "ACM Transactions on Computational Logic"}
@String{j-TODAES = "ACM Transactions on Design Automation of
Electronic Systems (TODAES)"}
@String{j-TODS = "ACM Transactions on Database Systems"}
@String{j-TOG = "ACM Transactions on Graphics"}
@String{j-TOIS = "ACM Transactions on Information Systems"}
@String{j-TOMCCAP = "ACM Transactions on Multimedia Computing,
Communications, and Applications"}
@String{j-TOMM = "ACM Transactions on Multimedia Computing,
Communications, and Applications"}
@String{j-TOMPECS = "ACM Transactions on Modeling and Performance
Evaluation of Computing Systems (TOMPECS)"}
@String{j-TOMS = "ACM Transactions on Mathematical Software"}
@String{j-TOPLAS = "ACM Transactions on Programming Languages
and Systems"}
@String{j-TOS = "ACM Transactions on Storage"}
@String{j-TOSN = "ACM Transactions on Sensor Networks"}
@String{j-TRANS-AMER-INST-ELEC-ENG = "Transactions of the {American Institute
of Electrical Engineers}"}
@String{j-TRANS-IRE = "Transactions of the IRE"}
@String{j-TRETS = "ACM Transactions on Reconfigurable
Technology and Systems (TRETS)"}
@String{j-TSAS = "ACM Transactions on Spatial Algorithms and
Systems (TSAS)"}
@String{j-TUGBOAT = "TUGboat"}
@String{j-VLDB-J = "VLDB Journal: Very Large Data Bases"}
@String{j-WIN-MAGAZINE = "Win magazine"}
@String{j-X-J = "The {X} Journal: Computing Technology with
the {X Window System}"}
@String{pub-ACADEMIC = "Academic Press"}
@String{pub-ACADEMIC:adr = "New York, USA"}
@String{pub-ACM = "ACM Press"}
@String{pub-ACM:adr = "New York, NY 10036, USA"}
@String{pub-AFIPS = "AFIPS Press"}
@String{pub-AFIPS:adr = "Montvale, NJ, USA"}
@String{pub-AMS = "American Mathematical Society"}
@String{pub-AMS:adr = "Providence, RI, USA"}
@String{pub-ARTECH = "Artech House Inc."}
@String{pub-ARTECH:adr = "Norwood, MA, USA"}
@String{pub-AW = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}
@String{pub-AW:adr = "Reading, MA, USA"}
@String{pub-BUTTERWORTH-HEINEMANN = "Butterworth-Heinemann"}
@String{pub-BUTTERWORTH-HEINEMANN:adr = "Oxford, UK / Boston, MA, USA"}
@String{pub-CAMBRIDGE = "Cambridge University Press"}
@String{pub-CAMBRIDGE:adr = "Cambridge, UK"}
@String{pub-CHAPMAN-HALL = "Chapman and Hall, Ltd."}
@String{pub-CHAPMAN-HALL:adr = "London, UK"}
@String{pub-CRC = "CRC Press"}
@String{pub-CRC:adr = "2000 N.W. Corporate Blvd., Boca Raton, FL
33431-9868, USA"}
@String{pub-CSP = "Computer Science Press, Inc."}
@String{pub-CSP:adr = "11 Taft Court, Rockville, MD 20850, USA"}
@String{pub-DUKE = "Duke University Press"}
@String{pub-DUKE:adr = "Durham, NC, USA"}
@String{pub-ECMA = "ECMA (European Association for
Standardizing Information and
Communication Systems)"}
@String{pub-ECMA:adr = "Geneva, Switzerland"}
@String{pub-ELSEVIER = "Elsevier"}
@String{pub-ELSEVIER:adr = "Amsterdam, The Netherlands"}
@String{pub-ELSEVIER-SCIENCE = "Elsevier Science, Inc."}
@String{pub-ELSEVIER-SCIENCE:adr = "Amsterdam, The Netherlands"}
@String{pub-ESP = "Elsevier Science Publishers B.V."}
@String{pub-ESP:adr = "Amsterdam, The Netherlands"}
@String{pub-FRONTIERES = "Editions Fronti{\`{e}}res"}
@String{pub-FRONTIERES:adr = "Gif-sur-Yvette, France"}
@String{pub-IBM = "IBM Corporation"}
@String{pub-IBM:adr = "San Jose, CA, USA"}
@String{pub-IEEE = "IEEE Computer Society Press"}
@String{pub-IEEE:adr = "1109 Spring Street, Suite 300, Silver
Spring, MD 20910, USA"}
@String{pub-ISO = "International Organization for
Standardization"}
@String{pub-ISO:adr = "Geneva, Switzerland"}
@String{pub-ITCP = "International Thomson Computer Press"}
@String{pub-ITCP:adr = "20 Park Plaza Suite 1001, Boston,
MA 02116 USA"}
@String{pub-KLUWER = "Kluwer Academic Publishers"}
@String{pub-KLUWER:adr = "Norwell, MA, USA, and Dordrecht, The
Netherlands"}
@String{pub-MATH-ASSOC-AMER = "Mathematical Association of America"}
@String{pub-MATH-ASSOC-AMER:adr = "Washington, DC, USA"}
@String{pub-MCGRAW-HILL = "Mc{\-}Graw-Hill"}
@String{pub-MCGRAW-HILL:adr = "New York, NY, USA"}
@String{pub-MIT = "MIT Press"}
@String{pub-MIT:adr = "Cambridge, MA, USA"}
@String{pub-MORGAN-KAUFMANN = "Morgan Kaufmann Publishers"}
@String{pub-MORGAN-KAUFMANN:adr = "Los Altos, CA 94022, USA"}
@String{pub-MORGAN-KAUFMANN:adrnew = "2929 Campus Drive, Suite 260, San
Mateo, CA 94403, USA"}
@String{pub-MORGAN-KAUFMANN:adrsf = "San Francisco, CA, USA"}
@String{pub-MT = "M\&T Books"}
@String{pub-MT:adr = "M\&T Publishing, Inc., 501 Galveston Drive,
Redwood City, CA 94063, USA"}
@String{pub-NASA = "NASA"}
@String{pub-NASA:adr = "Washington, DC, USA"}
@String{pub-NIST = "National Institute for Standards and
Technology"}
@String{pub-NIST:adr = "Gaithersburg, MD, USA"}
@String{pub-ORA = "O'Reilly \& Associates, Inc."}
@String{pub-ORA:adr = "103a Morris Street,
Sebastopol, CA 95472,
USA,
Tel: +1 707 829 0515,
and
90 Sherman Street,
Cambridge, MA 02140,
USA,
Tel: +1 617 354 5800"}
@String{pub-ORA-FRANCE = "O'Reilly"}
@String{pub-ORA-FRANCE:adr = "Paris, France"}
@String{pub-PENGUIN = "Penguin Books"}
@String{pub-PENGUIN:adr = "Harmondsworth, UK"}
@String{pub-PH = "Pren{\-}tice-Hall"}
@String{pub-PH:adr = "Upper Saddle River, NJ 07458, USA"}
@String{pub-PLENUM = "Plenum Press"}
@String{pub-PLENUM:adr = "New York, NY, USA; London, UK"}
@String{pub-PRINCETON = "Princeton University Press"}
@String{pub-PRINCETON:adr = "Princeton, NJ, USA"}
@String{pub-SAMS = "SAMS Publishing"}
@String{pub-SAMS:adr = "Indianapolis, IN, USA"}
@String{pub-SPIE = "SPIE Optical Engineering Press"}
@String{pub-SPIE:adr = "Bellingham, WA, USA"}
@String{pub-SV = "Springer-Verlag"}
@String{pub-SV:adr = "Berlin, Germany~/ Heidelberg, Germany~/
London, UK~/ etc."}
@String{pub-UNICODE = "The Unicode Consortium"}
@String{pub-UNICODE:adr = "Mountain View, CA, USA"}
@String{pub-UNICODE-SAN-JOSE:adr = "P.O. Box 700519, San Jose, CA 95170-0519,
USA, Phone: +1-408-777-5870, Fax:
+1-408-777-5082, E-mail:
\path=unicode-inc@unicode.org="}
@String{pub-USENIX = "USENIX"}
@String{pub-USENIX:adr = "Berkeley, CA, USA"}
@String{pub-VAN-NOSTRAND-REINHOLD = "Van Nostrand Reinhold"}
@String{pub-VAN-NOSTRAND-REINHOLD:adr = "New York, NY, USA"}
@String{pub-W-H-FREEMAN = "W. H. Freeman"}
@String{pub-W-H-FREEMAN:adr = "New York, NY, USA"}
@String{pub-WCP = "Wellesley-Cambridge Press"}
@String{pub-WCP:adr = "Wellesley, MA, USA"}
@String{pub-WILEY = "John Wiley"}
@String{pub-WILEY:adr = "New York, NY, USA"}
@String{pub-WILEY-INTERSCIENCE = "Wiley-In{\-}ter{\-}sci{\-}ence"}
@String{pub-WILEY-INTERSCIENCE:adr = "New York, NY, USA"}
@String{pub-WINDCREST = "Windcrest\slash McGraw-Hill"}
@String{pub-WINDCREST:adr = "Blue Ridge Summit, PA, USA"}
@String{pub-WORLD-SCI = "World Scientific Publishing
Co. Pte. Ltd."}
@String{pub-WORLD-SCI:adr = "P. O. Box 128, Farrer Road,
Singapore 9128"}
@String{ser-LNCS = "Lecture Notes in Computer Science"}
@String{ser-LNCSE = "Lecture Notes in Computational
Science and Engineering"}
@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 = "https://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 = ack-ds,
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.",
}
@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 = j-MATH-ANN,
volume = "36",
pages = "157--160",
year = "1890",
CODEN = "MAANA3",
ISSN = "0025-5831 (print), 1432-1807 (electronic)",
ISSN-L = "0025-5831",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Mathematische Annalen",
language = "French",
rawdata = "Peano, G. (1890) ``Sur Une Courbe Qui Remplit Toute
Une Aire Plaine,'' {\it Math. Annalen},
{\bf36}:157--160.",
xxtitle = "Sur Une Courbe Qui Remplit Toute Une Aire Plaine",
}
@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 = j-MATH-ANN,
volume = "38",
pages = "459--460",
year = "1891",
CODEN = "MAANA3",
ISSN = "0025-5831 (print), 1432-1807 (electronic)",
ISSN-L = "0025-5831",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Mathematische Annalen",
language = "German",
rawdata-1 = "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}:459--460.",
rawdata-2 = "Hilbert, D. (1891) ``Ueber stetige Abbildung einer
Linie auf ein Fl{\"a}chenst{\"u}ck,'' {\it Math.
Annalen}, {\bf38}:459--460.",
}
@Article{Haar:1910:TOF,
author = "A. Haar",
title = "{Zur Theorie der Orthogonalen Funktionensysteme}.
({German}) [{On} the theory of orthogonal function
systems]",
journal = j-MATH-ANN,
volume = "69",
pages = "331--371",
year = "1910",
CODEN = "MAANA3",
ISSN = "0025-5831 (print), 1432-1807 (electronic)",
ISSN-L = "0025-5831",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Mathematische Annalen",
language = "German",
rawdata = "Haar, A. (1910) ``Zur Theorie der Orthogonalen
Funktionensysteme,'' {\it Mathematische Annalen} first
part {\bf69}:331--371, second part {\bf71}:38--53,
1912.",
}
@Article{Haar:1912:TOF,
author = "A. Haar",
title = "{Zur Theorie der Orthogonalen Funktionensysteme}.
({German}) [{On} the theory of orthogonal function
systems]",
journal = j-MATH-ANN,
volume = "71",
pages = "38--53",
year = "1912",
CODEN = "MAANA3",
ISSN = "0025-5831 (print), 1432-1807 (electronic)",
ISSN-L = "0025-5831",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Mathematische Annalen",
language = "German",
rawdata = "Haar, A. (1910) ``Zur Theorie der Orthogonalen
Funktionensysteme,'' {\it Mathematische Annalen} first
part {\bf69}:331--371, second part {\bf71}:38--53,
1912.",
}
@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 = "462--478",
year = "1912",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprinted in \cite{Sierpinski:1990:NCQ}.",
acknowledgement = ack-ds,
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}:462--478. Simoncelli, Eero P.,
and Edward. H. Adelson (1990) ``Subband Transforms,''
{\it Subband Coding}, John Woods, ed., Boston, MA,
Kluwer Academic Press, pp. 143--192.",
xxtitle = "Sur Une Nouvelle Courbe Qui Remplit Toute Une Aire
Plaine",
}
@Article{Nyquist:1928:CTT,
author = "Harry Nyquist",
title = "Certain Topics in Telegraph Transmission Theory",
journal = j-TRANS-AMER-INST-ELEC-ENG,
volume = "47",
pages = "617--644",
year = "1928",
CODEN = "TAEEA5",
ISSN = "0096-3860",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.xiph.org/ogg/flac.html",
acknowledgement = ack-ds,
fjournal = "Transactions of the American Institute of Electrical
Engineers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6413714",
rawdata = "Nyquist, Harry (1928) ``Certain Topics in Telegraph
Transmission Theory,'' {\it AIEE Transactions},
{\bf47}:617--644. Ogg squish (2006)
|http://www.xiph.org/ogg/flac.html|.",
}
@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 = "1--103",
month = "????",
year = "1935",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Osterberg, G. (1935) ``Topography of the Layer of Rods
and Cones in the Human Retina,'' {\it Acta
Ophthalmologica}, (suppl. 6):1--103.",
}
@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 = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
note = "Reprinted by University Microfilms, Ann Arbor, MI,
1991.",
URL = "http://gadsby.hypermart.net/",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Wright, E. V. (1939) {\it Gadsby}, Los Angeles,
Wetzel. Reprinted by University Microfilms, Ann Arbor,
MI, 1991.",
}
@Article{Hecht:1942:EQV,
author = "S. Hecht and S. Schlaer and M. H. Pirenne",
title = "Energy, Quanta and Vision",
journal = j-J-OPT-SOC-AM,
volume = "38",
pages = "196--208",
year = "1942",
CODEN = "JOSAAH",
ISSN = "0030-3941",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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}:196--208.",
}
@Article{Levinson:1947:WRE,
author = "N. Levinson",
title = "The {Weiner} {RMS} Error Criterion in Filter Design
and Prediction",
journal = j-J-MATH-PHYS,
volume = "25",
pages = "261--278",
year = "1947",
CODEN = "JMAPAQ",
ISSN = "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
ISSN-L = "0022-2488",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Journal of Mathematical Physics",
journal-URL = "http://jmp.aip.org/",
rawdata = "Levinson, N. (1947) ``The Weiner RMS Error Criterion
in Filter Design and Prediction,'' {\it Journal of
Mathematical Physics}, {\bf25}:261--278.",
}
@Article{Shannon:1948:MTCa,
author = "Claude E. Shannon",
title = "A Mathematical Theory of Communication",
journal = j-BELL-SYST-TECH-J,
volume = "27",
number = "3",
pages = "379--423",
month = jul,
year = "1948",
CODEN = "BSTJAN",
ISSN = "0005-8580",
MRclass = "60.0X",
MRnumber = "0026286 (10,133e)",
MRreviewer = "J. L. Doob",
bibdate = "Tue Nov 9 11:15:54 MST 2010",
bibsource = "http://bstj.bell-labs.com/oldfiles/year.1948/BSTJ.1948.2703.html;
http://www.alcatel-lucent.com/bstj/vol27-1948/bstj-vol27-issue03.html;
https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib;
https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
https://www.math.utah.edu/pub/tex/bib/bstj1940.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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.bell-labs.com/BSTJ/images/Vol27/bstj27-3-379.pdf;
http://www.alcatel-lucent.com/bstj/vol27-1948/articles/bstj27-3-379.pdf",
acknowledgement = ack-ds # " and " # ack-nhfb,
author-dates = "Claude Elwood Shannon (April 30, 1916--February 24,
2001)",
fjournal = "The Bell System Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
rawdata = "Shannon, Claude E. (1948), ``A Mathematical Theory of
Communication,'' {\it Bell System Technical Journal},
{\bf27}:379--423 and 623--656, July and October",
}
@Article{Shannon:1948:MTCb,
author = "Claude E. Shannon",
title = "A Mathematical Theory of Communication (continued)",
journal = j-BELL-SYST-TECH-J,
volume = "27",
number = "4",
pages = "623--656",
month = oct,
year = "1948",
CODEN = "BSTJAN",
ISSN = "0005-8580",
MRclass = "60.0X",
MRnumber = "0026286 (10,133e)",
MRreviewer = "J. L. Doob",
bibdate = "Tue Nov 9 11:15:54 MST 2010",
bibsource = "http://bstj.bell-labs.com/oldfiles/year.1948/BSTJ.1948.2704.html;
http://www.alcatel-lucent.com/bstj/vol27-1948/bstj-vol27-issue04.html;
https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
https://www.math.utah.edu/pub/tex/bib/bstj1940.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/mathcw.bib",
note = "Reprinted in \cite{Slepian:1974:KPD}",
URL = "http://bstj.bell-labs.com/BSTJ/images/Vol27/bstj27-4-623.pdf;
http://www.alcatel-lucent.com/bstj/vol27-1948/articles/bstj27-4-623.pdf",
acknowledgement = ack-ds # " and " # ack-nhfb,
author-dates = "Claude Elwood Shannon (April 30, 1916--February 24,
2001)",
fjournal = "The Bell System Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
rawdata = "Shannon, Claude E. (1948), ``A Mathematical Theory of
Communication,'' {\it Bell System Technical Journal},
{\bf27}:379--423 and 623--656, July and October",
}
@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 = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Fano, R. M. (1949) ``The Transmission of
Information,'' Research Laboratory for Electronics,
MIT, Tech Rep. No. 65.",
}
@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 = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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.",
}
@Article{Shannon:1951:PEP,
author = "Claude E. Shannon",
title = "Prediction and Entropy of Printed {English}",
journal = j-BELL-SYST-TECH-J,
volume = "30",
number = "1",
pages = "50--64",
month = jan,
year = "1951",
CODEN = "BSTJAN",
DOI = "https://doi.org/10.1002/j.1538-7305.1951.tb01366.x",
ISSN = "0005-8580",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://bstj.bell-labs.com/oldfiles/year.1951/BSTJ.1951.3001.html;
http://www.alcatel-lucent.com/bstj/vol30-1951/bstj-vol30-issue01.html;
https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/tex/bib/bstj1950.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprinted in \cite{Slepian:1974:KPD}.",
URL = "http://bstj.bell-labs.com/BSTJ/images/Vol30/bstj30-1-50.pdf;
http://www.alcatel-lucent.com/bstj/vol30-1951/articles/bstj30-1-50.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 = ack-ds # " and " # ack-nhfb,
attnote = "Included in Part A.",
author-dates = "Claude Elwood Shannon (April 30, 1916--February 24,
2001)",
fjournal = "The Bell System Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
rawdata = "Shannon, Claude (1951) ``Prediction and Entropy of
Printed English,'' {\it Bell System Technical Journal},
{\bf30}(1):50--64, January.",
received = "September 15, 1950",
}
@Article{Huffman:1952:MCM,
author = "David Huffman",
title = "A Method for the Construction of Minimum Redundancy
Codes",
journal = j-PROC-IRE,
volume = "40",
number = "9",
pages = "1098--1101",
year = "1952",
CODEN = "PIREAE",
DOI = "https://doi.org/10.1109/jrproc.1952.273898",
ISSN = "0096-8390",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the Institute of Radio Engineers",
journal-URL = "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):1098--1101.",
}
@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 = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "United States Patent 2,632,058.",
acknowledgement = ack-ds,
rawdata = "Gray, Frank (1953) ``Pulse Code Communication,''
United States Patent 2,632,058, March 17.",
}
@Article{Chomsky:1956:TMD,
author = "N. Chomsky",
title = "Three Models for the Description of Language",
journal = j-IRE-TRANS-INF-THEORY,
volume = "2",
number = "3",
pages = "113--124",
year = "1956",
CODEN = "IRITAY",
DOI = "https://doi.org/10.1109/tit.1956.1056813",
ISSN = "0096-1000",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IRE Transactions on Information Theory",
journal-URL = "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):113--124.",
}
@Article{McMillan:1956:TII,
author = "Brockway McMillan",
title = "Two Inequalities Implied by Unique Decipherability",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "2",
number = "4",
pages = "115--116",
month = dec,
year = "1956",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1956.1056818",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "McMillan, Brockway (1956) ``Two Inequalities Implied
by Unique Decipherability,'' {\it IEEE Transactions on
Information Theory}, {\bf2}(4):115--116, December.",
}
@Article{Givens:1958:CPU,
author = "Wallace Givens",
title = "Computation of Plane Unitary Rotations Transforming a
General Matrix to Triangular Form",
journal = j-J-SIAM,
volume = "6",
number = "1",
pages = "26--50",
month = mar,
year = "1958",
CODEN = "JSIMAV",
DOI = "https://doi.org/10.1137/0106004",
ISSN = "0368-4245 (print), 1095-712X (electronic)",
ISSN-L = "0368-4245",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siam.bib; JSTOR
database",
acknowledgement = ack-ds # " and " # ack-nhfb,
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):26--50, March.",
}
@Article{Capon:1959:PMR,
author = "J. Capon",
title = "A Probabilistic Model for Run-length Coding of
Pictures",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "5",
number = "4",
pages = "157--163",
month = dec,
year = "1959",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1959.1057512",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Capon, J. (1959) ``A Probabilistic Model for
Run-length Coding of Pictures,'' {\it IEEE Transactions
on Information Theory}, {\bf5}(4):157--163, December.",
}
@Article{Gilbert:1959:VLB,
author = "E. N. Gilbert and E. F. Moore",
title = "Variable Length Binary Encodings",
journal = j-BELL-SYST-TECH-J,
volume = "38",
number = "4",
pages = "933--967",
month = jul,
year = "1959",
CODEN = "BSTJAN",
DOI = "https://doi.org/10.1002/j.1538-7305.1959.tb01583.x",
ISSN = "0005-8580",
ISSN-L = "",
MRclass = "94.00",
MRnumber = "0108413 (21 \#7129)",
MRreviewer = "S. W. Golomb",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://bstj.bell-labs.com/oldfiles/year.1959/BSTJ.1959.3804.html;
http://www.alcatel-lucent.com/bstj/vol38-1959/bstj-vol38-issue04.html;
https://www.math.utah.edu/pub/tex/bib/bstj1950.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Monograph 3515.",
URL = "http://bstj.bell-labs.com/BSTJ/images/Vol38/bstj38-4-933.pdf;
http://www.alcatel-lucent.com/bstj/vol38-1959/articles/bstj38-4-933.pdf",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "The Bell System Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
rawdata-1 = "Gilbert, E. N., and E. F. Moore (1959) ``Variable
Length Binary Encodings,'' {\it Bell System Technical
Journal, Monograph 3515}, {\bf38}:933--967, July.",
rawdata-2 = "Gilbert, E. N. and E. F. Moore (1959) ``Variable
Length Binary Encodings,'' {\it Bell System Technical
Journal}, {\bf38}:933--967.",
}
@Article{Durbin:1960:FTS,
author = "J. Durbin",
title = "The Fitting of Time-Series Models",
journal = j-REV-INST-INT-STATIST,
volume = "28",
pages = "233--344",
year = "1960",
CODEN = "",
DOI = "https://doi.org/10.2307/1401322",
ISSN = "0373-1138",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Revue de l'Institut international de statistique =
Review of the International Statistical Institute",
rawdata = "Durbin J. (1960) ``The Fitting of Time-Series
Models,'' {\it JSTOR: Revue de l'Institut International
de Statistique}, {\bf28}:233--344.",
xxjournal = "JSTOR: Revue de l'Institut International de
Statistique",
}
@Article{Max:1960:QMD,
author = "Joel Max",
title = "Quantizing for minimum distortion",
journal = j-IRE-TRANS-INF-THEORY,
volume = "IT-6",
pages = "7--12",
month = mar,
year = "1960",
CODEN = "IRITAY",
DOI = "https://doi.org/10.1109/tit.1960.1057548",
ISSN = "0096-1000",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IRE Transactions on Information Theory",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4547527",
rawdata = "Max, Joel (1960) ``Quantizing for minimum
distortion,'' {\it IRE Transactions on Information
Theory}, {\bf IT-6}:7--12, March.",
}
@Article{Freeman:1961:EAG,
author = "Herbert Freeman",
title = "On the Encoding of Arbitrary Geometric
Configurations",
journal = j-IRE-TRANS-ELEC-COMPUT,
volume = "EC-10",
number = "2",
pages = "260--268",
month = jun,
year = "1961",
CODEN = "IRELAO",
DOI = "https://doi.org/10.1109/TEC.1961.5219197",
ISSN = "0367-9950",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219197",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "IRE Transactions on Electronic Computers",
rawdata = "Freeman, H. (1961) ``On The Encoding of Arbitrary
Geometric Configurations,'' {\it IRE Transactions on
Electronic Computers}, {\bf EC-10}(2):260--268, June.",
}
@Article{Karp:1961:MRC,
author = "R. S. Karp",
title = "Minimum-Redundancy Coding for the Discrete Noiseless
Channel",
journal = j-TRANS-IRE,
volume = "7",
pages = "27--38",
year = "1961",
CODEN = "",
DOI = "https://doi.org/10.1109/tit.1961.1057615",
ISSN = "",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Transactions of the IRE",
rawdata = "Karp, R. S. (1961) ``Minimum-Redundancy Coding for the
Discrete Noiseless Channel,'' {\it Transactions of the
IRE}, {\bf7}:27--38.",
}
@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 = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Kendall, Maurice G. (1961) {\it A Course in the
Geometry of n-Dimensions}, New York, Hafner.",
}
@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 = "0-932750-03-6",
ISBN-13 = "978-0-932750-03-7",
LCCN = "QA241 .V613 1961",
bibdate = "Mon Jan 28 18:47:14 MST 2013",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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 = ack-ds # " and " # ack-nhfb,
rawdata = "Vorobev, Nikolai N. (1983) in Ian N. Sneddon (ed.),
and Halina Moss (translator), {\it Fibonacci Numbers},
New Classics Library.",
xxauthor = "Nikolai N. Vorobiev",
}
@Book{Abramson:1963:ITC,
author = "N. Abramson",
title = "Information Theory and Coding",
publisher = pub-MCGRAW-HILL,
address = pub-MCGRAW-HILL:adr,
pages = "??",
year = "1963",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Abramson, N. (1963) {\it Information Theory and
Coding}, New York, McGraw-Hill.",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302143966",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "6502683",
subject = "Electrical engineering",
}
@Article{Eisenberger:1965:SSU,
author = "Isidore Eisenberger and Edward C. Posner",
title = "Systematic Statistics Used for Data Compression in
Space Telemetry",
journal = j-J-AM-STAT-ASSOC,
volume = "60",
number = "309",
pages = "97--133",
month = mar,
year = "1965",
CODEN = "JSTNAL",
DOI = "https://doi.org/10.1080/01621459.1965.10480778",
ISSN = "0162-1459 (print), 1537-274X (electronic)",
ISSN-L = "0162-1459",
bibdate = "Wed Jan 25 08:05:37 MST 2012",
bibsource = "http://www.jstor.org/journals/01621459.html;
http://www.jstor.org/stable/i314190;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib",
note = "See corrigenda \cite{Eisenberger:1967:CSS}.",
URL = "http://www.jstor.org/stable/2283140",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Statistical Association",
journal-URL = "http://www.tandfonline.com/loi/uasa20",
}
@Article{Chaitin:1966:LPC,
author = "Gregory J. Chaitin",
title = "On the Length of Programs for Computing Finite Binary
Sequences",
journal = j-J-ACM,
volume = "13",
number = "4",
pages = "547--569",
month = oct,
year = "1966",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/321356.321363",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib;
https://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 = ack-ds # " and " # ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "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):547--569, October.",
}
@Article{Davisson:1966:CST,
author = "I. D. Davisson",
title = "Comments on `Sequence Time Coding for Data
Compression'",
journal = j-PROC-IEEE,
volume = "54",
pages = "2010",
month = dec,
year = "1966",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/proc.1966.5167",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "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.",
}
@Article{Fang:1966:IIE,
author = "I. Fang",
title = "It Isn't {ETAOIN} {SHRDLU}; {It}'s {ETAONI} {RSHDLC}",
journal = j-JOURNAL-Q,
volume = "43",
pages = "761--762",
year = "1966",
CODEN = "JOQUAX",
DOI = "https://doi.org/10.1177/107769906604300418",
ISSN = "0196-3031",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Journalism Quarterly",
rawdata = "Fang I. (1966) ``It Isn't ETAOIN SHRDLU; It's ETAONI
RSHDLC,'' {\it Journalism Quarterly},
{\bf43}:761--762.",
}
@Article{Golomb:1966:RLE,
author = "Solomon W. Golomb",
title = "Run-Length Encodings",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-12",
number = "3",
pages = "399--401",
year = "1966",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1966.1053907",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Golomb, Solomon W. (1966) ``Run-Length Encodings,''
{\it IEEE Transactions on Information Theory}, {\bf
IT-12}(3):399--401.",
}
@PhdThesis{Lynch:1966:DCE,
author = "Thomas Joseph Lynch",
title = "Data Compression with Error-Control 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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302201464",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "6702337",
subject = "Electrical engineering",
}
@Article{Lynch:1966:STC,
author = "T. J. Lynch",
title = "Sequence Time Coding for Data Compression",
journal = j-PROC-IEEE,
volume = "54",
pages = "1490--1491",
month = oct,
year = "1966",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/proc.1966.5167",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "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}:1490--1491, October.",
}
@Article{Eisenberger:1967:CSS,
author = "Isidore Eisenberger and Edward C. Posner",
title = "Corrigenda: Systematic Statistics used for Data
Compression in Space Telemetry",
journal = j-J-AM-STAT-ASSOC,
volume = "62",
number = "320",
pages = "1518--1518",
month = dec,
year = "1967",
CODEN = "JSTNAL",
DOI = "https://doi.org/10.2307/2283812",
ISSN = "0162-1459 (print), 1537-274X (electronic)",
ISSN-L = "0162-1459",
bibdate = "Wed Jan 25 08:05:39 MST 2012",
bibsource = "http://www.jstor.org/journals/01621459.html;
http://www.jstor.org/stable/i314202;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib",
note = "See \cite{Eisenberger:1965:SSU}.",
URL = "http://www.jstor.org/stable/2283812",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Statistical Association",
journal-URL = "http://www.tandfonline.com/loi/uasa20",
}
@Article{Fraser:1967:DCA,
author = "A. G. Fraser",
title = "Data Compression and Automatic Programming",
journal = j-COMP-J,
volume = "10",
number = "2",
pages = "165--167",
month = aug,
year = "1967",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/10.2.165",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:47:38 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/10/2.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1960.bib;
https://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 = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Kortman:1967:DCR,
author = "C. M. Kortman",
title = "Data compression by redundancy reduction",
journal = j-IEEE-SPECTRUM,
volume = "4",
number = "3",
pages = "133--139",
month = mar,
year = "1967",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.1967.5216262",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Wed Jan 15 09:12:12 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1960.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Aircraft; Automotive engineering; Bandwidth; Data
communication; Data compression; Data engineering; Data
mining; Pressing; Sampling methods; Vehicles",
}
@Article{Marron:1967:ADC,
author = "B. A. Marron and P. A. D. de Maine",
title = "Automatic Data Compression",
journal = j-CACM,
volume = "10",
number = "11",
pages = "711--715",
month = nov,
year = "1967",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/363790.363813",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
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/;
https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
https://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 three-part 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
item-by-item 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 = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302264732",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "6802519",
subject = "Electrical engineering",
}
@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 = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Tunstall, B. P., (1967) ``Synthesis of Noiseless
Compression Codes,'' Ph.D. dissertation, Georgia
Institute of Technology, Atlanta, GA.",
}
@PhdThesis{Bruckheim:1969:OSO,
author = "Arthur Jay Bruckheim",
title = "Optimum and Sub-Optimum 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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302460376",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7011656",
subject = "Electrical engineering",
}
@Article{Lynn:1969:QCC,
author = "Kenneth C. Lynn",
title = "A quantitative comparison of conventional information
compression techniques in dental literature",
journal = j-AM-DOC,
volume = "20",
number = "2",
pages = "149--151",
month = apr,
year = "1969",
CODEN = "AMDOA7",
DOI = "https://doi.org/10.1002/asi.4630200206",
ISSN = "0096-946X",
ISSN-L = "0096-946X",
bibdate = "Fri Sep 11 06:21:31 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/amdoc.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "American Documentation",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2330-1643/",
onlinedate = "19 Apr 2007",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302406194",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7116765",
subject = "Electrical engineering",
}
@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.nlc-bnc.ca:210/NL;
https://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/TC-QMM-49103.pdf",
acknowledgement = ack-nhfb,
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302518830",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7101075",
subject = "Electrical engineering",
}
@PhdThesis{Wilkins:1970:SDC,
author = "Larry Clarke Wilkins",
title = "Studies on Data Compression. {Part I}: Picture Coding
By Contours. {Part II}: Error Analysis of Run-Length
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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302522243",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7109481",
subject = "Electrical engineering",
}
@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 = j-CACM,
volume = "14",
number = "12",
pages = "769--774",
month = dec,
year = "1971",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/362919.362931",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jan 22 06:21:16 MST 2001",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#AmidonA71;
https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
https://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 strings-sequence of like codes-by 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 = ack-nhfb,
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",
journal-URL = "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.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AmidonA71",
}
@Book{Berger:1971:RDT,
author = "Toby Berger",
title = "Rate distortion theory; a mathematical basis for data
compression",
publisher = pub-PH,
address = pub-PH:adr,
pages = "xiii + 311",
year = "1971",
ISBN = "0-13-753103-6",
ISBN-13 = "978-0-13-753103-5",
LCCN = "Q385 .B47",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "Prentice-Hall series in information and system
sciences; Prentice-Hall electrical engineering series",
acknowledgement = ack-nhfb,
subject = "Rate distortion theory; Coding theory; Information
theory",
}
@Article{Posner:1971:EED,
author = "Edward C. Posner and Eugene R. Rodemich",
title = "Epsilon Entropy and Data Compression",
journal = j-ANN-MATH-STAT,
volume = "42",
number = "6",
pages = "2079--2125",
month = dec,
year = "1971",
CODEN = "AASTAD",
DOI = "https://doi.org/10.1214/aoms/1177693077",
ISSN = "0003-4851",
ISSN-L = "0003-4851",
bibdate = "Sat May 31 09:11:21 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/annmathstat.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://projecteuclid.org/euclid.aoms/1177693077",
acknowledgement = ack-nhfb,
fjournal = "Annals of Mathematical Statistics",
journal-URL = "http://projecteuclid.org/all/euclid.aoms/",
}
@Article{Rudner:1971:CMR,
author = "B. Rudner",
title = "Construction of Minimum-Redundancy Codes with an
Optimum Synchronization Property",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "17",
number = "4",
pages = "478--487",
month = jul,
year = "1971",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1971.1054657",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Rudner, B. (1971) ``Construction of Minimum-Redundancy
Codes with an Optimum Synchronization Property,'' {\it
IEEE Transactions on Information Theory},
{\bf17}(4):478--487, July.",
}
@Misc{Anonymous:1972:G,
author = "Anonymous",
title = "{G.711}",
pages = "??",
year = "1972",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/G.711",
acknowledgement = ack-ds,
rawdata = "G.711 (1972) |http://en.wikipedia.org/wiki/G.711|.",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302676863",
acknowledgement = ack-nhfb,
classification = "0790: Systems design",
dissertation-thesis-number = "7228226",
subject = "Systems design",
}
@Article{Gardner:1972:MG,
author = "Martin Gardner",
title = "Mathematical Games",
journal = j-SCI-AMER,
volume = "227",
number = "2",
pages = "106--106",
month = aug,
year = "1972",
CODEN = "SCAMAC",
DOI = "https://doi.org/10.1038/scientificamerican0872-106",
ISSN = "0036-8733 (print), 1946-7087 (electronic)",
ISSN-L = "0036-8733",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://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 = ack-ds,
fjournal = "Scientific American",
journal-URL = "http://www.nature.com/scientificamerican",
rawdata-1 = "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|.",
rawdata-2 = "Gardner, Martin (1972) ``Mathematical Games,'' {\it
Scientific American}, {\bf227}(2):106, August. Gemstar
(2007) |http://www.gemstartvguide.com|.",
}
@Article{Golomb:1972:RLE,
author = "S. W. Golomb",
title = "Run-Length Encodings",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-12",
number = "3",
pages = "399--401",
year = "1972",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1966.1053907",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Gardner, Martin (1972) ``Mathematical Games,'' {\it
Scientific American}, {\bf227}(2):106, August. Golomb,
S. W. (1966) ``Run-Length Encodings,'' {\it IEEE
Transactions on Information Theory}
IT-12(3):399--401.",
}
@Article{Heath:1972:OBC,
author = "F. G. Heath",
title = "Origins of the Binary Code",
journal = j-SCI-AMER,
volume = "227",
number = "2",
pages = "76--76",
month = aug,
year = "1972",
CODEN = "SCAMAC",
DOI = "https://doi.org/10.1038/scientificamerican0872-76",
ISSN = "0036-8733 (print), 1946-7087 (electronic)",
ISSN-L = "0036-8733",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Scientific American",
journal-URL = "http://www.nature.com/scientificamerican",
rawdata = "Heath, F. G. (1972) ``Origins of the Binary Code,''
{\it Scientific American}, {\bf227}(2):76, August.",
}
@PhdThesis{Kohlhaas:1972:CFC,
author = "Charles Albert Kohlhaas",
title = "Calculation of Formation Compression From Core and
Well-Tested 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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302554471",
acknowledgement = ack-nhfb,
classification = "0373: Geophysics",
dissertation-thesis-number = "0231563",
subject = "Geophysics",
}
@Article{Paez:1972:MMS,
author = "M. D. Paez and T. H. Glisson",
title = "Minimum Mean Squared Error Quantization in Speech
{PCM} and {DPCM} Systems",
journal = j-IEEE-TRANS-COMM,
volume = "COM-20",
number = "2",
pages = "225--230",
year = "1972",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1972.1091123",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Paez, M. D. and T. H. Glisson (1972) ``Minimum Mean
Squared Error Quantization in Speech PCM and DPCM
Systems,'' {\it IEEE Transactions on Communications},
{\bf COM-20}(2):225--230",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302618152",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7230964",
subject = "Electrical engineering",
}
@Article{Schalkwijk:1972:ASC,
author = "J. Pieter M. Schalkwijk",
title = "An Algorithm for Source Coding",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "18",
number = "3",
pages = "395--399",
month = may,
year = "1972",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/TIT.1972.1054832",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Schalkwijk, J. Pieter M. ``An Algorithm for Source
Coding,'' {\it IEEE Transactions on Information
Theory}, {\bf18}(3):395--399, May.",
}
@MastersThesis{Tsui:1972:DCP,
author = "Stephen S. T. Tsui",
title = "Data Compression with Particular Applications to Video
Signals",
type = "{M.Eng.}",
school = "Department of Electrical Engineering, McGill
University",
address = "Montr{\'e}al, QC, Canada",
pages = "iii + 151",
month = dec,
year = "1972",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlc-bnc.ca:210/NL;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://digitool.library.mcgill.ca/thesisfile51654.pdf;
http://www.collectionscanada.ca/obj/thesescanada/vol1/QMM/TC-QMM-51654.pdf",
acknowledgement = ack-nhfb,
advisor = "M. Fukada",
}
@Article{Wells:1972:FCU,
author = "M. Wells",
title = "File Compression Using Variable Length Encodings",
journal = j-COMP-J,
volume = "15",
number = "4",
pages = "308--313",
month = nov,
year = "1972",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/15.4.308",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:47:50 MST 2012",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://comjnl.oxfordjournals.org/content/15/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
https://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 = ack-nhfb,
classcodes = "C6130 (Data handling techniques)",
classification = "723; 911",
corpsource = "Univ. Leeds, UK",
fjournal = "The Computer Journal",
journal-URL = "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",
}
@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 = j-BULL-SOC-R-SCI-LIEGE,
volume = "41",
pages = "179--182",
year = "1972",
CODEN = "BSRSA6",
ISSN = "0037-9565",
ISSN-L = "0037-9565",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fibquart.bib",
acknowledgement = ack-ds,
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}:179--182.",
}
@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 = pub-IEEE,
address = pub-IEEE:adr,
pages = "593--597",
year = "1973",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Faller N. (1973) ``An Adaptive System for Data
Compression,'' {\it Record of the 7th Asilomar
Conference on Circuits, Systems, and Computers}, pp.
593--597.",
}
@Article{Gibbons:1973:CFC,
author = "Charles J. Gibbons and M. Wells",
title = "Correspondence: On {``File Compression Using Variable
Length Encodings''}",
journal = j-COMP-J,
volume = "16",
number = "3",
pages = "287--287",
month = aug,
year = "1973",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/16.3.287",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Oct 07 17:13:59 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
https://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 = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Grimm:1973:ALP,
author = "Richard E. Grimm",
title = "The Autobiography of {Leonardo Pisano}",
journal = j-FIB-QUART,
volume = "11",
number = "1",
pages = "99--104",
month = feb,
year = "1973",
CODEN = "FIBQAU",
ISSN = "0015-0517",
ISSN-L = "0015-0517",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.fq.math.ca/11-1.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fibquart.bib",
URL = "http://www.fq.math.ca/Scanned/11-1/grimm.pdf",
acknowledgement = ack-ds # " and " # ack-nhfb,
ajournal = "Fib. Quart",
fjournal = "Fibonacci Quarterly",
journal-URL = "http://www.fq.math.ca/",
rawdata = "Grimm, R. E. (1973) ``The Autobiography of Leonardo
Pisano,'' {\it Fibonacci Quarterly},
{\bf11}(1):99--104, February.",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302696388",
acknowledgement = ack-nhfb,
classification = "0538: Aerospace materials",
dissertation-thesis-number = "7406491",
subject = "Aerospace materials",
}
@Book{Knuth:1973:ACP,
author = "Donald E. Knuth",
title = "The Art of Computer Programming, Volume 1, Fundamental
Algorithms",
publisher = pub-AW,
address = pub-AW:adr,
edition = "Second",
pages = "xxi + 634",
year = "1973\noopsort{a}",
ISBN = "0-201-03821-8",
ISBN-13 = "978-0-201-03821-7",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Knuth, Donald E. (1973) {\it The Art of Computer
Programming}, Vol. 1, 2nd Ed., Reading, MA,
Addison-Wesley.",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302771096",
acknowledgement = ack-nhfb,
classification = "0405: Mathematics",
dissertation-thesis-number = "7405821",
subject = "Mathematics",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302674792",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7314996",
subject = "Electrical engineering",
}
@Article{Ahmed:1974:DCT,
author = "N. Ahmed and T. Natarajan and K. R. Rao",
title = "{Discrete Cosine Transfom}",
journal = j-IEEE-TRANS-COMPUT,
volume = "C-23",
number = "1",
pages = "90--93",
month = jan,
year = "1974",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/T-C.1974.223784",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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 = ack-ds # " and " # ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
rawdata-1 = "Ahmed, N., T. Natarajan, and R. K. Rao (1974)
``Discrete Cosine Transform,'' {\it IEEE Transactions
on Computers}, {\bf C-23}:90--93.",
rawdata-2 = "Ahmed, N., T. Natarajan, and R. K. Rao (1974)
``Discrete Cosine Transform,'' {\it IEEE Transactions
on Computers} C-23:90--93.",
}
@Article{Bahl:1974:IDC,
author = "L. R. Bahl and H. Kobayashi",
title = "Image data compression by predictive coding. {II}.
Encoding algorithms",
journal = j-IBM-JRD,
volume = "18",
number = "2",
pages = "172--179",
month = mar,
year = "1974",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "Predictive coding techniques for efficient
transmission or storage of two-level (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 run-length distributions. Finally,
some experimental results for sample documents are
presented.",
acknowledgement = ack-nhfb,
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",
journal-URL = "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",
}
@PhdThesis{Felt:1974:DCT,
author = "Douglas Charles Felt",
title = "Data-Compression Techniques Using Adaptive
Translation-Permutation 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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302713192",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "7416362",
subject = "Computer science",
}
@Article{Hahn:1974:NTC,
author = "Bruce Hahn",
title = "A New Technique for Compression and Storage of Data",
journal = j-CACM,
volume = "17",
number = "8",
pages = "434--436",
month = aug,
year = "1974",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/361082.361086",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jan 22 06:47:50 MST 2001",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Hahn74;
https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
https://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 = ack-nhfb,
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",
journal-URL = "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.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hahn74",
}
@Article{Jordan:1974:COR,
author = "B. W. {Jordan, Jr.} and R. C. Barrett",
title = "A Cell Organized Raster Display for Line Drawings",
journal = j-CACM,
volume = "17",
number = "2",
pages = "70--77",
month = feb,
year = "1974",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/360827.360836",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#JordanB74;
https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
https://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 = ack-ds # " and " # ack-nhfb,
classcodes = "C5540 (Terminals and graphic displays); C6130 (Data
handling techniques)",
classification = "722",
corpsource = "Northwestern Univ., Evanston, IL, USA",
fjournal = "Communications of the ACM",
journal-URL = "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):70--77.",
treatment = "P Practical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/JordanB74",
}
@Article{Kobayashi:1974:IDC,
author = "H. Kobayashi and L. R. Bahl",
title = "Image data compression by predictive coding. {I}.
Prediction algorithms",
journal = j-IBM-JRD,
volume = "18",
number = "2",
pages = "164--171",
month = mar,
year = "1974",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "Predictive coding techniques for efficient
transmission or storage of two-level (black and white)
digital images are dealt with.",
acknowledgement = ack-nhfb,
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",
journal-URL = "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",
}
@Book{Slepian:1974:KPD,
editor = "David Slepian",
title = "Key papers in the development of information theory",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "vi + 463",
year = "1974",
ISBN = "0-87942-027-8, 0-87942-028-6 (paperback)",
ISBN-13 = "978-0-87942-027-7, 978-0-87942-028-4 (paperback)",
LCCN = "Q360 .S54",
bibdate = "Sat Nov 20 11:29:48 MST 2010",
bibsource = "catalog.princeton.edu:7090/voyager;
https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "IEEE Press selected reprint series",
acknowledgement = ack-nhfb,
subject = "Information theory",
}
@Article{Elias:1975:UCS,
author = "P. Elias",
title = "Universal Codeword Sets and Representations of the
Integers",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-21",
number = "2",
pages = "194--203",
month = mar,
year = "1975",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1975.1055349",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata-1 = "Elias, P. (1975) ``Universal Codeword Sets and
Representations of the Integers,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT-21}(2):194--203, March.",
rawdata-2 = "Elias, P. (1975) ``Universal Codeword Sets and
Representations of the Integers,'' {\it IEEE
Transactions on Information Theory},
{\bf21}(2):194--203, March.",
}
@Article{Gallager:1975:OSC,
author = "Robert G. Gallager and David C. van Voorhis",
title = "Optimal Source Codes for Geometrically Distributed
Integer Alphabets",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-21",
number = "3",
pages = "228--230",
month = mar,
year = "1975",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1975.1055357",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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 IT-21}(3):228--230, March.",
}
@InProceedings{Gottlieb:1975:CCM,
author = "D. Gottlieb and others",
booktitle = "Proceedings of the National Computer Conference, May
19--22, 1975, Anaheim, California.",
title = "A Classification of Compression Methods and their
Usefulness for a Large Data Processing Center",
volume = "44",
publisher = pub-AFIPS,
address = pub-AFIPS:adr,
pages = "453--458",
year = "1975",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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}:453--458.",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302793284",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "0510317",
subject = "Electrical engineering",
}
@Article{Ling:1975:BOI,
author = "H. Ling and F. P. Palermo",
title = "Block-Oriented Information Compression",
journal = j-IBM-JRD,
volume = "19",
number = "2",
pages = "141--145",
month = mar,
year = "1975",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.192.0141",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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 sub-blocks
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 sub-blocks is generally shorter (never
greater) than the original block.",
acknowledgement = ack-nhfb,
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",
journal-URL = "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",
}
@Article{Mayne:1975:ICF,
author = "A. Mayne and E. B. James",
title = "Information Compression by Factorising Common
Strings",
journal = j-COMP-J,
volume = "18",
number = "2",
pages = "157--160",
month = may,
year = "1975",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/18.2.157",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:47:55 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/18/2.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
https://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 = ack-nhfb,
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",
journal-URL = "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",
}
@Article{Shanmugam:1975:CDC,
author = "K. S. Shanmugam",
title = "Comments on {``Discrete Cosine Transform''}",
journal = j-IEEE-TRANS-COMPUT,
volume = "C-24",
number = "7",
pages = "759--759",
month = jul,
year = "1975",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/T-C.1975.224301",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 12 07:57:55 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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 = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Turner:1975:GCS,
author = "L. F. Turner",
title = "The `on-ground' compression of satellite data",
journal = j-COMP-J,
volume = "18",
number = "3",
pages = "243--247",
month = aug,
year = "1975",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/18.3.243",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:47:56 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/18/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
https://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 = ack-nhfb,
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",
journal-URL = "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",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302800779",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "0513287",
subject = "Electrical engineering",
}
@Article{Bentley:1976:AOA,
author = "J. L. Bentley and A. Chi-Chih Yao",
title = "An Almost Optimal Algorithm for Unbounded Searching",
journal = j-INFO-PROC-LETT,
volume = "5",
number = "3",
pages = "82--87",
day = "??",
month = aug,
year = "1976",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(76)90071-5",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of North Carolina,
Chapel Hill, NC, USA",
fjournal = "Information Processing Letters",
journal-URL = "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):82--87.",
treatment = "T Theoretical or Mathematical",
}
@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.nlc-bnc.ca:210/NL; http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Report E-69.",
URL = "http://search.proquest.com/docview/302833917",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "NK28592",
subject = "Electrical engineering",
xxpages = "xiv [i.e., xv] + 153",
xxyear = "1977",
}
@Article{Dance:1976:ALD,
author = "D. L. Dance and U. W. Pooch",
title = "An adaptive on line data compression system",
journal = j-COMP-J,
volume = "19",
number = "3",
pages = "216--224",
month = aug,
year = "1976",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/19.3.216",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:47:58 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/19/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
https://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 = ack-nhfb,
classcodes = "C6130 (Data handling techniques); C6150E (General
utility programs)",
classification = "723",
corpsource = "Univ. of Arkansas, Little Rock, AR, USA",
fjournal = "The Computer Journal",
journal-URL = "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",
}
@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 = "0-87933-089-9",
ISBN-13 = "978-0-87933-089-7",
LCCN = "TK5102.5 .D335 1976",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "clas.caltech.edu:210/INNOPAC;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "Benchmark papers in electrical engineering and
computer science",
acknowledgement = ack-nhfb,
subject = "Data compression (Telecommunication); Coding theory",
}
@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 = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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.",
}
@Article{Lempel:1976:CFS,
author = "A. Lempel and J. Ziv",
title = "On the Complexity of Finite Sequences",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "22",
number = "1",
pages = "75--81",
year = "1976",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1976.1055501",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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):75--81.",
}
@Article{McCreight:1976:SES,
author = "Edward M. McCreight",
title = "A Space-Economical Suffix Tree Construction
Algorithm",
journal = j-J-ACM,
volume = "23",
number = "2",
pages = "262--272",
month = apr,
year = "1976",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/321941.321946",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "A new algorithm is presented for constructing
auxiliary digital search trees to aid in exact-match
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 = ack-ds # " and " # ack-nhfb,
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",
journal-URL = "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):262--272, April.",
}
@Article{Morrin:1976:CLC,
author = "T. H. {Morrin, II}",
title = "Chain-Link Compression of Arbitrary Black-White
Images",
journal = j-CGIP,
volume = "5",
number = "2",
pages = "172--189",
month = jun,
year = "1976",
CODEN = "CGIPBG",
DOI = "https://doi.org/10.1016/0146-664x(76)90026-5",
ISSN = "0146-664X",
ISSN-L = "0146-664X",
bibdate = "Fri Feb 7 08:07:49 MST 1997",
bibsource = "Compendex database; Graphics/imager/imager.76.bib;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "722; 723",
fjournal = "Computer Graphics and Image Processing",
journal-URL = "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",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302826487",
acknowledgement = ack-nhfb,
classification = "0790: Systems design",
dissertation-thesis-number = "7707677",
subject = "Systems design",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302770683",
acknowledgement = ack-ds # " and " # ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "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",
}
@Article{Rissanen:1976:GKI,
author = "J. J. Rissanen",
title = "Generalized {Kraft} Inequality and Arithmetic Coding",
journal = j-IBM-JRD,
volume = "20",
number = "3",
pages = "198--203",
month = may,
year = "1976",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.203.0198",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
MRclass = "94A10",
MRnumber = "54 \#12359",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
acknowledgement = ack-ds # " and " # ack-nhfb,
classcodes = "B6120B (Codes); C6130 (Data handling techniques)",
corpsource = "IBM Res. Lab., San Jose, CA, USA",
fjournal = "IBM Journal of Research and Development",
journal-URL = "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}:198--203, May.",
reviewer = "Jack K. Wolf",
treatment = "T Theoretical or Mathematical",
}
@Article{Roetling:1976:HME,
author = "P. G. Roetling",
title = "Halftone Method with Edge Enhancement and Moir{\'e}
Suppression",
journal = j-J-OPT-SOC-AM,
volume = "66",
pages = "985--989",
year = "1976",
CODEN = "JOSAAH",
DOI = "https://doi.org/10.1364/josa.66.000985",
ISSN = "0030-3941",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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}:985--989.",
}
@Article{Rubin:1976:ETF,
author = "Frank Rubin",
title = "Experiments in Text File Compression",
journal = j-CACM,
volume = "19",
number = "11",
pages = "617--623",
month = nov,
year = "1976",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/360363.360368",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jan 22 07:17:30 MST 2001",
bibsource = "Compendex database;
http://dblp.uni-trier.de/db/journals/cacm/cacm19.html#Rubin76;
https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
https://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 = ack-nhfb,
classcodes = "C6130 (Data handling techniques)",
classification = "723",
corpsource = "IBM, Poughkeepsie, NY, USA",
fjournal = "Communications of the ACM",
journal-URL = "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; N-gram
encoding; strings of characters; text compression; text
editing; text file compression",
oldlabel = "Rubin76",
treatment = "P Practical; X Experimental",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Rubin76",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302820785",
acknowledgement = ack-nhfb,
classification = "0399: Library science",
dissertation-thesis-number = "MK30462",
subject = "Library science",
}
@Book{Wirth:1976:ADS,
author = "Niklaus Wirth",
title = "Algorithms $+$ Data Structures $=$ Programs",
publisher = pub-PH,
address = pub-PH:adr,
edition = "Second",
pages = "xvii + 366",
year = "1976",
ISBN = "0-13-022418-9",
ISBN-13 = "978-0-13-022418-7",
LCCN = "QA76.6 .W561",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
series = "Prentice-Hall Series in Automatic Computation",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Wirth, N. (1976) {\it Algorithms + Data Structures =
Programs}, 2nd ed., Englewood Cliffs, NJ,
Prentice-Hall.",
}
@TechReport{Aronson:1977:CST,
author = "Jules Aronson",
title = "Computer science and technology: data compression ---
a comparison of methods",
type = "NBS special publication",
number = "500-12",
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 = "0083-1883",
ISSN-L = "0083-1883",
LCCN = "QC100 .U57 no. 500-12",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://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
methods--null suppression, pattern substitution,
statistical encoding, and telemetry compression--and
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 = ack-nhfb,
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.",
}
@Article{Chaitin:1977:AIT,
author = "Gregory J. Chaitin",
title = "Algorithmic Information Theory",
journal = j-IBM-JRD,
volume = "21",
number = "4",
pages = "350--359",
month = jul,
year = "1977",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.214.0350",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
MRclass = "94A15 (68A20)",
MRnumber = "56 \#15151",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
acknowledgement = ack-ds # " and " # ack-nhfb,
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",
journal-URL = "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}:350--359, July.",
reviewer = "Robert P. Daley",
treatment = "T Theoretical or Mathematical",
}
@PhdThesis{Chen:1977:DCB,
author = "Po Hsiin Chen",
title = "Data Compression for Binary and Multi-Level 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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302819991",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7730067",
subject = "Electrical engineering",
}
@Article{Chen:1977:FCA,
author = "Wen-Hsiung Chen and C. Harrison Smith and S. C.
Fralick",
title = "A Fast Computational Algorithm For the Discrete Cosine
Transform",
journal = j-IEEE-TRANS-COMM,
volume = "25",
number = "9",
pages = "1004--1009",
month = sep,
year = "1977",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1977.1093941",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Chen, Wen-Hsiung, C. Harrison Smith, and S. C. Fralick
(1977) ``A Fast Computational Algorithm For the
Discrete Cosine Transform,'' {\it IEEE Transactions on
Communications}, {\bf25}(9):1004--1009, September.",
}
@Article{Lawrence:1977:NUC,
author = "John C. Lawrence",
title = "A New Universal Coding Scheme for the Binary
Memoryless Source",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "23",
number = "4",
pages = "466--472",
month = jul,
year = "1977",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1977.1055749",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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):466--472, July.",
}
@Book{Mandelbrot:1977:FFC,
author = "Beno{\^\i}t B. Mandelbrot",
title = "Fractals: form, chance, and dimension",
publisher = pub-W-H-FREEMAN,
address = pub-W-H-FREEMAN:adr,
edition = "Revised",
pages = "xvi + 365",
year = "1977",
ISBN = "0-7167-0473-0, 0-7167-0474-9 (paperback)",
ISBN-13 = "978-0-7167-0473-7, 978-0-7167-0474-4 (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 = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Translated from the French",
ZMnumber = "Zbl 0376.28020",
acknowledgement = ack-nhfb,
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",
}
@Article{Roetling:1977:BAC,
author = "P. G. Roetling",
title = "Binary Approximation of Continuous Tone Images",
journal = j-PHOTOGR-SCI-ENG,
volume = "21",
pages = "60--65",
year = "1977",
CODEN = "PSENAC",
ISSN = "0031-8760",
ISSN-L = "0031-8760",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Photographic Science and Engineering",
rawdata = "Roetling, P. G. (1977) ``Binary Approximation of
Continuous Tone Images,'' {\it Photography Science and
Engineering}, {\bf21}:60--65.",
xxjournal = "Photography Science and Engineering",
}
@Article{Ting:1977:CHT,
author = "T. C. Ting",
title = "Compacting homogeneous text for minimizing storage
space",
journal = j-INT-J-COMPUT-INF-SCI,
volume = "6",
number = "3",
pages = "211--221",
month = sep,
year = "1977",
CODEN = "IJCIAH",
DOI = "https://doi.org/10.1007/bf01002332",
ISSN = "0091-7036",
bibdate = "Sat Apr 26 12:20:22 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
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",
}
@Article{Ziv:1977:UAS,
author = "Jacob Ziv and Abraham Lempel",
title = "A Universal Algorithm for Sequential Data
Compression",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-23",
number = "3",
pages = "337--343",
month = may,
year = "1977",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/TIT.1977.1055714",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Thu Jan 16 17:56:50 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "A universal algorithm for sequential data compression
is presented. Its performance is investigated with
respect to a nonprobabilistic model of constrained
sources. The compression ratio achieved by the proposed
universal code uniformly approaches the lower bounds on
the compression ratios attainable by block-to-variable
codes and variable-to-block codes designed to match a
completely specified source.",
acknowledgement = ack-ds # " and " # ack-nhfb,
author-dates = "Jacob Ziv (27 November 1931--25 March 2023); Abraham
Lempel (10 February 1936--4 February 2023)",
fjournal = "IEEE Transactions on Information Theory",
rawdata-1 = "Ziv, Jacob, and A. Lempel (1977) ``A Universal
Algorithm for Sequential Data Compression,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT-23}(3):337--343.",
rawdata-2 = "Ziv, J., and A. Lempel (1977) ``A Universal Algorithm
for Sequential Data Compression,'' {\it IEEE
Transactions on Information Theory},
IT-23(3):337--343.",
}
@PhdThesis{CapitantdeVillebonne:1978:DID,
author = "Patrice Jean-Marie {Capitant de Villebonne}",
title = "Design and Implementation of Distortion-Free
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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302940557",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7822484",
subject = "Electrical engineering",
}
@Article{Even:1978:EEC,
author = "Shimon Even and Michael Rodeh",
title = "Economical Encoding of Commas Between Strings",
journal = j-CACM,
volume = "21",
number = "4",
pages = "315--317",
month = apr,
year = "1978",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/359460.359480",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
MRclass = "68A10",
MRnumber = "58 3648",
MRreviewer = "John Cherniavsky",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#EvenR78;
https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
classcodes = "C6130 (Data handling techniques)",
corpsource = "Israel Inst. of Technol., Haifa, Israel",
fjournal = "Communications of the ACM",
journal-URL = "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):315--317, April.",
treatment = "T Theoretical or Mathematical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/EvenR78",
}
@Article{Gallager:1978:VTH,
author = "Robert G. Gallager",
title = "Variations On a Theme By {Huffman}",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-24",
number = "6",
pages = "668--674",
month = nov,
year = "1978",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1978.1055959",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata-1 = "Gallager, Robert G. (1978) ``Variations On a Theme By
Huffman,'' {\it IEEE Transactions on Information
Theory}, {\bf IT-24}(6):668--674, November.",
rawdata-2 = "Gallager, Robert G. (1978) ``Variations on a Theme by
Huffman,'' {\it IEEE Transactions on Information
Theory}, {\bf24}(6):668--674, November.",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302897622",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7905490",
subject = "Electrical engineering",
}
@Article{Jakobsson:1978:HCB,
author = "M. Jakobsson",
title = "{Huffman} coding in bit-vector compression",
journal = j-INFO-PROC-LETT,
volume = "7",
number = "6",
pages = "304--307",
day = "??",
month = oct,
year = "1978",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(78)90023-6",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94B25",
MRnumber = "80f:94026",
MRreviewer = "Ram Autar",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib",
acknowledgement = ack-nhfb,
classification = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku,
Finland",
fjournal = "Information Processing Letters",
journal-URL = "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",
}
@Article{Lea:1978:TCA,
author = "R. M. Lea",
title = "Text Compression with an Associative Parallel
Processor",
journal = j-COMP-J,
volume = "21",
number = "1",
pages = "45--56",
month = feb,
year = "1978",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/21.1.45",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:02 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/21/1.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
https://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 = ack-nhfb,
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",
journal-URL = "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",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302929849",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7808809",
subject = "Electrical engineering",
}
@Article{Louis-Gavet:1978:DAI,
author = "Guy Louis-Gavet",
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, hash-coding). [Various
Applications Issued from a Compression Function $f$
Based on a Mathematical Study of the Natural Language
(Data Compression, Comparison of Texts, Hash-Coding)]",
journal = "RAIRO Informatique/Computer Science (Revue
Fran{\c{c}}aise d'Automatique, d'Informatique et de
Recherche Operationnelle)",
volume = "12",
number = "1",
pages = "47--71",
month = "????",
year = "1978",
CODEN = "RSINDN",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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 names-first
names, of titles-authors of books; comparison of texts,
and applications in Hash-coding.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "RAIRO Inf Comput Sci",
keywords = "computer programming languages",
language = "French",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302919063",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7903802",
subject = "Electrical engineering",
}
@Book{Rabiner:1978:DPS,
author = "Lawrence R. Rabiner and Ronald W. Schafer",
title = "Digital Processing of Speech Signals",
publisher = pub-PH,
address = pub-PH:adr,
pages = "??",
year = "1978",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Prentice-Hall Series in Signal Processing",
acknowledgement = ack-ds,
rawdata = "Rabiner, Lawrence R. and Ronald W. Schafer (1978) {\it
Digital Processing of Speech Signals}, Englewood
Cliffs, NJ, Prentice-Hall Series in Signal
Processing.",
}
@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 = "30--39",
year = "1978",
bibdate = "Wed Feb 20 18:33:31 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Article{Teuhola:1978:CMC,
author = "Jukka Teuhola",
title = "A Compression Method for Clustered Bit-Vectors",
journal = j-INFO-PROC-LETT,
volume = "7",
number = "6",
pages = "308--311",
day = "??",
month = oct,
year = "1978",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(78)90024-8",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
classification = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku,
Finland",
fjournal = "Information Processing Letters",
journal-URL = "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 Bit-Vectors,'' {\it Information Processing
Letters}, {\bf7}:308--311, October.",
treatment = "T Theoretical or Mathematical",
}
@PhdThesis{Yalabik:1978:CDC,
author = "Nese Yalabik",
title = "Contour Data Compression Exploiting Curve-To-Curve
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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302882442",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7906632",
subject = "Electrical engineering",
}
@Article{Ziv:1978:CIS,
author = "Jacob Ziv and A. Lempel",
title = "Compression of Individual Sequences via Variable-Rate
Coding",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-24",
number = "5",
pages = "530--536",
month = sep,
year = "1978",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/TIT.1978.1055934",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "IEEE Transactions on Information Theory",
rawdata-1 = "Ziv, Jacob and A. Lempel (1978) ``Compression of
Individual Sequences via Variable-Rate Coding,'' {\it
IEEE Transactions on Information Theory}, {\bf
IT-24}(5):530--536.",
rawdata-2 = "Ziv, J., and A. Lempel (1978) ``Compression of
Individual Sequences via Variable-Rate Coding,'' {\it
IEEE Transactions on Information Theory}
IT-24(5):530--536.",
}
@TechReport{Beebe:1979:IFD,
author = "Nelson H. F. Beebe",
title = "Integral File Data Compression",
institution = inst-CLSC,
address = inst-CLSC:adr,
pages = "39",
day = "18",
month = may,
year = "1979",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}
@Article{Camana:1979:VBC,
author = "P. Camana",
title = "Video-bandwidth compression: a study in tradeoffs",
journal = j-IEEE-SPECTRUM,
volume = "16",
number = "6",
pages = "24--29",
month = jun,
year = "1979",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.1979.6368035",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Mon Jan 20 06:41:24 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1970.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "bandwidth compression; Encoding; Facsimile; Hardware;
Image coding; image compression technology; image
quality; Image resolution; military application;
picture processing; Quantization; tradeoffs;
Transforms",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302988278",
acknowledgement = ack-nhfb,
classification = "0541: Biomedical research",
dissertation-thesis-number = "7924352",
subject = "Biomedical research",
}
@InProceedings{Galil:1979:NFG,
author = "Zvi Galil and Amnon Naamad",
title = "Network flow and generalized path compression",
crossref = "ACM:1979:CRE",
pages = "13--26",
year = "1979",
bibdate = "Wed Feb 20 18:33:31 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302947120",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "7927805",
subject = "Computer science",
}
@Misc{Rice:1979:SPU,
author = "Robert F. Rice",
title = "Some Practical Universal Noiseless Coding Techniques",
type = "JPL Publication",
number = "79-22",
institution = "Jet Propulsion Laboratory",
address = "Pasadena, CA, USA",
pages = "??",
month = mar,
year = "1979",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Rice, Robert F. (1979) ``Some Practical Universal
Noiseless Coding Techniques,'' Jet Propulsion
Laboratory, JPL Publication 79-22, Pasadena, CA,
March.",
}
@Article{Rubin:1979:ASC,
author = "F. Rubin",
title = "Arithmetic Stream Coding Using Fixed Precision
Registers",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "25",
number = "6",
pages = "672--675",
month = nov,
year = "1979",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1979.1056107",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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):672--675, November.",
}
@Article{Rubin:1979:CAD,
author = "Frank Rubin",
title = "Cryptographic Aspects of Data Compression Codes",
journal = j-CRYPTOLOGIA,
volume = "3",
number = "4",
pages = "202--205",
month = oct,
year = "1979",
CODEN = "CRYPE6",
DOI = "https://doi.org/10.1080/0161-117991854061",
ISSN = "0161-1194 (print), 1558-1586 (electronic)",
ISSN-L = "0161-1194",
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/;
https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "See also {\em Comm. ACM}, 19 (November 1976):
616--623.",
URL = "http://www.informaworld.com/smpp/content~content=a741902806~db=all~order=page",
acknowledgement = ack-nhfb,
fjournal = "Cryptologia",
journal-URL = "http://www.tandfonline.com/loi/ucry20",
romanvolume = "III",
xxtitle = "Crypto of Data Compression Codes",
xxtitle = "Experiments in Text File 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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302972664",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8002017",
subject = "Electrical engineering",
}
@Article{Tarjan:1979:APC,
author = "Robert Endre Tarjan",
title = "Applications of Path Compression on Balanced Trees",
journal = j-J-ACM,
volume = "26",
number = "4",
pages = "690--715",
month = oct,
year = "1979",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/322154.322161",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Wed Jan 15 18:12:53 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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 = ack-nhfb,
classification = "723; 921",
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "computer programming --- Subroutines; data processing;
mathematical techniques --- Trees",
}
@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;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Article{Dunham:1980:AAS,
author = "James G. Dunham",
title = "Abstract Alphabet Sliding-Block Entropy Compression
Coding with a Fidelity Criterion",
journal = j-ANN-PROBAB,
volume = "8",
number = "6",
pages = "1085--1092",
month = dec,
year = "1980",
CODEN = "APBYAE",
DOI = "https://doi.org/10.1214/aop/1176994570",
ISSN = "0091-1798 (print), 2168-894X (electronic)",
ISSN-L = "0091-1798",
bibdate = "Sun Apr 20 10:44:17 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/annprobab1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://projecteuclid.org/euclid.aop/1176994570",
acknowledgement = ack-nhfb,
fjournal = "Annals of Probability",
journal-URL = "http://projecteuclid.org/all/euclid.aop",
}
@Article{Frank:1980:PIT,
author = "Amalie J. Frank and J. D. Daniels and Diane R.
Unangst",
title = "Progressive Image Transmission Using a Growth-Geometry
Coding",
journal = j-PROC-IEEE,
volume = "68",
number = "7",
pages = "897--909",
month = jul,
year = "1980",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/proc.1980.11755",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "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
Growth-Geometry Coding,'' {\it Proceedings of the
IEEE}, {\bf68}(7):897--909, July.",
}
@Article{Hunter:1980:IDF,
author = "R. Hunter and A. H. Robinson",
title = "International Digital Facsimile Coding Standards",
journal = j-PROC-IEEE,
volume = "68",
number = "7",
pages = "854--867",
month = jul,
year = "1980",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/proc.1980.11751",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "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):854--867, July.",
}
@Article{Knowlton:1980:PTG,
author = "Kenneth Knowlton",
title = "Progressive Transmission of Grey-Scale and Binary
Pictures by Simple, Efficient, and Lossless Encoding
Schemes",
journal = j-PROC-IEEE,
volume = "68",
number = "7",
pages = "885--896",
month = jul,
year = "1980",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/proc.1980.11754",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Knowlton, Kenneth (1980) ``Progressive Transmission of
Grey-Scale and Binary Pictures by Simple, Efficient,
and Lossless Encoding Schemes,'' {\it Proceedings of
the IEEE}, {\bf68}(7):885--896, July.",
}
@Article{Linde:1980:AVQ,
author = "Y. Linde and A. Buzo and R. M. Gray",
title = "An Algorithm for Vector Quantization Design",
journal = j-IEEE-TRANS-COMM,
volume = "COM-28",
pages = "84--95",
month = jan,
year = "1980",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1980.1094577",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata-1 = "Linde,~Y., A. Buzo, and R. M. Gray (1980) ``An
Algorithm for Vector Quantization Design,'' {\it IEEE
Transactions on Communications}, {\bf COM-28}:84--95,
January.",
rawdata-2 = "Linde,~Y., A. Buzo, and R. M. Gray (1980) ``An
Algorithm for Vector Quantization Design,'' {\it IEEE
Transactions on Communications}, COM-28:84--95,
January.",
}
@PhdThesis{Marr:1980:TDP,
author = "James Douglas Marr",
title = "Two-Dimensional 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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303008916",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8105828",
subject = "Electrical engineering",
}
@Article{Netravali:1980:PCP,
author = "A. Netravali and J. O. Limb",
title = "Picture Coding: a Preview",
journal = j-PROC-IEEE,
volume = "68",
pages = "366--406",
year = "1980",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/proc.1980.11647",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "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}:366--406.",
}
@Article{Peterson:1980:CPD,
author = "James Lyle Peterson",
title = "Computer Programs for Detecting and Correcting
Spelling Errors",
journal = j-CACM,
volume = "23",
number = "12",
pages = "676--687",
month = dec,
year = "1980",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/359038.359041",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sun Feb 04 16:47:16 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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 = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Stout:1980:IPE,
author = "Quentin F. Stout",
title = "Improved Prefix Encodings of the Natural Numbers",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "26",
number = "5",
pages = "607--609",
month = sep,
year = "1980",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1980.1056237",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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):607--609, September.",
}
@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 = j-SIGMETRICS,
volume = "11",
number = "1",
pages = "64--72",
month = "Spring",
year = "1981",
CODEN = "????",
DOI = "https://doi.org/10.1145/800047.801694",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Thu Jun 26 10:58:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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
file-transfer 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 = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303098954",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8203266",
subject = "Electrical engineering",
}
@Article{Davis:1981:DCL,
author = "R. H. Davis and C. Rinaldi and C. J. Trebilcock",
title = "Data Compression in Limited Capacity Microcomputer
Systems",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "138--141",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(81)90043-0",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "723; 731; C6120 (File organisation); C6130 (Data
handling techniques); C7250L (Non-bibliographic
retrieval systems)",
corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh,
UK",
fjournal = "Information Processing Letters",
journal-URL = "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",
}
@Article{Dunlavey:1981:LES,
author = "Michael R. Dunlavey",
title = "Letter to the {Editor}: On Spelling Correction and
Beyond",
journal = j-CACM,
volume = "24",
number = "9",
pages = "608--608",
month = sep,
year = "1981",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/358746.383429",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sun Feb 04 16:48:13 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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 = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Eng:1981:SPB,
author = "K. Y. Eng and O. C. Yue",
title = "Spectral Properties and Band-Limiting Effects of
Time-Compressed {TV} Signals in a Time-Compression
Multiplexing System",
journal = j-BELL-SYST-TECH-J,
volume = "60",
number = "9",
pages = "2167--2185",
month = nov,
year = "1981",
CODEN = "BSTJAN",
DOI = "https://doi.org/10.1002/j.1538-7305.1981.tb00315.x",
ISSN = "0005-8580",
bibdate = "Tue Nov 9 11:15:56 MST 2010",
bibsource = "http://bstj.bell-labs.com/oldfiles/year.1981/BSTJ.1981.6009.html;
http://www.alcatel-lucent.com/bstj/vol60-1981/bstj-vol60-issue09.html;
https://www.math.utah.edu/pub/tex/bib/bstj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://bstj.bell-labs.com/BSTJ/images/Vol60/bstj60-9-2167.pdf;
http://www.alcatel-lucent.com/bstj/vol60-1981/articles/bstj60-9-2167.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Bell System Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}
@PhdThesis{Fong:1981:DOA,
author = "Chung-Bin Fong",
title = "The Decision Oriented Approach to
Information-Preserving 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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303140921",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8214505",
subject = "Electrical engineering",
}
@Article{Krichevsky:1981:PUC,
author = "R. E. Krichevsky and V. K. Trofimov",
title = "The Performance of Universal Coding",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-27",
pages = "199--207",
month = mar,
year = "1981",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1981.1056331",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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
IT-27}:199--207, March.",
}
@Article{Langdon:1981:CBW,
author = "Glen G. Langdon and ~and J. Rissanen",
title = "Compression of Black White Images with Arithmetic
Coding",
journal = j-IEEE-TRANS-COMM,
volume = "COM-29",
number = "6",
pages = "858--867",
month = jun,
year = "1981",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1981.1095052",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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
COM-29}(6):858--867, June.",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303164012",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8205240",
subject = "Electrical engineering",
}
@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 = "435--447",
year = "1981",
bibdate = "Fri Jan 12 07:50:27 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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 = ack-nhfb,
authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/l/Lynch:Clifford_A=.html;
http://www.vldb.org/dblp/db/indices/a-tree/b/Brownrigg:E=_B=.html",
}
@Article{Miller:1981:LES,
author = "Lance A. Miller",
title = "Letter to the {Editor}: On Spelling Correction and
Beyond",
journal = j-CACM,
volume = "24",
number = "9",
pages = "608--609",
month = sep,
year = "1981",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sun Feb 04 16:49:22 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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 = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Nix:1981:ESE,
author = "Robert P. Nix",
title = "Experience With a Space Efficient Way to Store a
Dictionary",
journal = j-CACM,
volume = "24",
number = "5",
pages = "297--298",
year = "1981",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/358645.358654",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Nix81;
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spell.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "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):297--298.",
remark = "Comment on \cite{Peterson:1981:LES}",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Nix81",
}
@Article{Peterson:1981:LES,
author = "James L. Peterson",
title = "Letter to the {Editor}: On Spelling Correction and
Beyond",
journal = j-CACM,
volume = "24",
number = "9",
pages = "609--609",
month = sep,
year = "1981",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sun Feb 04 16:49:21 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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 = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Reghbati:1981:ODC,
author = "H. K. Reghbati",
title = "An Overview of Data Compression Techniques",
journal = j-COMPUTER,
volume = "14",
number = "4",
pages = "71--76",
year = "1981",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/c-m.1981.220416",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Computer",
journal-URL = "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):71--76.",
}
@Article{Robinson:1981:ASC,
author = "P. J. Robinson and Dave Singer",
title = "Another Spelling Correction Program",
journal = j-CACM,
volume = "24",
number = "5",
pages = "296--297",
year = "1981",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/358645.358652",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#RobinsonS81;
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spell.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "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):296--297.",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RobinsonS81",
}
@Article{Rodeh:1981:LAD,
author = "Michael Rodeh and Vaughan R. Pratt and Shimon Even",
title = "Linear Algorithm for Data Compression via String
Matching",
journal = j-J-ACM,
volume = "28",
number = "1",
pages = "16--24",
month = jan,
year = "1981",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/322234.322237",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "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):16--24, January.",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303177936",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8124158",
subject = "Electrical engineering",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303174746",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8210265",
subject = "Electrical engineering",
}
@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 = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Data transmission equipment industry; United States;
Market surveys",
}
@Article{Bell:1982:KSC,
author = "D. A. Bell and S. M. Deen",
title = "Key Space Compression and Hashing in {PRECI}",
journal = j-COMP-J,
volume = "25",
number = "4",
pages = "486--492",
month = nov,
year = "1982",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/25.4.486",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:13 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/25/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://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 = ack-nhfb,
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",
journal-URL = "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; tool-kit; utilization",
treatment = "P Practical",
}
@Article{Ishii:1982:HED,
author = "Atsushi Ishii and Kenji Kouno and Yasunori Maezawa",
title = "Highly Efficient Data Compression Method for Newspaper
Image Data",
journal = j-FUJITSU-SCI-TECH-J,
volume = "V 18",
number = "N 2",
pages = "199--225",
month = jun,
year = "1982",
CODEN = "FUSTA4",
ISSN = "0016-2523",
bibdate = "Mon Dec 16 08:30:04 MST 1996",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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 = ack-nhfb,
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{Kundu:1982:CLM,
author = "S. Kundu",
title = "On a Class of Linear Maps for Data Compression",
journal = j-IEEE-TRANS-SOFTW-ENG,
volume = "SE-8",
number = "5",
pages = "530--532",
month = sep # "\slash " # oct,
year = "1982",
CODEN = "IESEDJ",
DOI = "https://doi.org/10.1109/TSE.1982.235877",
ISSN = "0098-5589 (print), 1939-3520 (electronic)",
ISSN-L = "0098-5589",
bibdate = "Thu Feb 1 08:07:37 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1702981",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Software Engineering",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}
@Article{Lloyd:1982:LSQ,
author = "S. P. Lloyd",
title = "Least Squares Quantization in {PCM}",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-28",
pages = "129--137",
month = mar,
year = "1982",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1982.1056489",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Lloyd, S. P. (1982) ``Least Squares Quantization in
PCM,'' {\it IEEE Transactions on Information Theory},
{\bf IT-28}:129--137, March.",
}
@Book{Mandelbrot:1982:FGN,
author = "Beno{\^\i}t B. Mandelbrot",
title = "The Fractal Geometry of Nature",
publisher = pub-W-H-FREEMAN,
address = pub-W-H-FREEMAN:adr,
pages = "v + 460",
year = "1982",
ISBN = "0-7167-1186-9",
ISBN-13 = "978-0-7167-1186-5",
LCCN = "QA447 .M25 1982; QA447 .M357 1982",
MRclass = "00A69 (51-01 54F45 85A35 86A99)",
MRnumber = "665254 (84h:00021)",
MRreviewer = "S. Dubuc",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://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 = ack-ds # " and " # ack-nhfb,
rawdata = "Mandelbrot, B. (1982) {\it The Fractal Geometry of
Nature}, San Francisco, CA, W. H. Freeman.",
remark = "Revised edition of \cite{Mandelbrot:1977:FFC}.",
}
@Article{Pechura:1982:FAT,
author = "Michael A. Pechura",
title = "File Archival Techniques Using Data Compression",
journal = j-CACM,
volume = "25",
number = "9",
pages = "605--609",
year = "1982",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/358628.358635",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jan 22 07:11:57 MST 2001",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Pechura82;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Pechura82",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Pechura82",
}
@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 = pub-IEEE,
address = pub-IEEE:adr,
pages = "1235--1238",
year = "1982",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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.
1235--1238.",
}
@Article{Storer:1982:DCT,
author = "James A. Storer and Thomas G. Szymanski",
title = "Data Compression via Textual Substitution",
journal = j-J-ACM,
volume = "29",
number = "4",
pages = "928--951",
month = oct,
year = "1982",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/322344.322346",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
rawdata-1 = "Storer, James A. and T. G. Szymanski (1982) ``Data
Compression via Textual Substitution,'' {\it Journal of
the ACM}, {\bf29}:928--951.",
rawdata-2 = "Storer, J. A., and T. G. Szymanski (1982) ``Data
Compression via Textual Substitution,'' {\it Journal of
the ACM} {\bf29}:928--951.",
}
@MastersThesis{Tao:1982:RTS,
author = "Bertram P. M. Tao",
title = "Real-Time 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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303109401",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "1319587",
subject = "Electrical engineering",
}
@Article{Wu:1982:ABA,
author = "J. K. Wu and R. E. Burge",
title = "Adaptive Bit Allocation for Image Compression",
journal = j-CGIP,
volume = "19",
number = "4",
pages = "392--400",
month = aug,
year = "1982",
CODEN = "CGIPBG",
DOI = "https://doi.org/10.1016/0146-664x(82)90024-7",
ISSN = "0146-664X",
ISSN-L = "0146-664X",
bibdate = "Fri Feb 7 08:36:21 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "Computer Graphics and Image Processing",
journal-URL = "http://www.sciencedirect.com/science/journal/0146664X",
journalabr = "Comput Graphics Image Process",
keywords = "image processing; pattern recognition systems",
}
@Article{Burt:1983:LPC,
author = "Peter J. Burt and Edward H. Adelson",
title = "The {Laplacian} Pyramid as a Compact Image Code",
journal = j-IEEE-TRANS-COMM,
volume = "COM-31",
number = "4",
pages = "532--540",
month = apr,
year = "1983",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1983.1095851",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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
COM-31}(4):532--540, April.",
}
@InProceedings{Dewitte:1983:OBC,
author = "J. Dewitte and J. Ronson",
editor = "H. W. Schussler",
booktitle = "Signal Processing II: Theories and
Applications---Proceedings of EUSIPCO 83",
title = "Original Block Coding Scheme for Low Bit Rate Image
Transmission",
publisher = pub-ELSEVIER-SCIENCE,
address = pub-ELSEVIER-SCIENCE:adr,
pages = "143--146",
year = "1983",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Dewitte, J., and J. Ronson (1983) ``Original Block
Coding Scheme for Low Bit Rate Image Transmission,''
{\it Signal Processing II: Theories and
Applications---Proceedings of EUSIPCO 83}, H. W.
Schussler, ed., Amsterdam, Elsevier Science Publishers
B. V. (North-Holland), pp. 143--146.",
}
@Article{Fraenkel:1983:TCP,
author = "Aviezri S. Fraenkel and Moshe Mor and Y. Perl",
title = "Is Text Compression by Prefixes and Suffixes
Practical?",
journal = j-ACTA-INFO,
volume = "20",
number = "4",
pages = "371--389",
month = dec,
year = "1983",
CODEN = "AINFA2",
DOI = "https://doi.org/10.1007/BF00264280",
ISSN = "0001-5903 (print), 1432-0525 (electronic)",
ISSN-L = "0001-5903",
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;
https://www.math.utah.edu/pub/tex/bib/actainfo.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
MathSciNet database",
series = "Monographs in Visual Communication",
acknowledgement = ack-nhfb,
fjournal = "Acta Informatica",
journal-URL = "http://link.springer.com/journal/236",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303265149",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8319202",
subject = "Electrical engineering",
}
@Article{Langdon:1983:ARL,
author = "Glenn G. Langdon",
title = "An Adaptive Run Length Coding Algorithm",
journal = j-IBM-TDB,
volume = "26",
number = "7B",
pages = "3783--3785",
month = dec,
year = "1983",
CODEN = "IBMTAA",
ISSN = "0018-8689",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IBM Technical Disclosure Bulletin",
rawdata = "Langdon, Glenn G. (1983a) ``An Adaptive Run Length
Coding Algorithm,'' {\it IBM Technical Disclosure
Bulletin}, {\bf26}(7B):3783--3785, December.",
}
@Article{Langdon:1983:NZL,
author = "Glen G. Langdon",
title = "A Note on the {Ziv--Lempel} Model for Compressing
Individual Sequences",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-29",
number = "2",
pages = "284--287",
month = mar,
year = "1983",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1983.1056645",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Langdon, Glen G. (1983) ``A Note on the Ziv-Lempel
Model for Compressing Individual Sequences,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT-29}(2):284--287, March.",
}
@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 = "0-315-06523-0",
ISBN-13 = "978-0-315-06523-9",
ISSN = "0227-3845",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "amicus.nlc-bnc.ca:210/NL; http://search.proquest.com/;
https://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 = ack-nhfb,
classification = "0537: Engineering",
dissertation-thesis-number = "MK54443",
subject = "Engineering",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303271798",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "8319226",
subject = "Computer science",
}
@Article{Storer:1983:TAT,
author = "J. A. Storer",
title = "Toward an abstract theory of data compression",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "3",
pages = "221--237",
month = aug,
year = "1983",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/0304-3975(83)90001-4",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
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",
journal-URL = "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",
}
@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 = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fibquart.bib",
note = "Translation by Halina Moss. Reprint of
\cite{Vorobev:1961:FN}.",
acknowledgement = ack-ds,
rawdata = "Vorobev, Nikolai N. (1983) in Ian N. Sneddon (ed.),
and Halina Moss (translator), {\it Fibonacci Numbers},
New Classics Library.",
xxauthor = "Nikolai N. Vorobiev",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303289543",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8426762",
subject = "Electrical engineering",
}
@Article{Cleary:1984:DCU,
author = "John G. Cleary and I. H. Witten",
title = "Data Compression Using Adaptive Coding and Partial
String Matching",
journal = j-IEEE-TRANS-COMM,
volume = "COM-32",
number = "4",
pages = "396--402",
month = apr,
year = "1984",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1984.1096090",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata-1 = "Cleary, John G., and I. H. Witten (1984) ``Data
Compression Using Adaptive Coding and Partial String
Matching,'' {\it IEEE Transactions on Communications},
{\bf COM-32}(4):396--402, April.",
rawdata-2 = "Cleary, J. G., and I. H. Witten (1984) ``Data
Compression Using Adaptive Coding and Partial String
Matching,'' {\it IEEE Transactions on Communications}
COM-32(4):396--402, April.",
}
@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 = "https://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
multimillion-dollar 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 = ack-nhfb,
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303316909",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8524758",
subject = "Electrical engineering",
}
@Article{Ernvall:1984:ELM,
author = "J. Ernvall and O. Nevalainen",
title = "Estimating the length of minimal spanning trees in
compression of files",
journal = j-BIT,
volume = "24",
number = "1",
pages = "19--32",
month = mar,
year = "1984",
CODEN = "BITTEL, NBITAB",
DOI = "https://doi.org/10.1007/BF01934512",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
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=0006-3835&volume=24&issue=1;
https://www.math.utah.edu/pub/tex/bib/bit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=24&issue=1&spage=19",
acknowledgement = ack-nhfb,
fjournal = "BIT (Nordisk tidskrift for informationsbehandling)",
journal-URL = "http://link.springer.com/journal/10543",
}
@Article{Ferguson:1984:SSH,
author = "T. J. Ferguson and J. H. Rabinowitz",
title = "Self-Synchronizing {Huffman} codes",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "30",
number = "4",
pages = "687--693",
month = jul,
year = "1984",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1984.1056931",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Ferguson, T. J. and J. H. Rabinowitz (1984)
``Self-Synchronizing Huffman codes,'' {\it IEEE
Transactions on Information Theory},
{\bf30}(4):687--693, July.",
}
@InProceedings{Gamal:1984:IDC,
author = "A. El Gamal and A. Orlitsky",
title = "Interactive Data Compression",
crossref = "IEEE:1984:ASF",
pages = "100--108",
year = "1984",
bibdate = "Thu Apr 5 06:13:39 MDT 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Article{Gharavi:1984:CVL,
author = "H. Gharavi",
title = "Conditional variable-length coding for gray-level
pictures",
journal = j-ATT-BELL-LAB-TECH-J,
volume = "63",
number = "2",
pages = "249--260",
year = "1984",
CODEN = "ABLJER",
DOI = "https://doi.org/10.1002/j.1538-7305.1984.tb00093.x",
ISSN = "0748-612X (print), 2376-7162 (electronic)",
ISSN-L = "0748-612X",
bibdate = "Fri Nov 12 09:17:39 2010",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/bstj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "This paper presents a new variable-length coding
algorithm for bit-rate 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 3-bit DPCM
encoded picture, a bit rate of 1.64 bits/picture
element is achieved.",
acknowledgement = ack-nhfb,
fjournal = "AT\&T Bell Laboratories Technical Journal",
keywords = "data processing --- code converters; pulse code
modulation",
subject = "conditional variable-length coding; digital image
reduction; gray-level picture coding",
topic = "image processing",
}
@Misc{ISO:1984:IPS,
author = "ISO",
title = "Information Processing Systems --- Data Communication
High-Level Data Link Control Procedure-Frame Structure:
{IS 3309}",
edition = "Third",
pages = "??",
month = oct,
year = "1984",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "ISO (1984) ``Information Processing Systems-Data
Communication High-Level Data Link Control
Procedure-Frame Structure,'' IS 3309, 3rd ed.,
October.",
}
@Book{Knuth:1984:TB,
author = "Donald E. Knuth",
title = "The {\TeX}book",
volume = "{\noopsort{1984a}}A",
publisher = pub-AW,
address = pub-AW:adr,
pages = "ix + 483",
year = "1984",
ISBN = "0-201-13447-0 (hardcover), 0-201-13448-9 (paperback)",
ISBN-13 = "978-0-201-13447-6 (hardcover), 978-0-201-13448-3
(paperback)",
LCCN = "Z253.4.T47 K58 1986",
bibdate = "Wed Dec 15 10:36:52 1993",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
note = "Second printing, revised, October 1984. Sixth
printing, revised, January 1986; also published as {\sl
Computers \& Typesetting}, Vol.~A. Twenty-fourth
printing, summer 1993, contains final revisions.
Twenty-first printing, June 1992.",
price = "US\$15.95 (paperback), US\$32.95 (hardcover)",
series = "Computers and Typesetting",
acknowledgement = ack-nhfb,
keywords = "computerized typesetting; documentation; languages;
mathematics printing -- computer programs; TeX
(computer file)",
remark = "See translations
\cite{Knuth:1989:TBK,Knuth:1993:VT}.",
subject = "TeX (Computer file); TeX (Logiciel); TeX (Computer
file); Computerized typesetting; Mathematics printing;
Computer programs; Imprimerie; Composition automatique;
Math{\'e}matiques; Impression; Logiciels;
Math{\'e}matiques; Imprimerie; Computerized
typesetting; Computer programs; TeX (logiciel); TeX;
I.7.2 Computing Methodologies, TEXT PROCESSING,
Document Preparation \\ J.7 Computer Applications,
COMPUTERS IN OTHER SYSTEMS, Publishing \\ I.7.1
Computing Methodologies, TEXT PROCESSING, Text
Editing",
tableofcontents = "1: The Name of the Game / 1 \\
2: Book Printing versus Ordinary Typing / 3 \\
3: Controlling \TeX{} / 7 \\
4: Fonts of Type / 13 \\
5: Grouping / 19 \\
6: Running \TeX{} / 23 \\
7: How \TeX{} Reads What You Type / 37 \\
8: The Characters You Type / 43 \\
9: \TeX{}'s Roman Fonts / 51 \\
10: Dimensions / 57 \\
11: Boxes / 63 \\
12: Glue / 69 \\
13: Modes / 85 \\
14: How \TeX{} Breaks Paragraphs into Lines / 91 \\
15: How \TeX{} Makes Lines into Pages / 109 \\
16: Typing Math Formulas / 127 \\
17: More about Math / 139 \\
18: Fine Points of Mathematics Typing / 161 \\
19: Displayed Equations / 185 \\
20: Definitions (also called Macros) / 199 \\
21: Making Boxes / 221 \\
22: Alignment / 231 \\
23: Output Routines / 251 \\
24: Summary of Vertical Mode / 267 \\
25: Summary of Horizontal Mode / 285 \\
26: Summary of Math Mode / 289 \\
27: Recovery from Errors / 295 \\
Appendices \\
A: Answers to All the Exercises / 305 \\
B: Basic Control Sequences / 339 \\
C: Character Codes / 367 \\
D: Dirty Tricks / 373 \\
E: Example Formats / 403 \\
F: Font Tables / 427 \\
G: Generating Boxes from Formulas / 441 \\
H: Hyphenation / 449 \\
I: Index / 457 \\
J: Joining the \TeX{} Community / 483",
}
@TechReport{Langdon:1984:PVM,
author = "Glen G. Langdon",
title = "On Parsing vs. Mixed-Order Model Structures for Data
Compression",
type = "IBM research report",
number = "RJ-4163 (46091)",
institution = pub-IBM,
address = pub-IBM:adr,
pages = "??",
day = "18",
month = jan,
year = "1984",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Langdon, Glen G. (1984) {\it On Parsing vs.
Mixed-Order Model Structures for Data Compression}, IBM
research report RJ-4163 (46091), January 18, 1984, San
Jose, CA.",
}
@PhdThesis{Liang:1984:WHP,
author = "Franklin Mark Liang",
title = "Word Hy-phen-a-tion by Com-pu-ter",
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 = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://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 `c-c' 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 = ack-nhfb,
}
@Article{Smith:1984:PFF,
author = "Alvy Ray {Smith III}",
title = "Plants, Fractals, and Formal Languages",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "18",
number = "3",
pages = "1--10",
month = jul,
year = "1984",
CODEN = "CGRADI, CPGPBZ",
DOI = "https://doi.org/10.1145/964965.808571",
ISSN = "0097-8930 (print), 1558-4569 (electronic)",
ISSN-L = "0097-8930",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Ai/alife.bib;
https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://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 = ack-ds,
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",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
keyword = "fractals; models-graphics; plants; automata-theory",
rawdata = "Smith, Alvy Ray (1984) ``Plants, Fractals and Formal
Languages,'' {\it Computer Graphics},
{\bf18}(3):1--10.",
xxauthor = "Alvy Ray Smith",
}
@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 = "https://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 = ack-nhfb,
}
@Article{Welch:1984:THP,
author = "Terry A. Welch",
title = "A Technique for High-Performance Data Compression",
journal = j-COMPUTER,
volume = "17",
number = "6",
pages = "8--19",
month = jun,
year = "1984",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.1984.1659158",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
rawdata = "Welch, T. A. (1984) ``A Technique for High-Performance
Data Compression,'' {\it IEEE Computer},
{\bf17}(6):8--19, June.",
remark = "This is the paper with the Lempel--Ziv--Welch (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
1977--1978.\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/nph-Parser?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 PostScript-producing 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 patent-free
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 Burrows--Wheeler
block-sorting 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 16-Jan-2003).\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}.",
}
@Article{Bassiouni:1985:DCS,
author = "M. A. Bassiouni",
title = "Data Compression in Scientific and Statistical
Databases",
journal = j-IEEE-TRANS-SOFTW-ENG,
volume = "SE-11",
number = "10",
pages = "1047--1058",
month = oct,
year = "1985",
CODEN = "IESEDJ",
DOI = "https://doi.org/10.1109/TSE.1985.231852",
ISSN = "0098-5589 (print), 1939-3520 (electronic)",
ISSN-L = "0098-5589",
bibdate = "Thu Feb 1 08:07:37 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1701920",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Software Engineering",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}
@Book{Berstel:1985:TC,
author = "Jean Berstel and Dominique Perrin",
title = "Theory of Codes",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "??",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Berstel, Jean and Dominique Perrin (1985) {\it Theory
of Codes}, Orlando, FL, Academic Press.",
}
@Book{Cappellini:1985:DCE,
editor = "Vito Cappellini",
title = "Data compression and error control techniques with
applications",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "xiv + 304",
year = "1985",
ISBN = "0-12-159260-X",
ISBN-13 = "978-0-12-159260-8",
LCCN = "TK5102.5 .D336 1985",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "clas.caltech.edu:210/INNOPAC;
clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Data compression (Telecommunication); Coding theory;
Error-correcting codes (Information theory)",
}
@InProceedings{Choueka:1985:EVH,
author = "Y. Choueka and Shmuel T. Klein and Y. Perl",
booktitle = "Proceedings of the 8th ACM-SIGIR Conference,
Montr{\'e}al, QC, Canada",
title = "Efficient Variants of {Huffman} Codes in High Level
Languages",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "122--130",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Choueka Y., Shmuel T. Klein, and Y. Perl (1985)
``Efficient Variants of Huffman Codes in High Level
Languages,'' {\it Proceedings of the 8th ACM-SIGIR
Conference}, Montreal, pp. 122--130.",
}
@Article{Cole:1985:NPP,
author = "A. J. Cole",
title = "A Note on {Peano} Polygons and Gray Codes",
journal = j-INT-J-COMPUT-MATH,
volume = "18",
pages = "3--13",
year = "1985",
CODEN = "IJCMAT",
DOI = "https://doi.org/10.1080/00207168508803475",
ISSN = "0020-7160",
ISSN-L = "0020-7160",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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}:3--13.",
}
@Article{Cormack:1985:DCD,
author = "Gordon V. Cormack",
title = "Data compression on a database system",
journal = j-CACM,
volume = "28",
number = "12",
pages = "1336--1342",
month = dec,
year = "1985",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/214956.214963",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/214963.html",
acknowledgement = ack-nhfb,
annote = "first partition into IMS based types, then Huffman.
Gives factor two space, adds 17pct time.",
fjournal = "Communications of the ACM",
journal-URL = "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{Cottingham:1985:CDS,
author = "Marion S. Cottingham",
title = "A Compressed Data Structure for Surface
Representation",
journal = j-CGF,
volume = "4",
number = "3",
pages = "217--228",
month = sep,
year = "1985",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.1985.tb00222.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Mon Apr 14 10:23:20 MDT 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
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; 28-29 March 1985",
conftitle = "EUROGRAPHICS (UK) Conference",
corpsource = "Dept. of Comput. Sci., Glasgow Univ., UK",
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
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",
}
@Article{Demko:1985:CFO,
author = "Stephen Demko and Laurie Hodges and Bruce Naylor",
title = "Construction of Fractal Objects with Iterated Function
Systems",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "19",
number = "3",
pages = "271--278",
month = jul,
year = "1985",
CODEN = "CGRADI, CPGPBZ",
DOI = "https://doi.org/10.1145/325165.325245",
ISSN = "0097-8930 (print), 1558-4569 (electronic)",
ISSN-L = "0097-8930",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Graphics/imager/imager.85.bib; http://portal.acm.org/;
https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
conference = "held in San Francisco, CA; 22--26 July 1985",
fjournal = "Computer Graphics",
journal-URL = "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):271--278, July.",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303423885",
acknowledgement = ack-nhfb,
classification = "0300: Audiology; 0537: Engineering",
dissertation-thesis-number = "8602315",
subject = "Engineering; Audiology",
}
@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 Bit-Strings---Preliminary
Report",
volume = "12",
publisher = pub-SV,
address = pub-SV:adr,
pages = "169--183",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "NATO ASI Series F",
acknowledgement = ack-ds,
rawdata = "Fraenkel, A. S., and S. T. Klein (1985) ``Novel
Compression of Sparse Bit-Strings---Preliminary
Report,'' in A. Apostolico and Z. Galil, eds. {\it
Combinatorial Algorithms on Words}, Vol. 12, NATO ASI
Series F:169--183, New York, Springer-Verlag.",
}
@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 = "CS85-16",
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 = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Fraenkel, A. S. and Shmuel T. Klein (1985a) ``Robust
Universal Complete Codes as Alternatives to Huffman
Codes,'' Tech. Report CS85-16, Dept. of Applied
Mathematics, Weizmann Institute of Science, October.",
}
@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 = "0-315-23105-X",
ISBN-13 = "978-0-315-23105-4",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303433066",
acknowledgement = ack-nhfb,
classification = "0399: Library science",
dissertation-thesis-number = "ML23105",
subject = "Library science",
}
@Article{GonzalezSmith:1985:PAD,
author = "M. E. {Gonzalez Smith} and J. A. Storer",
title = "Parallel Algorithms for Data Compression",
journal = j-J-ACM,
volume = "32",
number = "2",
pages = "344--373",
month = apr,
year = "1985",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/3149.3152",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Wed Jan 15 18:12:53 MST 1997",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/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 = ack-nhfb,
affiliationaddress = "Brandeis Univ, Waltham, MA, USA",
classification = "723",
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "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.",
}
@Misc{IEEE754:1985:ISB,
author = "IEEE754",
title = "{ANSI/IEEE Standard 754-1985}: {IEEE} Standard for
Binary Floating-Point Arithmetic.",
pages = "??",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "IEEE754 (1985) ANSI/IEEE Standard 754-1985, ``IEEE
Standard for Binary Floating-Point Arithmetic.''",
}
@Article{Jakobsson:1985:CCS,
author = "Matti Jakobsson",
title = "Compression of Character Strings by an Adaptive
Dictionary",
journal = j-BIT,
volume = "25",
number = "4",
pages = "593--603",
month = dec,
year = "1985",
CODEN = "BITTEL, NBITAB",
DOI = "https://doi.org/10.1007/BF01936138",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=25&issue=4;
https://www.math.utah.edu/pub/tex/bib/bit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=25&issue=4&spage=593",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "BIT (Nordisk tidskrift for informationsbehandling)",
journal-URL = "http://link.springer.com/journal/10543",
rawdata = "Jakobsson, Matti (1985) ``Compression of Character
Strings by an Adaptive Dictionary,'' {\it BIT},
{\bf25}(4):593--603, december.",
}
@Article{Knuth:1985:DHC,
author = "Donald E. Knuth",
title = "Dynamic {Huffman} Coding",
journal = j-J-ALG,
volume = "6",
number = "2",
pages = "163--180",
month = jun,
year = "1985",
CODEN = "JOALDV",
DOI = "https://doi.org/10.1016/0196-6774(85)90036-7",
ISSN = "0196-6774 (print), 1090-2678 (electronic)",
ISSN-L = "0196-6774",
MRclass = "94B45 (94A24)",
MRnumber = "86g:94050",
MRreviewer = "T. Nemetz",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jalg.bib;
MathSciNet database",
URL = "http://www.sciencedirect.com/science/article/pii/0196677485900367",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Journal of Algorithms",
journal-URL = "http://www.sciencedirect.com/science/journal/01966774",
keywords = "algorithms; theory",
rawdata-1 = "Knuth, Donald E. (1985) ``Dynamic Huffman Coding,''
{\it Journal of Algorithms}, {\bf6}:163--180.",
rawdata-2 = "Knuth, D. E. (1985) ``Dynamic Huffman Coding,'' {\it
Journal of Algorithms} {\bf6}:163--180.",
review = "ACM CR 8610-0919",
subject = "E Data, Coding and Information Theory",
}
@Article{McIntyre:1985:DCU,
author = "David R. McIntyre and Michael A. Pechura",
title = "Data compression using static {Huffman} code-decode
tables",
journal = j-CACM,
volume = "28",
number = "6",
institution = "Cleveland St U",
pages = "612--616",
month = jun,
year = "1985",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3812.3815",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/3815.html",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; experimentation; image information;
measurement; performance; statistics",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf D.3.m}: Software,
PROGRAMMING LANGUAGES, Miscellaneous.",
}
@InProceedings{Miller:1985:VTZ,
author = "V. S. Miller and M. N. Wegman",
editor = "A. Apostolico and Z. Galil",
booktitle = "Combinatorial Algorithms on Words",
title = "Variations On a Theme by {Ziv} and {Lempel}",
volume = "F12",
publisher = pub-SV,
address = pub-SV:adr,
bookpages = "????",
pages = "131--140",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "NATO ASI series",
acknowledgement = ack-ds,
rawdata = "Miller, V. S., and M. N. Wegman (1985) ``Variations On
a Theme by Ziv and Lempel,'' in A. Apostolico and Z.
Galil, eds., NATO ASI series Vol. F12, {\it
Combinatorial Algorithms on Words}, Berlin, Springer,
pp. 131--140.",
}
@Book{Pohlmann:1985:PDA,
author = "Ken Pohlmann",
title = "Principles of Digital Audio",
publisher = pub-SAMS,
address = pub-SAMS:adr,
pages = "??",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Pohlmann, Ken (1985) {\it Principles of Digital
Audio}, Indianapolis, IN, Howard Sams \& Co.",
}
@PhdThesis{Ramamurthi:1985:VQI,
author = "Bhaskar Ramamurthi",
title = "Vector Quantization of Images Based on a Composite
Source Model (Coding, Data Compression, Picture)",
type = "{Ph.D.} thesis",
school = "University of California, Santa Barbara",
address = "Santa Barbara, USA",
pages = "377",
year = "1985",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303336232",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8605950",
subject = "Electrical engineering",
}
@Article{Rokicki:1985:PPF,
author = "Tomas Rokicki",
title = "Packed ({{\tt PK}}) Font File Format",
journal = j-TUGboat,
volume = "6",
number = "3",
pages = "115--120",
month = nov,
year = "1985",
CODEN = "????",
ISSN = "0896-3207",
ISSN-L = "0896-3207",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tugboat.bib",
URL = "http://www.tug.org/TUGboat/Articles/tb06-3/tb13pk.pdf",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "TUGboat",
rawdata = "Rokicki, Tomas (1985) ``Packed (PK) Font File
Format,'' {\it TUGboat}, {\bf6}(3):115--120. Available
at
|http://www.tug.org/TUGboat/Articles/tb06-3/tb13pk.pdf|.",
}
@Article{Samet:1985:DSQ,
author = "Hanan Samet",
title = "Data structures for quadtree approximation and
compression",
journal = j-CACM,
volume = "28",
number = "9",
institution = "U Md",
pages = "973--993",
month = sep,
year = "1985",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/4284.4290",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jan 27 13:21:19 1997",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/84.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/4290.html",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; image approximation; theory",
subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf E.4}:
Data, CODING AND INFORMATION THEORY, Data compaction
and compression. {\bf I.2.10}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Vision and Scene
Understanding, Representations, data structures, and
transforms. {\bf I.4.2}: Computing Methodologies, IMAGE
PROCESSING, Compression (Coding), Approximate methods.
{\bf I.4.2}: Computing Methodologies, IMAGE PROCESSING,
Compression (Coding), Exact coding.",
}
@Article{Savoji:1985:DMB,
author = "M. H. Savoji and R. E. Burge",
title = "On Different Methods Based on the {Karhunen-Loeve}
Expansion and Used in Image Analysis",
journal = j-CVGIP,
volume = "29",
number = "2",
pages = "259--269",
month = feb,
year = "1985",
CODEN = "CVGPDB",
DOI = "https://doi.org/10.1016/0734-189x(85)90121-5",
ISSN = "0734-189X",
ISSN-L = "0734-189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database; Graphics/rosenfeld/1985.bib;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "U London",
affiliationaddress = "Queen Elizabeth Coll, Dep of Physics, London,
Engl",
classification = "716; 718; 723",
fjournal = "Computer Vision, Graphics, and Image Processing",
journal-URL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "data compression; eigendata problem; image analysis;
image processing; image transformation, space
frequency, digital; Karhunen-Loeve expansion; pattern
recognition; signal processing",
}
@Article{Todd:1985:PRC,
author = "Stephen Todd and Glen G. {Langdon, Jr.} and Jorma
Rissanen",
title = "Parameter Reduction and Context Selection for
Compression of Gray-Scale Images",
journal = j-IBM-JRD,
volume = "29",
number = "2",
pages = "188--193",
month = mar,
year = "1985",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.292.0188",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "In the compression of multilevel (color or gray) image
data, effective compression is obtained economically by
judicial selection of the predictor and the
conditioning states or contexts which determine what
probability distribution to use for the prediction
error. The authors provide a cost-effective approach to
the following two problems: (1) to reduce the number of
coding parameters to describe a distribution when
several contexts are involved, and (2) to choose
contexts for which variations in prediction error
distributions are expected. They solve Problem 1
(distribution description) by a partition of the range
of values of the outcomes into equivalence classes,
called buckets. The result is a special decomposition
of the error range. Cost-effectiveness is achieved by
using the many contexts only to predict the bucket
(equivalence class) probabilities. They solve Problem 2
(economical contexts) by using the buckets of the
surrounding pixels as components of the conditioning
class. The bucket values have the desirable properties
needed for the error distributions.",
acknowledgement = ack-nhfb,
affiliation = "IBM, United Kingdom Scientific Cent, Winchester,
Engl",
affiliationaddress = "IBM, United Kingdom Scientific Cent, Winchester,
Engl",
classcodes = "B6140C (Optical information, image and video signal
processing); C1250 (Pattern recognition)",
classification = "723; 741",
corpsource = "IBM UK Sci. Centre, Winchester, UK",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "Analysis; buckets; classes; coding; compression;
conditioning class; context selection; data
compression; encoding; equivalence; error
distributions; gray-scale images; image processing;
parameter reduction; parameters; picture processing;
prediction error distributions",
treatment = "T Theoretical or Mathematical",
}
@TechReport{Wong:1985:FSCb,
author = "Willard Lee Wong",
title = "Font Storage, Compression, and Scaling for Networked
Professional Workstations",
type = "Report",
number = "UIUCDCS-R-85-1201",
institution = "Dept. of Computer Science, University of Illinois at
Urbana-Champaign",
address = "Urbana, IL, USA",
pages = "v + 80",
month = apr,
year = "1985",
bibdate = "Wed Feb 28 15:00:20 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
Techreports/Uiuc.Tr.bib;
Techreports/university-of-illinois-urbana-champagne.bib",
acknowledgement = ack-nhfb,
annote = "Originally presented as the author's thesis (M.S.) ---
University of Illinois at Urbana-Champaign, 1985.
``April 1985.'' ``UILU-ENG-85-1712.'' --- Cover.
Bibliography: p. 80.",
keywords = "Data compression (Computer science); Data transmission
systems.; Information storage and retrieval systems.",
}
@Article{Young:1985:MFF,
author = "D. M. Young",
title = "{MacWrite} File Format",
journal = "Wheels for the Mind",
volume = "1",
pages = "34",
month = "Fall",
year = "1985",
CODEN = "????",
ISSN = "0891-8805",
ISSN-L = "0891-8805",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Young, D. M. (1985) ``MacWrite File Format,'' {\it
Wheels for the Mind}, {\bf1}:34, Fall.",
remark = "Discontinued periodical from Apple Computer.",
}
@MastersThesis{Aitken:1986:PMD,
author = "Robert Campbell Aitken",
title = "Performance measures of data compression techniques in
fault detection",
type = "Thesis ({M.Sc.})",
school = "University of Victoria",
address = "Victoria, BC, Canada",
pages = "????",
year = "1986",
ISBN = "0-315-31695-0",
ISBN-13 = "978-0-315-31695-9",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "0399: Library science",
subject = "Library science",
}
@Article{Amsterdam:1986:DCH,
author = "Jonathan Amsterdam",
title = "Data Compression with {Huffman} Coding",
journal = j-BYTE,
volume = "11",
number = "5",
pages = "99--108",
month = may,
year = "1986",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibsource = "https://www.math.utah.edu/pub/tex/bib/byte1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "BYTE Magazine",
}
@Article{Anonymous:1986:CDF,
author = "Anonymous",
title = "Compression\slash Decompression of Font Patterns",
journal = j-IBM-TDB,
volume = "28",
number = "8",
pages = "3563--3564",
month = jan,
year = "1986",
CODEN = "IBMTAA",
ISSN = "0018-8689",
bibdate = "Mon Dec 16 08:30:04 MST 1996",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
abstract = "This article describes the generation or decompression
of font patterns from the compressed form data
including control bytes and data bytes.",
acknowledgement = ack-nhfb,
classification = "722; 723",
fjournal = "IBM Technical Disclosure Bulletin",
journalabr = "IBM Tech Discl Bull",
keywords = "compressed form data; compression/decompression;
control bytes; data bytes; Data Handling; data
processing; font patterns; information theory --- Data
Compression",
}
@Article{Anonymous:1986:DOD,
author = "Anonymous",
title = "Don't overlook data compression",
journal = j-COMPUT-SECUR,
volume = "5",
number = "1",
pages = "8--9",
month = mar,
year = "1986",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/0167404886901100",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Book{Anshel:1986:MIP,
editor = "Michael Anshel and William Gewirtz",
title = "Mathematics of information processing",
volume = "34",
publisher = pub-AMS,
address = pub-AMS:adr,
pages = "xi + 233",
year = "1986",
ISBN = "0-8218-0086-8",
ISBN-13 = "978-0-8218-0086-7",
LCCN = "QA76.9.M35 M39 1986",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "Proceedings of symposia in applied mathematics,
0160-7634; AMS short course lecture notes",
acknowledgement = ack-nhfb,
subject = "Computer science; Mathematics; Congresses",
tableofcontents = "Diameters of communication networks / F. R. K.
Chung \\
The theory of data dependencies / Ronald Fagin and
Moshe Y. Vardi \\
Transaction management / Hector Garcia-Molina \\
Fundamental database issues / Barry E. Jacobs \\
Data compression algorithms / Victor S. Miller \\
Application of category theory of structural sets to
modelling of information bases of systems / Augustin A.
Tuzhilin",
}
@Article{Bell:1986:BOT,
author = "Timothy C. Bell",
title = "Better {OPM/L} Text Compression",
journal = j-IEEE-TRANS-COMM,
volume = "34",
number = "12",
pages = "1176--1182",
month = dec,
year = "1986",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1986.1096485",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Bell, Timothy C. (1986) ``Better OPM/L Text
Compression,'' {\it IEEE Transactions on
Communications}, {\bf34}(12):1176--1182, December.",
}
@Article{Bentley:1986:LAD,
author = "Jon Louis Bentley and Daniel D. Sleator and Robert E.
Tarjan and Victor K. Wei",
title = "A Locally Adaptive Data Compression Scheme",
journal = j-CACM,
volume = "29",
number = "4",
pages = "320--330",
month = apr,
year = "1986",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/5684.5688",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
MRclass = "68P99 (94A24)",
MRnumber = "87e:68020",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/5688.html",
abstract = "A data compression scheme that exploits locality of
reference, such as occurs when words are used
frequently over short intervals and then fall into long
periods of disuse, is described. The scheme is based on
a simple heuristic for self-organizing sequential
search and on variable-length encodings of integers. We
prove that it never performs much worse than Huffman
coding and can perform substantially better;
experiments on real files show that its performance is
usually quite close to that of Huffman coding. Our
scheme has many implementation advantages: it is
simple, allows fast encoding and decoding, and requires
only one pass over the data to be compressed (static
Huffman coding takes two passes).",
acknowledgement = ack-ds # " and " # ack-nhfb,
annote = "Exploits locality of reference when words are used
frequently over short intervals; is based on a
self-organizing search and on variable-length encodings
of integers. Its performance is close to that of
Huffman coding. Requires only one pass over the data.",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; experimentation; image information;
measurement; performance; statistics; theory",
rawdata = "Bentley, J. L. et al. (1986) ``A Locally Adaptive Data
Compression Algorithm,'' {\it Communications of the
ACM}, {\bf29}(4):320--330, April.",
review = "ACM CR 8610-0918",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf E.1}: Data, DATA
STRUCTURES, Lists.",
}
@Article{Cheng:1986:AAZ,
author = "L. M. Cheng and A. S. Ho and R. E. Burge",
title = "An Adaptive Asteroid Zonal Filter for Data
Compression",
journal = j-CVGIP,
volume = "34",
number = "3",
pages = "292--301",
month = jun,
year = "1986",
CODEN = "CVGPDB",
DOI = "https://doi.org/10.1016/s0734-189x(86)80044-5",
ISSN = "0734-189X",
ISSN-L = "0734-189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database; Graphics/rosenfeld/1986.bib;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "King's Coll",
affiliationaddress = "King's Coll, London, Engl",
classification = "723",
fjournal = "Computer Vision, Graphics, and Image Processing",
journal-URL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "adaptive asteroid zonal filter; codes, symbolic ---
Encoding; data compression; image approximation; image
processing; information theory --- Data Compression;
transform image coding",
}
@Article{Cole:1986:DTB,
author = "A. J. Cole",
title = "Direct Transformations Between Sets of Integers and
{Hilbert} Polygons",
journal = j-INT-J-COMPUT-MATH,
volume = "20",
pages = "115--122",
year = "1986",
CODEN = "IJCMAT",
DOI = "https://doi.org/10.1080/00207168608803536",
ISSN = "0020-7160",
ISSN-L = "0020-7160",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "International Journal of Computer Mathematics",
rawdata = "Cole, A. J. (1986) ``Direct Transformations Between
Sets of Integers and Hilbert Polygons,'' {\it
International Journal of Computer Mathematics},
{\bf20}:115--122.",
}
@TechReport{Cormack:1986:DCU,
author = "Gordon V. Cormack",
title = "Data compression using dynamic {Markov} modelling",
volume = "CS-86-18",
institution = "Faculty of Mathematics, University of Waterloo",
address = "Waterloo, ON, Canada",
pages = "19",
year = "1986",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlc-bnc.ca:210/NL;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Research report",
acknowledgement = ack-nhfb,
}
@Book{Knuth:1986:CMT,
author = "Donald E. Knuth",
title = "{Computer Modern} Typefaces",
volume = "E",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xv + 588",
year = "1986",
ISBN = "0-201-13446-2",
ISBN-13 = "978-0-201-13446-9",
LCCN = "Z250.8.M46 K574 1986",
bibdate = "Wed Dec 15 10:37:33 1993",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/litprog.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
series = "Computers and Typesetting",
acknowledgement = ack-nhfb,
keywords = "Font editors.; METAFONT.; Phototypesetting ---
Applications of microcomputer systems",
remark = "Reprinted with corrections July, 1987. Incorporates
the final corrections made in 1992.",
tableofcontents = "Introduction to the Parameters / 1 \\
Organization of the Files / 8 \\
Parameter Files / 10 \\
Driver Files / 36 \\
{\tt roman}: Roman text and typewriter text / 36 \\
{\tt title}: Caps and digits only / 38 \\
{\tt texset} : Extended ASCII character set / 38 \\
{\tt csc}: Caps and small caps / 40 \\
{\tt textit}: Italic text and typewriter text / 41 \\
{\tt mathit}: Math italic / 42 \\
{\tt mathsy}: Math symbols / 44 \\
{\tt mathex}: Math extension characters / 44 \\
Program Files / 46 \\
{\tt accent}: Accents common to roman and italic / 49
\\
{\tt bigacc}: Wide accents for math extension font / 63
\\
{\tt bigdel}: Delimiters for math extension font / 66
\\
{\tt bigop}: Operators for math extension font / 103
\\
{\tt calu}: Calligraphic capitals / 123 \\
{\tt comlig}: Ligatures common to roman and italic /
141 \\
{\tt cscspu}: Special uppercase for caps and small caps
/ 145 \\
{\tt greekl}: Lowercase Greek / 147 \\
{\tt greeku}: Upper case Greek / 171 \\
{\tt itald}: Italic digits / 193 \\
{\tt italig}: Italic f-ligatures / 199 \\
{\tt itall}: Italic lowercase / 209 \\
{\tt italms}: Italic math specials / 233 \\
{\tt italp}: Italic punctuation / 239 \\
{\tt italsp}: Special lowercase for italic / 245 \\
{\tt olddig}: Oldstyle digits / 251 \\
{\tt punct}: Punctuation common to roman and italic /
265 \\
{\tt romand}: Roman digits / 285 \\
{\tt romanl}: Roman lowercase / 305 \\
{\tt romanp}: Roman punctuation / 361 \\
{\tt romanu}: Roman uppercase / 369 \\
{\tt romlig}: Roman f-ligatures / 421 \\
{\tt romms}: Roman math specials / 431 \\
{\tt romspl}: Special lowercase for roman / 443 \\
{\tt romspu}: Special uppercase for roman / 451 \\
{\tt romsub}: Substitutes for ligatures / 457 \\
{\tt sym}: Math symbols common to several fonts / 459
\\
{\tt symbol}: Math symbols in symbol font only / 483
\\
{\tt tset}: Extended ASCII symbols / 542 \\
{\tt tsetsl}: Extended ASCII symbols to be slanted /
543 \\
The Base File / 545 \\
Font Specimens / 554 \\
General Index / 571 Index to Character Programs / 581",
}
@Book{Knuth:1986:CT,
author = "Donald Ervin Knuth",
title = "Computers and Typesetting",
publisher = pub-AW,
address = pub-AW:adr,
pages = "??",
year = "1986",
ISBN = "0-201-13447-0 (v.A), 0-201-13437-3 (v.B),
0-201-13445-4 (v.C), 0-201-13438-1 (v.D), 0-201-13446-2
(v.E)",
ISBN-13 = "978-0-201-13447-6 (v.A), 978-0-201-13437-7 (v.B),
978-0-201-13445-2 (v.C), 978-0-201-13438-4 (v.D),
978-0-201-13446-9 (v.E)",
LCCN = "Z253.4.T47K58 1986",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
keywords = "Computerized typesetting.",
rawdata = "Knuth, D. E. (1986) {\it Computers and Typesetting},
Reading, Mass., Addison Wesley.",
}
@Book{Knuth:1986:MB,
author = "Donald E. Knuth",
title = "The {\METAFONT}book",
volume = "C",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xi + 361",
year = "1986",
ISBN = "0-201-13445-4 (hardcover), 0-201-13444-6 (paperback)",
ISBN-13 = "978-0-201-13445-2 (hardcover), 978-0-201-13444-5
(paperback)",
LCCN = "Z250.8.M46 K58 1986",
bibdate = "Wed Dec 15 10:37:29 1993",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
series = "Computers and Typesetting",
acknowledgement = ack-nhfb,
tableofcontents = "1 The Name of the Game / 1 \\
2 Coordinates / 5 \\
3 Curves / 13 \\
4 Pens / 21 \\
5 Running \METAFONT{} / 31 \\
6 How \METAFONT{} Reads What You Type / 49 \\
7 Variables / 53 \\
8 Algebraic Expressions / 59 \\
9 Equations / 75 \\
10 Assignments / 87 \\
11 Magnification and Resolution / 91 \\
12 Boxes / 101 \\
13 Drawing, Filling, and Erasing / 109 \\
14 Paths / 123 \\
15 Transformations / 141 \\
16 Calligraphic Effects / 147 \\
17 Grouping / 155 \\
18 Definitions ( also called Macros) / 159 \\
19 Conditions and Loops / 169 \\
20 More about Macros / 175 \\
21 Random Numbers / 183 \\
22 Strings / 187 \\
23 Online Displays / 191 \\
24 Discreteness and Discretion / 195 \\
25 Summary of Expressions / 209 \\
26 Summary of the Language / 217 \\
27 Recovering from Errors / 223 \\
Appendices \\
A Answers to All the Exercises / 233 \\
B Basic Operations / 257 \\
C Character Codes / 281 \\
D Dirty Tricks / 285 \\
E Examples / 301 \\
F Font Metric Information / 315 \\
G Generic Font Files / 323 \\
H Hardcopy Proofs / 327 \\
I Index / 345 \\
J Joining the \TeX{} Community / 361",
}
@Book{Knuth:1986:MP,
author = "Donald E. Knuth",
title = "{\METAFONT}: The Program",
volume = "D",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xv + 560",
year = "1986",
ISBN = "0-201-13438-1",
ISBN-13 = "978-0-201-13438-4",
LCCN = "Z250.8.M46 K578 1986",
bibdate = "Wed Dec 15 10:37:32 1993",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/litprog.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
note = "Third printing, xviii + 566 pp., 1991.",
series = "Computers and Typesetting",
acknowledgement = ack-nhfb,
tableofcontents = "1 Introduction / \S 1 \\
2 The character set / \S 17 \\
3 Input and output / \S 24 \\
4 String handling / \S 37 \\
5 On-line and off-line printing / \S 54 \\
6 Reporting errors / \S 67 \\
7 Arithmetic with scaled numbers / \S 95 \\
8 Algebraic and transcendental functions / \S 120 \\
9 Packed data / \S 153 \\
10 Dynamic memory allocation / \S 158 \\
11 Memory layout / \S 175 \\
12 The command codes / \S 186 \\
13 The hash table / \S 200 \\
14 Token lists / \S 214 \\
15 Data structures for variables / \S 228 \\
16 Saving and restoring equivalents / \S 250 \\
17 Data structures for paths / \S 255 \\
18 Choosing control points / \S 269 \\
19 Generating discrete moves / \S 303 \\
20 Edge structures / \S 323 \\
21 Subdivision into octants / \S 386 \\
22 Filling a contour / \S 460 \\
23 Polygonal pens / \S 469 \\
24 Filling an envelope / \S 490 \\
25 Elliptical pens / \S 524 \\
26 Direction and intersection times / \S 538 \\
27 Online graphic output / \S 564 \\
28 Dynamic linear equations / \S 585 \\
29 Dynamic nonlinear equations / \S 618 \\
30 Introduction to the syntactic routines / \S 624 \\
31 Input stacks and states / \S 627 \\
32 Maintaining the input stacks / \S 647 \\
33 Getting the next token / \S 658 \\
34 Scanning macro definitions / \S 683 \\
35 Expanding the next token / \S 706 \\
36 Conditional processing / \S 738 \\
37 Iterations / \S 752 \\
38 File names / \S 766 \\
39 Introduction to the parsing routines / \S 796 \\
40 Parsing primary expressions / \S 823 \\
41 Parsing secondary and higher expressions / \S 862
\\
42 Doing the operations / \S 893 \\
43 Statements and commands / \S 989 \\
44 Commands / \S 1020 \\
45 Font metric data / \S 1087 \\
46 Generic font file format / \S 1142 \\
47 Shipping characters out / \S 1149 \\
48 Dumping and undumping the tables / \S 1183 \\
49 The main program / \S 1202 \\
50 Debugging / \S 1212 \\
51 System-dependent changes / \S 1214 \\
52 Index / \S 1215",
}
@Book{Knuth:1986:TP,
author = "Donald E. Knuth",
title = "{\TeX}: The Program",
volume = "B",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xv + 594",
year = "1986",
ISBN = "0-201-13437-3",
ISBN-13 = "978-0-201-13437-7",
LCCN = "Z253.4.T47 K578 1986",
bibdate = "Wed Dec 15 10:36:54 1993",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/litprog.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
note = "Reprinted with corrections May 1988. Fourth printing,
xviii + 600 pp., 1991.",
series = "Computers and Typesetting",
acknowledgement = ack-nhfb,
tableofcontents = "1 Introduction / \S 1 \\
2 The character set / \S 17 \\
3 Input and output / \S 25 \\
4 String handling / \S 38 \\
5 On-line and off-line printing / \S 54 \\
6 Reporting errors / \S 72 \\
7 Arithmetic with scaled dimensions / \S 99 \\
8 Packed data / \S 110 \\
9 Dynamic memory allocation / \S 115 \\
10 Data structures for boxes and their friends / \S 133
\\
11 Memory layout / \S 162 \\
12 Displaying boxes / \S 173 \\
13 Destroying boxes / \S 199 \\
14 Copying boxes / \S 203 \\
15 The command codes / \S 207 \\
16 The semantic nest / \S 211 \\
17 The table of equivalents / \S 220 \\
18 The hash table / \S 256 \\
19 Saving and restoring equivalents / \S 268 \\
20 Token lists / \S 289 \\
21 Introduction to the syntactic routines / \S 297 \\
22 Input stacks and states / \S 300 \\
23 Maintaining the input stacks / \S 321 \\
24 Getting the next token / \S 332 \\
25 Expanding the next token / \S 366 \\
26 Basic scanning subroutines / \S 402 \\
27 Building token lists / \S 464 \\
28 Conditional processing / \S 487 \\
29 File names / \S 511 \\
30 Font metric data / \S 539 \\
31 Device-independent file format / \S 583 \\
32 Shipping pages out / \S 592 \\
33 Packaging / \S 644 \\
34 Data structures for math mode / \S 680 \\
35 Subroutines for math mode / \S 699 \\
36 Typesetting math formulas / \S 719 \\
37 Alignment / \S 768 \\
38 Breaking paragraphs into lines / \S 813 \\
39 Breaking paragraphs into lines, continued / \S 862
\\
40 Pre-hyphenation / \S 891 \\
41 Post-hyphenation / \S 900 \\
42 Hyphenation / \S 919 \\
43 Initializing the hyphenation tables / \S 942 \\
44 Breaking vertical lists into pages / \S 967 \\
45 The page builder / \S 980 \\
46 The chief executive / \S 1029 \\
47 Building boxes and lists / \S 1055 \\
48 Building math lists / \S 1136 \\
49 Mode-independent processing / \S 1208 \\
50 Dumping and undumping the tables / \S 1299 \\
51 The main program / \S 1330 \\
52 Debugging / \S 1338 \\
53 Extensions / \S 1340 \\
54 System-dependent changes / \S 1376 \\
55 Index / \S 1377",
}
@MastersThesis{Li:1986:SIS,
author = "Yuk Lun Li",
title = "A Study of Invariant Speech Characteristics as Applied
to Phoneme Extrapolation (Speech Recognition, Data
Compression)",
type = "{M.E.} thesis",
school = "The Cooper Union for the Advancement of Science and
Art",
address = "New York, NY, USA",
pages = "176",
year = "1986",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303473611",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering; 0800: Artificial
intelligence",
dissertation-thesis-number = "1327133",
subject = "Electrical engineering; Artificial intelligence",
}
@PhdThesis{Moayeri:1986:FVQ,
author = "Nader Moayeri",
title = "Fast Vector Quantization (Communication Theory, Source
Coding, Data Compression)",
type = "{Ph.D.} thesis",
school = "University of Michigan",
address = "Ann Arbor, MI, USA",
pages = "178",
year = "1986",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303494436",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8702795",
subject = "Electrical engineering",
}
@Article{Myers:1986:DAV,
author = "Eugene W. Myers",
title = "An {$ O(N D) $} Difference Algorithm and its
Variations",
journal = j-ALGORITHMICA,
volume = "1",
number = "2",
pages = "251--266",
year = "1986",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/bf01840446",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "dblp-journals-algorithmica.bib;
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica1.html#Meyers86;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica",
acknowledgement = ack-ds,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
oldlabel = "Meyers86",
rawdata = "Myers, Eugene W. (1986) ``An $O(ND)$ Difference
Algorithm and its Variations,'' {\it Algorithmica},
{\bf1}(2):251--266.",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/Meyers86",
}
@Book{Peitgen:1986:BF,
author = "Heinz-Otto Peitgen and Peter H. Richter",
title = "The Beauty of Fractals",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 199",
year = "1986",
ISBN = "0-387-15851-0",
ISBN-13 = "978-0-387-15851-8",
LCCN = "QA447 .P45 1986",
bibdate = "Wed Dec 15 10:40:44 1993",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
abstract = "The authors present an unusual attempt to publicize
the field of Complex Dynamics, an exciting mathematical
discipline of respectable tradition that recently
sprang into new life under the impact of modern
computer graphics. Where previous generations of
scientists had to develop their own inner eye to
perceive the abstract aesthetics of their work, the
astounding pictures assembled here invite the reader to
share in a new mathematical experience, to revel in the
charm of fractal frontiers.",
acknowledgement = ack-nhfb,
subject = "Fractals; Fractales; Fractals; Fractals; Dynamisches
System; Fraktal; Fractales; Mathematics",
tableofcontents = "Frontiers of Chaos / 1 \\
Special Sections \\
1 Verhulst Dynamics / 23 \\
2 Julia Sets and Their Computergraphical Generation /
27 \\
3 Sullivan's Classification of Critical Points / 53 \\
4 The Mandelbrot Set / 56 \\
5 External Angles and Hubbard Trees / 63 \\
6 Newton's Method for Complex Polynomials: Cayley's
Problem / 93 \\
7 Newton's Method for Real Equations / 103 \\
8 A Discrete Volterra--Lotka System / 125 \\
Magnetism and Complex Boundaries / 129 \\
Special Sections \\
9 Yang-Lee Zeros / 139 \\
10 Renormalization / 142 \\
References / 147 \\
Invited Contributions / 151 \\
B. B. Mandelbrot: Fractals and the Rebirth of Iteration
Theory / 151 \\
A. Douady: Julia Sets and the Mandelbrot Set / 161 \\
G. Eilenberger: Freedom, Science, and Aesthetics / 175
\\
H. W. Franke: Refractions of Science into Art / 181 \\
Do It Yourself / 189 \\
Documentation / 193 \\
Index / 197",
}
@Article{Posner:1986:CES,
author = "E. C. Posner and R. L. Horttor and T. L. Grant",
title = "Communicating from the edge of the solar system:
Centimeter-band transmissions, three-dimensional data
compression, and laser-based systems may launch
unmanned missions to deep space",
journal = j-IEEE-SPECTRUM,
volume = "23",
number = "6",
pages = "60--65",
month = jun,
year = "1986",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.1986.6370934",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Mon Jan 20 06:41:24 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1970.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "antennas; Antennas; centimetre band transmission;
communications link; Deep Space Network; Earth; Galileo
craft; Galileo project; Jupiter; laser beam
applications; laser-based systems; optical links;
orbiting weather satellite; Probes; Receivers; space
communication links; Space vehicles; three-dimensional
data compression",
}
@Article{Prenter:1986:TAD,
author = "P. M. Prenter and E. R. Westwater",
title = "Three Adaptive Discrete Least Squares Cubic Spline
Procedures for the Compression of Data",
journal = j-CVGIP,
volume = "33",
number = "3",
pages = "327--345",
month = mar,
year = "1986",
CODEN = "CVGPDB",
DOI = "https://doi.org/10.1016/0734-189x(86)90181-7",
ISSN = "0734-189X",
ISSN-L = "0734-189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database; Graphics/rosenfeld/1986.bib;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Colo St U/NOAA",
affiliationaddress = "Colorado State Univ, Fort Collins, CO, USA",
classification = "723; 921",
fjournal = "Computer Vision, Graphics, and Image Processing",
journal-URL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "Algorithms; computer programming; data compression;
image approximation; image processing; integer strings;
mathematical transformations --- Fast Fourier
Transforms; spline knots",
}
@MastersThesis{Prountzos:1986:DIM,
author = "Demetrios A. Prountzos",
title = "The Design and Implementation of a Microprocessor
Based Data Compression System",
type = "{M.E.E.} thesis",
school = "The Cooper Union for the Advancement of Science and
Art",
address = "New York, NY, USA",
pages = "134",
year = "1986",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303488933",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "1329773",
subject = "Electrical engineering",
}
@Article{Richards:1986:DCG,
author = "Dana Richards",
title = "Data compression and {Gray}-code sorting",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "4",
pages = "201--205",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(86)90029-3",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Virginia, Charlottesville, VA, USA",
classification = "723; 731; C1160 (Combinatorial mathematics); C6120
(File organisation)",
corpsource = "Dept. of Comput. Sci., Virginia Univ.,
Charlottesville, VA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "codes, symbolic; comparison based sorting;
comparison-based sorting; computer systems programming
--- Sorting; data compression; data processing --- File
Organization; differencing; full mixed-radix case; gray
codes; Gray-code sorting; radix sorting; sorting;
storage management; theory; verification",
pubcountry = "Netherlands A09",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching \\ E.4 Data, CODING AND
INFORMATION THEORY, Data compaction and compression",
treatment = "T Theoretical or Mathematical",
}
@MastersThesis{Schmidt:1986:SRC,
author = "Alfred Rudolf Schmidt",
title = "Secondary Range Compression for Improved Range\slash
{Doppler} Processing of {SAR} Data with High Squint",
type = "{M.A.Sc}",
school = "The University of British Columbia",
address = "Vancouver, BC, Canada",
pages = "xviii + 213",
year = "1986",
ISBN = "0-315-36707-5",
ISBN-13 = "978-0-315-36707-4",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303539025",
acknowledgement = ack-nhfb,
classification = "0537: Engineering",
dissertation-thesis-number = "ML36707",
subject = "Engineering",
}
@InProceedings{Adelson:1987:OPT,
author = "E. H. Adelson and E. Simoncelli and R. Hingorani",
booktitle = "Proceedings SPIE",
title = "Orthogonal Pyramid Transforms for Image Coding",
publisher = "vol. 845",
address = "Cambridge, MA, USA",
pages = "50--58",
month = oct,
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Adelson, E. H., E. Simoncelli, and R. Hingorani (1987)
``Orthogonal Pyramid Transforms for Image Coding,''
{\it Proceedings SPIE}, vol. 845, Cambridge, MA, pp.
50--58, October.",
}
@Article{Anderson:1987:BIM,
author = "K. L. Anderson and others",
title = "Binary-Image-Manipulation Algorithm in the Image View
Facility",
journal = j-IBM-JRD,
volume = "31",
number = "1",
pages = "16--31",
month = jan,
year = "1987",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.311.0016",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
rawdata = "Anderson, K. L., et al., (1987)
``Binary-Image-Manipulation Algorithm in the Image View
Facility,'' {\it IBM Journal of Research and
Development}, {\bf31}(1):16--31, January.",
}
@Article{Apostolico:1987:RTU,
author = "Alberto Apostolico and A. S. Fraenkel",
title = "Robust Transmission of Unbounded Strings {Using}
{Fibonacci} Representations",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "33",
number = "2",
pages = "238--245",
month = mar,
year = "1987",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1987.1057284",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Apostolico, Alberto and A. S. Fraenkel (1987) ``Robust
Transmission of Unbounded Strings Using Fibonacci
Representations,'' {\it IEEE Transactions on
Information Theory}, {\bf33}(2):238--245, March.",
}
@PhdThesis{Bell:1987:UTI,
author = "Timothy C. Bell",
title = "A Unifying Theory and Improvements for Existing
Approaches to Text Compression",
type = "{Ph.D.} Thesis",
school = "Department of Computer Science, University of
Canterbury, Christchurch, New Zealand",
address = "????",
pages = "??",
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Bell, Timothy C. (1987) {\it A Unifying Theory and
Improvements for Existing Approaches to Text
Compression}, PhD thesis, Department of Computer
Science, University of Canterbury, Christchurch, New
Zealand.",
}
@Misc{Blackstock:1987:LGE,
author = "Steve Blackstock",
title = "{LZW} and {GIF} Explained",
pages = "??",
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cis.udel.edu/~amer/CISC651/lzw.and.gif.explained.html",
acknowledgement = ack-ds,
rawdata = "Blackstock, Steve (1987) ``LZW and GIF Explained,''
available from\hfil\break
|http://www.cis.udel.edu/~amer/CISC651/lzw.and.gif.explained.html|.",
}
@Article{Brent:1987:LAD,
author = "R. P. Brent",
title = "A linear Algorithm for Data Compression",
journal = j-AUSTRALIAN-COMP-J,
volume = "19",
number = "2",
pages = "64--68",
month = may,
year = "1987",
CODEN = "ACMJB2",
ISSN = "0004-8917",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Australian Computer Journal",
rawdata = "Brent, R. P. (1987) ``A linear Algorithm for Data
Compression,'' {\it Australian Computer Journal},
{\bf19}(2):64--68, May.",
}
@MastersThesis{Chan:1987:NST,
author = "Barry Wai Kwong Chan",
title = "A new subword-tree based data compression algorithm",
type = "Thesis {(M.Sc.)(C.S.)}",
school = "School of Computer Science, The University of New
Brunswick",
address = "Fredericton, NB, Canada",
pages = "????",
year = "1987",
ISBN = "0-315-35212-4",
ISBN-13 = "978-0-315-35212-4",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303653948",
acknowledgement = ack-nhfb,
classification = "0537: Engineering",
dissertation-thesis-number = "ML35212",
subject = "Engineering",
}
@Article{Cole:1987:CTR,
author = "A. J. Cole",
title = "Compaction Techniques for Raster Scan Graphics Using
Space-Filling Curves",
journal = j-COMP-J,
volume = "30",
number = "1",
pages = "87--92",
month = feb,
year = "1987",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/30.1.87",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:22 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/1.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/30/1/87.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/87.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/88.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/89.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/90.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/91.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/92.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of St. Andrews, St. Andrews, Scotl",
affiliationaddress = "Univ of St. Andrews, St. Andrews, Scotl",
classcodes = "C4130 (Interpolation and function approximation);
C6130B (Graphics techniques)",
classification = "723",
corpsource = "Dept. of Comput. Sci., St. Andrews Univ., UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "codes, symbolic --- Encoding; compaction techniques;
computation; computational geometry; computer graphics;
curve fitting; data compression; graphics; Hilbert
space; image processing; Peano space; quadtree coding;
raster scan; raster scan graphics; space-filling
curves; space-filling polygons",
treatment = "P Practical",
}
@Article{Cormack:1987:DCU,
author = "G. V. Cormack and R. N. S. Horspool",
title = "Data Compression Using Dynamic {Markov} {Modelling}",
journal = j-COMP-J,
volume = "30",
number = "6",
pages = "541--550",
month = dec,
year = "1987",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/30.6.541",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://comjnl.oxfordjournals.org/content/30/6.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/",
URL = "http://comjnl.oxfordjournals.org/content/30/6/541.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/541.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/542.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/543.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/544.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/545.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/546.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/547.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/548.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/549.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/550.tif",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliation = "Univ of Waterloo, Waterloo, Ont, Can",
affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can",
classcodes = "B6110 (Information theory); B6120B (Codes); B6140
(Signal processing and detection); C1140Z (Other and
miscellaneous); C1260 (Information theory); C6130 (Data
handling techniques)",
classification = "723; 922",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "arithmetic coding; binary messages; codes, symbolic;
data compression; dynamic Markov modelling; encoding;
Encoding; Guazzo; information theory --- Data
Compression; Markov chain models; Markov processes;
probability --- Random Processes",
rawdata = "Cormack G. V., and R. N. S. Horspool (1987) ``Data
Compression Using Dynamic Markov Modelling,'' {\it The
Computer Journal}, {\bf30}(6):541--550.",
treatment = "T Theoretical or Mathematical",
}
@Article{Einarsson:1987:DCD,
author = "Goran Einarsson and Goran Roth",
title = "Data compression of digital color pictures",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "11",
number = "4",
pages = "409--426",
year = "1987",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/0097-8493(87)90057-4",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Mon Feb 13 17:22:01 2012",
bibsource = "Graphics/imager/imager.87.bib;
Graphics/siggraph/87.bib;
https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
keywords = "color encoding",
}
@Article{Gharavi:1987:CRL,
author = "H. Gharavi",
title = "Conditional Run-Length and Variable-Length Coding of
Digital Pictures",
journal = j-IEEE-TRANS-COMM,
volume = "COM-35",
number = "6",
pages = "671--677",
month = jun,
year = "1987",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1987.1096817",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Gharavi, H. (1987) ``Conditional Run-Length and
Variable-Length Coding of Digital Pictures,'' {\it IEEE
Transactions on Communications}, {\bf
COM-35}(6):671--677, June.",
}
@Book{Held:1987:DCT,
author = "Gilbert Held and Thomas (Thomas R.) Marshall",
title = "Data compression: techniques and applications:
hardware and software considerations",
publisher = pub-WILEY,
address = pub-WILEY:adr,
edition = "Second",
pages = "xii + 206",
year = "1987",
ISBN = "0-471-91280-8",
ISBN-13 = "978-0-471-91280-4",
LCCN = "QA76.9.D33 H44 1987",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
subject = "Data compression (Computer science)",
}
@Article{Lelewer:1987:DC,
author = "Debra A. Lelewer and Daniel S. Hirschberg",
title = "Data Compression",
journal = j-COMP-SURV,
volume = "19",
number = "3",
pages = "261--296",
month = sep,
year = "1987",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/45072.45074",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "ACM Computing Archive;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprinted in Japanese BIT Special issue in Computer
Science (1989), 16--195.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0360-0300/45074.html;
http://www.ics.uci.edu/~dan/pubs/DataCompression.html",
abstract = "This paper surveys a variety of data compression
methods spanning almost 40 years of research, from the
work of Shannon, Fano, and Huffman in the late 1940s to
a technique developed in 1986. The aim of data
compression is to reduce redundancy in stored or
communicated data, thus increasing effective data
density. Data compression has important application in
the areas of file storage and distributed systems.
Concepts from information theory as they relate to the
goals and evaluation of data compression methods are
discussed briefly. A framework for evaluation and
comparison of methods is constructed and applied to the
algorithms presented. Comparisons of both theoretical
and empirical natures are reported, and possibilities
for future research are suggested.",
acknowledgement = ack-ds # " and " # ack-nhfb,
annote = "Reviews techniques that are reversible.",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "adaptive coding; algorithms; data compression; Huffman
coding; text compression; theory",
rawdata = "Lelewer, D. A., and D. S. Hirschberg (1987) ``Data
compression,'' {\it Computing Surveys} {\bf19},3,
261--297. Reprinted in Japanese BIT Special issue in
Computer Science (1989), 16--195. Available in HTML at
|http://www.ics.uci.edu/~dan/pubs/DataCompression.html|.",
review = "ACM CR 8902-0069",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf H.3.2}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Storage. {\bf D.4.3}: Software, OPERATING SYSTEMS, File
Systems Management, Distributed file systems.",
}
@Article{Llewellyn:1987:DCS,
author = "J. A. Llewellyn",
title = "Data Compression for a Source with {Markov}
Characteristics",
journal = j-COMP-J,
volume = "30",
number = "2",
pages = "149--156",
month = apr,
year = "1987",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/30.2.149",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:22 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/2.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/30/2/149.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/149.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/150.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/151.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/152.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/153.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/154.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/155.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/156.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Lancaster, Lancaster, Engl",
affiliationaddress = "Univ of Lancaster, Lancaster, Engl",
classcodes = "B0240Z (Other and miscellaneous); B6120B (Codes);
B6140 (Signal processing and detection); C1140Z (Other
and miscellaneous); C1260 (Information theory)",
classification = "723; 922",
corpsource = "Dept. of Comput., Lancaster Univ., UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "average; average code/source ratio; code symbols;
code/source ratio; codes, symbolic --- Encoding; coding
transformation; data compression; Data Compression;
encoding; encoding transformation; entropy; finite;
Huffman method; information source; information theory;
Markov characteristics; Markov processes; probability;
source coding; source strings; source with Markov
characteristics; state models; statistical structure;
symbol groups; zero probability",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Mullin:1987:ATD,
author = "J. K. Mullin",
title = "Accessing textual documents using compressed indexes
of arrays of small {Bloom} filters",
journal = j-COMP-J,
volume = "30",
number = "4",
pages = "343--348",
month = aug,
year = "1987",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/30.4.343",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:23 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/30/4/343.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/343.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/344.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/345.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/346.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/347.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/348.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Western Ontario, London, Ont, Can",
affiliationaddress = "Univ of Western Ontario, London, Ont, Can",
classcodes = "C7240 (Information analysis and indexing); C7250L
(Non-bibliographic systems)",
classification = "723; 903",
corpsource = "Dept. of Comput. Sci., Univ. of Western Ontario,
London, Ont., Canada",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "compressed indexes; computer systems, digital ---
Parallel Processing; data compression; data processing
--- File Organization; document access; indexing;
Information Retrieval; information retrieval;
information science; large; large text files; parallel
processing; small bloom filters; small Bloom filters;
text accessing; text files; textual documents;
variable-sized documents; words",
treatment = "P Practical",
}
@Article{Nelson:1987:AWM,
author = "Russell Nelson",
title = "{ARC} Wars: {MS-DOS} Archiving Utilities",
journal = j-DDJ,
volume = "12",
number = "3",
pages = "26--28, 30",
month = mar,
year = "1987",
CODEN = "DDJOEB",
ISSN = "0888-3076",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
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",
}
@Book{Parsons:1987:VSP,
author = "Thomas W. Parsons",
title = "Voice and Speech Processing",
publisher = pub-MCGRAW-HILL,
address = pub-MCGRAW-HILL:adr,
pages = "??",
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Parsons, Thomas W. (1987) {\it Voice and Speech
Processing}, New York, McGraw-Hill.",
}
@Article{Raita:1987:ASF,
author = "T. Raita",
title = "An Automatic System for File Compression",
journal = j-COMP-J,
volume = "30",
number = "1",
pages = "80--86",
month = feb,
year = "1987",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/30.1.80",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:22 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/1.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/30/1/80.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/80.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/81.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/82.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/83.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/84.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/85.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/86.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Turku, Turku, Finl",
affiliationaddress = "Univ of Turku, Turku, Finl",
classcodes = "C5320C (Storage on moving magnetic media); C6120 (File
organisation); C6130 (Data handling techniques)",
classification = "723",
corpsource = "Dept. of Comput. Sci., Turku Univ., Finland",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "computer operating systems --- Storage Allocation;
data compression; data processing; DEC2060; directory
pages; disc files; disk files; file compression; file
organisation; File Organization; information theory ---
Data Compression; magnetic disc storage; text
compression; university use",
treatment = "P Practical",
}
@InProceedings{Raite:1987:PTC,
author = "T. Raita and J. Teuhola",
title = "Predictive Test Compression by Hashing",
crossref = "Yu:1987:RDI",
pages = "223--233",
year = "1987",
bibdate = "Tue Jul 19 08:43:39 1994",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@PhdThesis{Ramabadran:1987:ASM,
author = "Tenkasi V. Ramabadran",
title = "Adaptive Source Models for Data Compression",
type = "{Ph.D.} thesis",
school = "University of Notre Dame",
address = "Notre Dame, IN, USA",
pages = "162",
year = "1987",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303617541",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8712954",
subject = "Electrical engineering",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303501021",
acknowledgement = ack-nhfb,
classification = "0370: Earth",
dissertation-thesis-number = "8726719",
subject = "Earth",
}
@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, 320--330, MR
87e:68020] by J. L. Bentley, D. D. Sleator, R. E.
Tarjan and V. K. Wei}",
journal = j-CACM,
volume = "30",
number = "9",
pages = "792--794",
month = sep,
year = "1987",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/5684.5688",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
MRclass = "68P99 (94A29)",
MRnumber = "89a:68045",
bibdate = "Tue Dec 26 13:35:07 1995",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Tischer:1987:MLD,
author = "Peter Tischer",
title = "A Modified {LZW} Data Compression Scheme",
journal = j-AUSTRALIAN-COMP-SCI-COMM,
volume = "9",
number = "1",
pages = "262--272",
year = "1987",
CODEN = "ACSCDD",
ISSN = "0157-3055",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Australian Computer Science Communications",
rawdata = "Tischer, Peter (1987) ``A Modified LZW Data
Compression Scheme,'' {\it Australian computer science
communications}, {\bf9}(1):262--272.",
}
@PhdThesis{Tran:1987:DCB,
author = "Thao Duy Tran",
title = "Data Compression of Bauded Signals Using the Baseband
Residual Vector Quantization Algorithm",
type = "{Ph.D.} thesis",
school = "The University of Utah",
address = "Salt Lake City, UT 84112, USA",
pages = "167",
year = "1987",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303609161",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8727361",
subject = "Electrical engineering",
}
@Article{Vitter:1987:DAD,
author = "Jeffrey Scott Vitter",
title = "Design and Analysis of Dynamic {Huffman} Codes",
journal = j-J-ACM,
volume = "34",
number = "4",
pages = "825--845",
month = oct,
year = "1987",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/31846.42227",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42227.html",
abstract = "A new one-pass algorithm for constructing dynamic
Huffman codes is introduced and analyzed. We also
analyze the one-pass algorithm due to N. Faller, R. G.
Gallager, and D. E. Knuth. In each algorithm, both the
sender and the receiver maintain equivalent dynamically
varying Huffman trees, and the coding is done in real
time. We show that the number of bits used by the new
algorithm to encode a message containing t letters is
less than t bits more than that used by the
conventional two-pass Huffman scheme, independent of
the alphabet size. This is best possible in the worst
case, for any one-pass Huffman method. Tight upper and
lower bounds are derived. Empirical tests show that the
encodings produced by the new algorithm are shorter
than those of the other one-pass algorithm and, except
for long messages, are shorter than those of the
two-pass method. The new algorithm is well suited for
online encoding\slash decoding in data networks and for
file compression.",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliationaddress = "Brown Univ, Providence, RI, USA",
classification = "723",
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "algorithms; codes, symbolic; computer networks;
computer programming --- Algorithms; Design; design;
dynamic Huffman codes; file compression; one-pass
algorithm; performance; theory",
rawdata = "Vitter, Jeffrey S. (1987) ``Design and Analysis of
Dynamic Huffman Codes,'' {\it Journal of the ACM},
{\bf34}(4):825--845, October.",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY. {\bf
F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems. {\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf
G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Trees. {\bf C.2.0}: Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, General,
Data communications.",
}
@Article{White:1987:CID,
author = "Ronald G. White",
title = "Compressing Image Data with Quadtrees",
journal = j-DDJ,
volume = "12",
number = "3",
pages = "16--??",
month = mar,
year = "1987",
CODEN = "DDJOEB",
ISSN = "0888-3076",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "723; 741; 921",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools",
keywords = "computer graphics --- Imaging Techniques; Data
Compression; data processing --- Data Structures;
graphical image representations; image data
compression; information theory; locational codes;
mathematical techniques --- Trees; quadtrees",
pagecount = "11p between p 16 and 45",
}
@Article{Witten:1987:ACD,
author = "Ian H. Witten and Radford M. Neal and John G. Cleary",
title = "Arithmetic Coding for Data Compression",
journal = j-CACM,
volume = "30",
number = "6",
pages = "520--540",
month = jun,
year = "1987",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/214762.214771",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/214771.html",
acknowledgement = ack-ds # " and " # ack-nhfb,
annote = "From an input string of symbols and a model, an
encoded string is produced. The decoder must have
access to the same model; the model may assign a
predetermined probability to each symbol in ASCII. Such
a fixed model is communicated in advance. Huffman
coding performs optimally if all symbol probabilities
are integral powers of 1/2. Arithmetic coding dispenses
with the restriction that each symbol must translate
into an integral number of bits, thereby coding more
efficiently.",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "design; performance",
rawdata = "Witten, Ian H., Radford M. Neal, and John G. Cleary
(1987) ``Arithmetic Coding for Data Compression,'' {\it
Communications of the ACM}, {\bf30}(6):520--540.",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression.",
}
@TechReport{Aldus:1988:TIF,
author = "Aldus Corporation and Microsoft Corporation",
title = "Tag Image File Format ({TIFF}) Specification Revision
5.0",
institution = "Aldus Corporation, 411 First Avenue South, Suite 200,
Seattle, WA 98104, Tel: (206) 622-5500, and Microsoft
Corporation, 16011 NE 36th Way, Box 97017, Redmond, WA
98073-9717, Tel: (206) 882-8080",
day = "8",
month = aug,
year = "1988",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = ack-nhfb,
}
@TechReport{Aldus:tiff,
author = "Aldus Corporation and Microsoft Corporation",
title = "Tag Image File Format ({TIFF}) Specification Revision
5.0",
institution = "Aldus Corporation, 411 First Avenue South, Suite 200,
Seattle, WA 98104, Tel: (206) 622-5500, and Microsoft
Corporation, 16011 NE 36th Way, Box 97017, Redmond, WA
98073-9717, Tel: (206) 882-8080",
month = aug # " 8",
year = "1988",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = ack-nhfb,
}
@Article{Anedda:1988:CQI,
author = "C. Anedda and L. Felician",
title = "{$P$}-Compressed Quadtrees for Image Storing",
journal = j-COMP-J,
volume = "31",
number = "4",
pages = "353--357",
year = "1988",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/31.4.353",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
rawdata = "Anedda, C. and L. Felician (1988) ``P-Compressed
Quadtrees for Image Storing,'' {\it The Computer
Journal}, {\bf31}(4):353--357.",
}
@Article{Anedda:1988:PCQ,
author = "C. Anedda and L. Felician",
title = "{P}-Compressed Quadtrees for Image Storing",
journal = j-COMP-J,
volume = "31",
number = "4",
pages = "353--357",
month = aug,
year = "1988",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/31.4.353",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 25 13:51:56 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/353.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/354.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/355.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/356.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/357.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ degli Studi di Udine, Udine, Italy",
affiliationaddress = "Univ degli Studi di Udine, Udine, Italy",
classcodes = "C6120 (File organisation); C6130B (Graphics
techniques)",
classification = "722; 723; 741",
corpsource = "Dipartimento di Matematica e Inf., Udine Univ.,
Italy",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "automation; bit-map scanning; computer graphics; data
compression; data storage, analog; data structures;
database systems; encoded images; encoding; image
processing; image storing; image-file management; mass
storage; office; office automation; office automation
environment; p-compressed quadtrees; P-compression;
quadtree-; storage management; trees (mathematics)",
treatment = "P Practical",
}
@Article{Anonymous:1988:DCTb,
author = "Anonymous",
title = "Data compression: Techniques and applications.
{October 1983--September 1986}",
journal = j-COMPUT-SECUR,
volume = "7",
number = "5",
pages = "518--518",
month = oct,
year = "1988",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/0167404888902611",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Anonymous:1988:DCTc,
author = "Anonymous",
title = "Data compression: Techniques and applications.
{October 1983--September 1986}",
journal = j-COMPUT-SECUR,
volume = "7",
number = "5",
pages = "519--519",
month = oct,
year = "1988",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/0167404888902684",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Anonymous:1988:DCTd,
author = "Anonymous",
title = "Data compression: Techniques and applications.
{October 1986--September 1987}",
journal = j-COMPUT-SECUR,
volume = "7",
number = "5",
pages = "519--519",
month = oct,
year = "1988",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/0167404888902696",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Arps:1988:MPV,
author = "Ronald B. Arps and Thomas K. Truong and David J. Lu
and Richard C. Pasco and Theodore David Friedman",
title = "A multi-purpose {VLSI} chip for adaptive data
compression of bilevel images",
journal = j-IBM-JRD,
volume = "32",
number = "6",
pages = "775--795 (or 775--794??)",
month = nov,
year = "1988",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.326.0775",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "A VLSI chip for data compression has been implemented
based on a general-purpose adaptive binary arithmetic
coding (ABAC) architecture. The architecture permits
the reuse of adapter and arithmetic coder logic in a
universal way, which together with application
-specific model logic can create a variety of powerful
compression systems. The specific version of the
adapter\slash coder used is the `Q-Coder'. The hardware
implementation is in a single HCMOS chip, to maximize
speed and minimize cost. The primary purpose of the
chip is to provide superior data compression
performance for bilevel image data by using conditional
binary source models together with adaptive arithmetic
coding. The coding scheme implemented is called the
Adaptive Bilevel Image Compression (ABIC) algorithm. On
business documents, it outperforms such nonadaptive
algorithms as the CCITT Group 4 (T.6) Standard and
comes into its own when adapting to documents scanned
at different resolutions or which include significantly
different data such as digital halftones.",
acknowledgement = ack-nhfb,
affiliation = "IBM Res. Div., Almaden Res. Center",
affiliationaddress = "San Jose, CA, USA",
classcodes = "B6120B (Codes); B6110 (Information theory); B6140C
(Optical information and image processing); C5230
(Digital arithmetic methods); C1260 (Information
theory); C4220 (Automata theory)C1250 (Pattern
recognition)",
classification = "713; 714; 721; 723; 741; 921; B6110 (Information
theory); B6120B (Codes); B6140C (Optical information
and image processing); C1250 (Pattern recognition);
C1260 (Information theory); C4220 (Automata theory);
C5230 (Digital arithmetic methods)",
corpsource = "IBM Res. Div., Almaden Res. Center, San Jose, CA,
USA",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "Adapter; adapter; Adaptive arithmetic coding; adaptive
arithmetic coding; Adaptive binary arithmetic coding;
adaptive binary arithmetic coding; Adaptive Binary
Arithmetic Coding (ABAC); Adaptive data compression;
Adaptive Data Compression; adaptive data compression;
Arithmetic coder logic; arithmetic coder logic;
Arithmetic Coder Logic; Bilevel Images; bilevel images;
Bilevel images; binary source; Binary source models;
Control Systems, Adaptive; Design; digital arithmetic;
encoding; finite automata; hardware coding; Hardware
coding; HCMOS chip; Image Processing; information;
Information Theory--Data Compression; Integrated
Circuits, VLSI; models; picture processing;
probability; Q-Coder; Q-coder; theory; VLSI; VLSI chip;
VLSI Chip",
thesaurus = "Digital arithmetic; Encoding; Finite automata;
Information theory; Picture processing; Probability;
VLSI",
treatment = "A Application; P Practical; T Theoretical or
Mathematical",
xxlibnote = "Issue missing from UofUtah Marriott Library",
}
@Article{Barnsley:1988:BWC,
author = "Michael F. Barnsley and Alan D. Sloan",
title = "A Better Way to Compress Images",
journal = j-BYTE,
volume = "13",
number = "??",
pages = "215--222",
month = jan,
year = "1988",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "/usr/local/src/bib/bibliography/Graphics/imager/imager.88.bib;
https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/byte1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "BYTE Magazine",
rawdata = "Barnsley, M. F., and Sloan, A. D. (1988) ``A Better
Way to Compress Images,'' {\it Byte Magazine}, pp.
215--222, January.",
xxpages = "215--223",
}
@Book{Barnsley:1988:FE,
author = "Michael Barnsley",
title = "Fractals Everywhere",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "xii + 394",
year = "1988",
ISBN = "0-12-079062-9",
ISBN-13 = "978-0-12-079062-3",
LCCN = "QA614.86 .B37 1988",
MRclass = "*58-01, 00A06, 11K55, 37B99, 37C70, 37D45, 37G15,
28A80, 54H20",
bibdate = "Tue Dec 14 22:40:15 1993",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
ZMnumber = "0691.58001",
abstract = "This book is based on a course called 'Fractal
Geometry' which has been taught in the School of
Mathematics at Georgia Institute of Technology for two
years. \booktitle{Fractals Everywhere} teaches the
tools, methods, and theory of deterministic geometry.
It is useful for describing specific objects and
structures. Models are represented by succinct
formulas.' Once the formula is known, the model can be
reproduced. we do not consider statistical geometry.
The latter aims at discovering general statistical laws
which govern families of similar-looking structures,
such as all cumulus clouds, all maple leaves, or all
mountains. In deterministic geometry, structures are
defined, communicated, and analysed, with the aid of
elementary transformations such as affine
transformations, scalings, rotations, and congruences.
A fractal set generally contains infinitely many points
whose organization is so complicated that it is not
possible to describe the set by specifying directly
where each point in it lies. Instead, the set may be
define by `the relations between the pieces.' It is
rather like describing the solar system by quoting the
law of gravitation and stating the initial conditions.
Everything follows from that. It appears always to be
better to describe in terms of relationships.",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Barnsley, M. F. (1988) {\it Fractals Everywhere}, New
York, Academic Press.",
tableofcontents = "Introduction: Applications for Fractal Functions /
205 \\
Fractal Interpolation Functions / 208 \\
The Fractal Dimension of Fractal Interpolation
Functions / 223 \\
Hidden Variable Fractal Interpolation / 229 \\
Space-Filling Curves / 238 \\
Julia Sets / 246 \\
The Escape Time Algorithm for Computing Pictures of IFS
Attractors and Julia Sets / 246 \\
Iterated Function Systems Whose Attractors Are Julia
Sets / 266 \\
The Application of Julia Set Theory to Newton's Method
/ 276 \\
A Rich Source for Fractals: Invariant Sets of
Continuous Open Mappings / 287 \\
Parameter Spaces and Mandelbrot Sets / 294 \\
The Idea of a Parameter Space: A Map of Fractals / 294
\\
Mandelbrot Sets for Pairs of Transformations / 299 \\
The Mandelbrot Set for Julia Sets / 309 \\
How to Make Maps of Families of Fractals Using Escape
Times / 317 \\
Measures on Fractals / 330 \\
Introduction to Invariant Measures on Fractals / 330
\\
Fields and Sigma-Fields / 337 \\
Measures / 341 \\
Integration / 344 \\
The Compact Metric Space (P (X), d) / 349 \\
A Contraction Mapping on (P (X)) / 350 \\
Elton's Theorem / 364 \\
Application to Computer Graphics / 370 \\
Recurrent Iterated Function Systems / 379 \\
Fractal Systems / 379 \\
Recurrent Iterated Function Systems / 383 \\
Collage Theorem for Recurrent Iterated Function Systems
/ 392 \\
Fractal Systems with Vectors of Measures as Their
Attractors / 403 \\
References / 409 \\
References / 412 \\
Selected Answers / 416 \\
Index / 523 \\
Credits for Figures and Color Plates / 533",
xxtableofcontents = "Metric Spaces \\
Equivalent Spaces \\
Classification of Subsets \\
and the Space of Fractals \\
Spaces \\
Metric Spaces \\
Cauchy Sequences, Limit Points, Closed Sets, Perfect
Sets, and Complete Metric Spaces \\
Compact Sets, Bounded Sets, Open Sets, Interiors, and
Boundaries \\
Connected Sets, Disconnected Sets, and
Pathwise-Connected Sets \\
The Metric Space (H (X), h): The Place Where Fractals
Live \\
The Completeness of the Space of Fractals \\
Additional Theorems about Metric Spaces \\
Transformations on Metric Spaces \\
Contraction Mappings and the Construction of Fractals
\\
Transformations on the Real Line \\
Affine Transformations in the Euclidean Plane \\
Mobius Transformations on the Riemann Sphere \\
Analytic Transformations \\
How to Change Coordinates \\
The Contraction Mapping Theorem \\
Contraction Mappings on the Space of Fractals \\
Two Algorithms for Computing Fractals from Iterated
Function Systems \\
Condensation Sets \\
How to Make Fractal Models with the Help of the Collage
Theorem \\
Blowing in the Wind: The Continuous Dependence of
Fractals on Parameters \\
Chaotic Dynamics on Fractals \\
The Addresses of Points on Fractals \\
Continuous Transformations from Code Space to Fractals
\\
Introduction to Dynamical Systems \\
Dynamics on Fractals: Or How to Compute Orbits by
Looking at Pictures \\
Equivalent Dynamical Systems \\
The Shadow of Deterministic Dynamics \\
The Meaningfulness of Inaccurately Computed Orbits is
Established by Means of a Shadowing Theorem \\
Chaotic Dynamics on Fractals \\
Fractal Dimension",
}
@InProceedings{Bassiouni:1988:SDC,
author = "M. A. Bassiouni and N. Ranganathan and A. Mukherjee",
title = "A scheme for data compression in supercomputers",
crossref = "IEEE:1988:PSN",
volume = "1",
pages = "272--278",
year = "1988",
bibdate = "Thu Apr 16 07:55:03 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C1260 (Information theory); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Dept. of Comput. Sci., Central Florida Univ., Orlando,
FL, USA",
keywords = "communication bandwidth; communication controllers;
data compression; encoding; enhanced arithmetic coding
scheme; parallel processing; supercomputers; VLSI
designs",
sponsororg = "IEEE; ACM",
treatment = "P Practical",
}
@Article{Bhasker:1988:CMM,
author = "J. Bhasker and T. Samad",
title = "Compacting {MIMOLA} microcode",
journal = j-SIGMICRO,
volume = "19",
number = "1--2",
pages = "40--44",
month = jun,
year = "1988",
DOI = "https://doi.org/10.1145/62197.62206",
bibdate = "Fri Apr 16 10:27:39 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigmicro.bib",
URL = "https://dl.acm.org/doi/10.1145/62197.62206",
abstract = "We address the problem of reducing the word length of
microprograms. Two techniques are described: overlaying
of fields and encoding of the microprogram. Formal
analysis are presented of different encoding methods,
assuming a VLSI implementation. A \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMICRO Newsletter",
journal-URL = "https://dl.acm.org/loi/sigmicro",
}
@Article{Daubechies:1988:OBC,
author = "Ingrid Daubechies",
title = "Orthonormal Bases of Compactly Supported Wavelets",
journal = j-COMM-PURE-APPL-MATH,
volume = "41",
number = "7",
pages = "909--996",
month = oct,
year = "1988",
CODEN = "CPAMAT, CPMAMV",
DOI = "https://doi.org/10.1002/cpa.3160410705",
ISSN = "0010-3640 (print), 1097-0312 (electronic)",
ISSN-L = "0010-3640",
MRclass = "42C40 65T60; 42C15 (92A25)",
MRnumber = "951745",
MRreviewer = "Hans G. Feichtinger",
bibdate = "Wed Mar 7 10:19:22 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/kbmath.bib",
note = "Reprinted in \cite{Daubechies:2006:OBC}.",
ZMnumber = "0644.42026",
acknowledgement = ack-ds # "\slash " # ack-nhfb,
fjournal = "Communications on Pure and Applied Mathematics (New
York)",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-0312",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
rawdata = "Daubechies, Ingrid (1988) ``Orthonormal Bases of
Compactly Supported Wavelets,'' {\it Communications on
Pure and Applied Mathematics}, {\bf41}:909--996.",
unique-id = "ISI:A1988Q390700004",
}
@InProceedings{Desoky:1988:CID,
author = "Ahmed Desoky and Carol O'Connor and Thomas Klein",
title = "Compression of Image Data Using Arithmetic Coding",
crossref = "Wegman:1988:CSS",
pages = "812--814",
year = "1988",
bibdate = "Wed Nov 12 17:00:33 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Article{Disque:1988:SCT,
author = "Tom Disque",
title = "Simple Compression Technique Works With Text and
Graphics",
journal = j-CUJ,
volume = "6",
number = "8",
pages = "23--??",
month = aug,
year = "1988",
ISSN = "0898-9788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "C Users Journal",
}
@Article{Duvanenko:1988:ICC,
author = "Victor J. Duvanenko",
title = "Image compression via compilation",
journal = j-DDJ,
volume = "13",
number = "11",
pages = "42--47, 82--90",
month = nov,
year = "1988",
CODEN = "DDJOEB",
ISSN = "0888-3076",
bibdate = "Tue Sep 10 09:30:19 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Silicon Eng. Inc., Santa Cruz, CA, USA",
classification = "C5130 (Microprocessor chips); C6130B (Graphics
techniques); C6150C (Compilers, interpreters and other
processors)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Bandwidth; C program; Embedded graphics primitives;
Graphics coprocessor; Graphics intensive jobs; Graphics
memory; Image compilation; Image compression; Image
reconstruction; Intel 82786",
thesaurus = "C listings; Computer graphic equipment; Computer
graphics; Data compression; Firmware; Microprocessor
chips; Program compilers",
}
@Book{Feder:1988:F,
author = "Jens Feder",
title = "Fractals",
publisher = pub-PLENUM,
address = pub-PLENUM:adr,
pages = "??",
year = "1988",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Feder, Jens (1988) {\it Fractals}, New York, Plenum
Press.",
}
@InProceedings{Goel:1988:DCA,
author = "B. Goel and S. Kwatra",
title = "A Data Compression Algorithm for Color Images Based on
Run-Length Coding and Fractal Geometry",
crossref = "IEEE:1988:DTS",
volume = "3",
pages = "1253--1256",
year = "1988",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}
@InProceedings{Goel:1988:IIC,
author = "B. Goel and S. Kwatra",
title = "A Data Compression Algorithm for Color Images Based on
Run-Length Coding and Fractal Geometry",
crossref = "IEEE:1988:DTS",
volume = "3",
pages = "1253--1256",
year = "1988",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}
@Article{Hurst:1988:IDC,
author = "G. J. B. Hurst and M. Dupuis",
title = "Integral data compression for {FPS} 64-bit processors:
Improved {I/O} and reduced storage",
journal = j-J-COMPUT-CHEM,
volume = "9",
number = "2",
pages = "148--157",
month = mar,
year = "1988",
CODEN = "JCCHDD",
DOI = "https://doi.org/10.1002/jcc.540090207",
ISSN = "0192-8651 (print), 1096-987X (electronic)",
ISSN-L = "0192-8651",
bibdate = "Thu Nov 29 14:54:04 MST 2012",
bibsource = "http://www.interscience.wiley.com/jpages/0192-8651;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputchem1980.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational Chemistry",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1096-987X",
onlinedate = "7 Sep 2004",
}
@Book{IBM:1988:IJR,
author = "IBM",
title = "{IBM} Journal of Research and Development",
volume = "32(6)",
publisher = pub-IBM,
address = pub-IBM:adr,
pages = "??",
month = nov,
year = "1988",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Special issue on encoding.",
acknowledgement = ack-ds,
rawdata = "IBM (1988) {\it IBM Journal of Research and
Development}, \#6 (the entire issue).",
}
@Article{Jakobsson:1988:ROP,
author = "Matti Jakobsson",
title = "Research: One-pass text compression with a subword
dictionary",
journal = j-J-AM-SOC-INF-SCI,
volume = "39",
number = "4",
pages = "262--269",
month = jul,
year = "1988",
CODEN = "AISJB6",
DOI = "https://doi.org/10.1002/(SICI)1097-4571(198807)39:4<262::AID-ASI5>3.0.CO%3B2-H",
ISSN = "0002-8231 (print), 1097-4571 (electronic)",
ISSN-L = "0002-8231",
bibdate = "Fri Sep 11 09:03:33 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jasis.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Society for Information
Science",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2330-1643",
onlinedate = "25 May 2007",
}
@Article{Jones:1988:AST,
author = "Douglas W. Jones",
title = "Application of Splay Trees to Data Compression",
journal = j-CACM,
volume = "31",
number = "8",
pages = "996--1007",
month = aug,
year = "1988",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/63030.63036",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Apr 06 08:06:29 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/63036.html",
acknowledgement = ack-nhfb,
annote = "One of the simplest and fastest adaptive data
compression algorithms based on a prefix code. With
algorithms in pseudocode.",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; design; performance; theory",
subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf E.4}:
Data, CODING AND INFORMATION THEORY, Data compaction
and compression. {\bf E.2}: Data, DATA STORAGE
REPRESENTATIONS, Linked representations.",
}
@Article{Jurgen:1988:TSE,
author = "R. K. Jurgen",
title = "Technology '88: the specialities [electrical
engineering]",
journal = j-IEEE-SPECTRUM,
volume = "25",
number = "1",
pages = "70--70",
month = jan,
year = "1988",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.4492",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Mon Jan 20 06:41:24 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1970.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Control engineering education; Data compression; data
compression chips; Electrical engineering; electrical
engineering; Electromagnetic compatibility;
electromagnetic compatibility education;
Electromagnetic modeling; EMP radiation effects; error
control; Error correction; neural learning network
model; Optical device fabrication; Optical pulses;
optical-fiber telecommunications systems; Pulse
compression methods; pulse encoding",
}
@Article{Lesk:1988:GII,
author = "Michael Lesk",
title = "{GRAB} --- Inverted Indexes with Low Storage
Overhead",
journal = j-COMP-SYS,
volume = "1",
number = "3",
pages = "207--220",
month = "Summer",
year = "1988",
CODEN = "CMSYE2",
ISSN = "0895-6340",
bibdate = "Fri Sep 13 09:01:18 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems); C7250L
(Non-bibliographic systems)",
fjournal = "Computing Systems",
keywords = "B-trees; Bit vector; Bytes; Fixed length codeword
compression scheme; GRAB; Hash codes; Inverted indexes;
Pointers; Preindexing pass; Searching command; Sparse
vectors; Storage overhead; Whole words",
thesaurus = "DEC computers; Information retrieval; Information
retrieval systems; Operating systems [computers];
Unix",
}
@Article{Luther:1988:YTC,
author = "A. C. Luther",
title = "You are there \ldots{} and in control (digital
interactive video)",
journal = j-IEEE-SPECTRUM,
volume = "25",
number = "9",
pages = "45--50",
month = sep,
year = "1988",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.7167",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Mon Jan 20 06:41:24 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1970.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Application software; CD recording; Computer displays;
Control systems; data compression; Digital control;
digital interactive video; hardware; image data
compression; interactive systems; Mathematical model;
Microcomputers; Personal communication networks;
personal computers; software; sound data compression;
television equipment; TV; Video compression; video
signals",
}
@Article{Luther:1988:YTL,
author = "A. C. Luther",
title = "You are there \ldots{} and in control (digital
interactive video)",
journal = j-IEEE-SPECTRUM,
volume = "25",
number = "9",
pages = "45--50",
month = sep,
year = "1988",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.7167",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Mon Jan 20 06:41:24 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1980.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Application software; CD recording; Computer displays;
Control systems; data compression; Digital control;
digital interactive video; hardware; image data
compression; interactive systems; Mathematical model;
Microcomputers; Personal communication networks;
personal computers; software; sound data compression;
television equipment; TV; Video compression; video
signals",
}
@Article{Pennebaker:1988:OBP,
author = "William B. Pennebaker and Joan L. Mitchell and Glen G.
{Langdon, Jr.} and Ronald B. Arps",
title = "An Overview of the Basic Principles of the {$Q$}-coder
Adaptive Binary Arithmetic Coder",
journal = j-IBM-JRD,
volume = "32",
number = "6",
pages = "717--726 (or 206--211??)",
month = nov,
year = "1988",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.326.0717",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "The Q-Coder is a new form of adaptive binary
arithmetic coding. The binary arithmetic coding part of
the technique is derived from the basic concepts
introduced by Rissanen, Pasco, and Langdon, but extends
the coding conventions to resolve a conflict between
optimal software and hardware implementations. In
addition, a robust form of probability estimation is
used in which the probability estimate is derived
solely from the interval renormalizations that are part
of the arithmetic coding process. A brief tutorial of
arithmetic coding concepts is presented, followed by a
discussion of the compatible optimal hardware and
software coding structures and the estimation of symbol
probabilities from interval renormalization.",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliation = "IBM Res. Div., Thomas J. Watson Res. Center",
affiliationaddress = "Yorktown Heights, NY, USA",
classcodes = "B6120B (Codes); B6110 (Information theory); C5230
(Digital arithmetic methods); C1260 (Information
theory); C4220 (Automata theory)",
classification = "704; 722; 723; 921; 922; B6110 (Information theory);
B6120B (Codes); C1260 (Information theory); C4220
(Automata theory); C5230 (Digital arithmetic methods)",
corpsource = "IBM Res. Div., Thomas J. Watson Res. Center, Yorktown
Heights, NY, USA",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "Binary Arithmetic Coder; Codes, Symbolic; Coding
conventions; coding conventions; Compatible Optimal
Hardware; Computer Hardware; Computer Metatheory;
Computer Software; digital arithmetic; encoding; finite
automata; hardware coding; Hardware coding;
information; interval; Interval Renormalization;
Interval renormalizations; Mathematical Techniques;
Performance; probability; probability estimation;
Probability estimation; Probability--Estimation;
Q-Coder; Q-coder adaptive binary arithmetic coder;
renormalizations; Software coding; Software Coding;
software coding; superconducting devices; Symbol
Probabilities; Symbol probabilities; symbol
probabilities; theory",
rawdata = "Pennebaker, William B., Joan L. Mitchell, et al.
(1988b) ``An Overview of the Basic Principles of the
Q-coder Adaptive Binary Arithmetic Coder,'' {\it IBM
Journal of Research and Development},
{\bf32}(6):737--752.",
thesaurus = "Digital arithmetic; Encoding; Finite automata;
Information theory; Probability",
treatment = "T Theoretical or Mathematical",
xxlibnote = "Issue missing from UofUtah Marriott Library",
}
@Article{Pennebaker:1988:PEC,
author = "William B. Pennebaker and Joan L. Mitchell",
title = "Probability Estimation for the {$Q$}-coder",
journal = j-IBM-JRD,
volume = "32",
number = "6",
pages = "737--752",
month = nov,
year = "1988",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "The Q-Coder is an important new development in binary
arithmetic coding. It combines a simple but efficient
arithmetic approximation for the multiply operation, a
new formalism which yields optimally efficient hardware
and software implementations, and a new technique for
estimating symbol probabilities which matches the
performance of any method known. This paper describes
the probability-estimation technique. The probability
changes are estimated solely from renormalizations in
the coding process and require no additional counters.
The estimation process can be implemented as a
finite-state machine, and is simple enough to allow
precise theoretical modeling of single-context coding.
Approximate models have been developed for a more
complex multi-rate version of the estimator and for
mixed-context coding. Experimental studies verifying
the modeling and showing the performance achieved for a
variety of image-coding models are presented.",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliation = "IBM Res. Div., Thomas J. Watson Res. Center",
affiliationaddress = "Yorktown Heights, NY, USA",
classcodes = "B6120B (Codes); B6110 (Information theory); C5230
(Digital arithmetic methods); C1260 (Information
theory); C4220 (Automata theory)",
classification = "721; 723; 921; 922; B6110 (Information theory);
B6120B (Codes); C1260 (Information theory); C4220
(Automata theory); C5230 (Digital arithmetic methods)",
corpsource = "IBM Res. Div., Thomas J. Watson Res. Centre, Yorktown
Heights, NY, USA",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "Automata Theory; Binary Arithmetic Coding; Binary
arithmetic coding; binary arithmetic coding; Codes,
Symbolic; context coding; digital arithmetic; encoding;
estimation technique; finite automata; finite-state;
Finite-state machine; Hardware coding; hardware coding;
Image-coding models; image-coding models;
implementations; information; machine; mixed-;
Mixed-Context Coding; Mixed-context coding; multi-rate
version; Multi-rate version; multiply; Multiply
operation; operation; Optimally efficient hardware;
optimally efficient hardware; Performance; probability;
Probability Changes; probability-;
Probability--Estimation; Probability-estimation
technique; Q-coder; Q-Coder; Renormalizations;
renormalizations; Single-context coding; single-context
coding; Single-Context Coding; software; Software
implementations; Symbol probabilities; symbol
probabilities; Symbol Probabilities; theory",
rawdata = "Pennebaker, William B., and Joan L. Mitchell (1988a)
``Probability Estimation for the Q-coder,'' {\it IBM
Journal of Research and Development},
{\bf32}(6):717--726.",
thesaurus = "Digital arithmetic; Encoding; Finite automata;
Information theory; Probability",
treatment = "T Theoretical or Mathematical",
}
@PhdThesis{Perkins:1988:DCS,
author = "Michael G. Perkins",
title = "Data compression of stereopairs",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "187",
year = "1988",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303695164",
acknowledgement = ack-nhfb,
advisor = "Peter M. Banks",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8815037",
subject = "Electrical engineering",
}
@Book{Press:1988:NRC,
author = "W. H. Press and B. P. Flannery and others",
title = "Numerical Recipes in {C}: The Art of Scientific
Computing",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "xxii + 735",
year = "1988",
ISBN = "0-521-35465-X, 0-521-35466-8 (diskette)",
ISBN-13 = "978-0-521-35465-3, 978-0-521-35466-0 (diskette)",
LCCN = "QA76.73.C15 N865 1988",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.nr.com/",
acknowledgement = ack-ds,
keywords = "C (computer program language)",
rawdata = "Press, W. H., B. P. Flannery, et al. (1988) {\it
Numerical Recipes in C: The Art of Scientific
Computing}, Cambridge, UK, Cambridge University Press.
(Also available at URL |http://www.nr.com/|.)",
}
@Article{Ramabadran:1988:TCC,
author = "Tenkasi V. Ramabadran and Sunil S. Gaitonde",
title = "A Tutorial on {CRC} Computations",
journal = j-IEEE-MICRO,
volume = "8",
number = "4",
pages = "62--75",
month = jul # "\slash " # aug,
year = "1988",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/40.7773",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib;
Science Citation Index database (1980--2000)",
acknowledgement = ack-ds # " and " # ack-nhfb,
classcodes = "B6120B (Codes); C6130 (Data handling techniques)",
classification = "723; 921",
corpsource = "Iowa State Univ., Ames, IA, USA",
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
keywords = "algorithms; assembly language listings; automatic
repeat request (ARQ); C listings; codes; codes,
symbolic; computer systems programming --- Table
Lookup; computer systems, digital --- Fault Tolerant
Capability; computers, microcomputer; CRC computations;
CRS; cyclic redundancy codes; error control strategies;
Error Correction; error correction; mathematical
techniques --- Polynomials; on-the-fly; on-the-fly
algorithm; reduced table lookup; redundancy; software;
table lookup; wordwise; wordwise algorithms",
rawdata = "Ramabadran, Tenkasi V., and Sunil S. Gaitonde (1988)
``A Tutorial on CRC Computations,'' {\it IEEE Micro},
pp. 62--75, August.",
treatment = "P Practical; T Theoretical or Mathematical",
}
@PhdThesis{Ranganathan:1988:HAD,
author = "N. Ranganathan",
title = "Hardware algorithms for data compression",
type = "{Ph.D.} thesis",
school = "University of Central Florida",
address = "Orlando, FL, USA",
pages = "181",
year = "1988",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303705163",
acknowledgement = ack-nhfb,
advisor = "Amar Mukherjee and Mostafa Bassiouni",
classification = "0984: Computer science",
dissertation-thesis-number = "8827949",
subject = "Computer science",
}
@Article{Reddy:1988:DCT,
author = "S. M. Reddy and K. K. Saluja and M. G. Karpovsky",
title = "A data compression technique for built-in self-test",
journal = j-IEEE-TRANS-COMPUT,
volume = "37",
number = "9",
pages = "1151--1156",
month = sep,
year = "1988",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/12.2271",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sat Jul 9 08:33:28 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=2271",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Reddy:1988:RMT,
author = "B. R. K. Reddy and A. L. Pai",
title = "{Reed--Muller} Transform Image Coding",
journal = j-CVGIP,
volume = "42",
number = "1",
pages = "48--61",
month = apr,
year = "1988",
CODEN = "CVGPDB",
ISSN = "0734-189X",
ISSN-L = "0734-189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Arizona State Univ, Tempe, AZ, USA",
classification = "723; 921",
fjournal = "Computer Vision, Graphics, and Image Processing",
journal-URL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "Image Coding; image data bandwidth compression; image
data compression; image processing; information theory
--- Data Compression; mathematical transformations;
real time image processing; reconstructed images;
reed-muller transform",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303720650",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "8904853",
subject = "Computer science",
}
@Book{Sacco:1988:ITS,
author = "William Sacco and others",
title = "Information Theory, Saving Bits",
publisher = "Janson Publications",
address = "Providence, RI, USA",
pages = "??",
year = "1988",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Sacco, William, et al. (1988) {\it Information Theory,
Saving Bits}, Providence, RI, Janson Publications.",
}
@Article{Sieminski:1988:FDH,
author = "Andrzej Sieminski",
title = "Fast Decoding of the {Huffman} Codes",
journal = j-INFO-PROC-LETT,
volume = "26",
number = "5",
pages = "237--241",
day = "11",
month = jan,
year = "1988",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(88)90146-9",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliationaddress = "Technical Univ of Wroclaw, Wroclaw, Pol",
classification = "723; C4240 (Programming and algorithm theory); C6120
(File organisation); C6130 (Data handling techniques)",
corpsource = "Dept. of Inf. Syst., Tech. Univ. of Wroclaw, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "algorithms; codes, symbolic; computer programming ---
Algorithms; data compression; data handling; database
systems; Decoding; decoding; decoding algorithm; file
organisation; file processing; Huffman algorithm;
Huffman codes; information theory --- Data Compression;
minimum redundancy codes; redundancy; theory",
pubcountry = "Netherlands A03",
rawdata = "Sieminski, A. (1988) ``Fast Decoding of the Huffman
Codes,'' {\it Information Processing Letters},
{\bf26}(5):237--241.",
subject = "E.4 Data, CODING AND INFORMATION THEORY, Data
compaction and compression",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Book{Storer:1988:DCM,
author = "James A. (James Andrew) Storer",
title = "Data Compression: Methods and Theory",
publisher = pub-CSP,
address = pub-CSP:adr,
pages = "x + 413",
year = "1988",
ISBN = "0-88175-161-8",
ISBN-13 = "978-0-88175-161-1",
LCCN = "QA76.9.D33 S76 1988",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clas.caltech.edu:210/INNOPAC;
clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Principles of computer science series.",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Storer, James A. (1988) {\it Data Compression: Methods
and Theory}, Rockville, MD, Computer Science Press.",
subject = "Data compression (Computer science)",
}
@Article{Tung:1988:FAO,
author = "C.-H. Tung and J. P. Robinson",
title = "A fast algorithm for optimum syndrome space
compression",
journal = j-IEEE-TRANS-COMPUT,
volume = "37",
number = "2",
pages = "228--232",
month = feb,
year = "1988",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/12.2153",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sat Jul 9 08:33:25 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=2153",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Wang:1988:AAO,
author = "Muzhong Wang",
title = "Almost Asymptotically Optimal Flag Encoding of the
Integers",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "34",
number = "2",
pages = "324--326",
month = mar,
year = "1988",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.2643",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Wang, Muzhong (1988) ``Almost Asymptotically Optimal
Flag Encoding of the Integers,'' {\it IEEE Transactions
on Information Theory}, {\bf34}(2):324--326, March.",
}
@Article{Witten:1988:PAA,
author = "Ian H. Witten and John G. Cleary",
title = "On the privacy afforded by adaptive text compression",
journal = j-COMPUT-SECUR,
volume = "7",
number = "4",
pages = "397--408",
month = aug,
year = "1988",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:37 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/0167404888905809",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Zalta:1988:AP,
author = "Edward N. Zalta",
title = "Are Algorithms Patentable?",
journal = j-NAMS,
volume = "35",
number = "6",
pages = "796--799",
year = "1988",
CODEN = "AMNOAN",
ISSN = "0002-9920 (print), 1088-9477 (electronic)",
ISSN-L = "0002-9920",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Notices of the American Mathematical Society",
journal-URL = "http://www.ams.org/notices/",
rawdata = "Zalta, Edward N. (1988) ``Are Algorithms Patentable?''
{\it Notices of the American Mathematical Society},
{\bf35}(6):796--799.",
}
@Article{Zorpette:1988:FJA,
author = "Glenn Zorpette",
title = "Fractals: Not Just Another Pretty Picture",
journal = j-IEEE-SPECTRUM,
volume = "25",
number = "10",
pages = "29--31",
month = oct,
year = "1988",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.8587",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Mon Jan 20 06:41:24 2020",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1970.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "1024 pixels; 700 pixels; Airplanes; computer graphics;
data compression; fractals; Fractals; fractals;
Graphics; Image coding; image compression; Image
converters; Layout; Mathematics; Pixel; Satellites;
Shape",
}
@Article{Abrahamson:1989:ADS,
author = "David M. Abrahamson",
title = "An Adaptive Dependency Source Model for Data
Compression",
journal = j-CACM,
volume = "32",
number = "1",
pages = "77--83",
month = jan,
year = "1989",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/63238.63243",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
MRclass = "68P25",
MRnumber = "993 620",
bibdate = "Sat Apr 06 08:06:30 1996",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/63243.html",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; performance",
review = "ACM CR 8910-0732",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf H.1.1}: Information
Systems, MODELS AND PRINCIPLES, Systems and Information
Theory, Information theory.",
}
@Article{Bell:1989:MTC,
author = "Timothy Bell and Ian H. Witten and John G. Cleary",
title = "Modeling for Text Compression",
journal = j-COMP-SURV,
volume = "21",
number = "4",
pages = "557--591",
month = dec,
year = "1989",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/76894.76896",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Jun 19 09:38:50 MDT 2008",
bibsource = "Compendex database;
http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0360-0300/76896.html",
abstract = "The best schemes for text compression use large models
to help them predict which characters will come next.
The actual next characters are coded with respect to
the prediction, resulting in compression of
information. Models are best formed adaptively, based
on the text seen so far. This paper surveys successful
strategies for adaptive modeling that are suitable for
use in practical text compression systems. The
strategies fall into three main classes: finite-context
modeling, in which the last few characters are used to
condition the probability distribution for the next
one; finite-state modeling, in which the distribution
is conditioned by the current state (and which subsumes
finite-context modeling as an important special case);
and dictionary modeling, in which strings of characters
are replaced by pointers into an evolving dictionary. A
comparison of different methods on the same sample
texts is included, along with an analysis of future
research directions.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Canterbury",
affiliationaddress = "Christchurch, NZ",
classification = "723",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "algorithms; Arithmetic Coding; Encoding;
experimentation; measurement, Codes, Symbolic; Text
Compression",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf H.1.1}: Information
Systems, MODELS AND PRINCIPLES, Systems and Information
Theory, Information theory.",
}
@Article{Bell:1989:NDD,
author = "T. Bell and A. Moffat",
title = "A note on the {DMC} data compression scheme",
journal = j-COMP-J,
volume = "32",
number = "1",
pages = "16--20",
month = feb,
year = "1989",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/32.1.16",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68P25",
MRnumber = "984 923",
bibdate = "Tue Dec 4 14:48:26 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/32/1.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/32/1/16.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/16.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/17.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/18.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/19.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/20.tif",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Canterbury Univ.",
affiliationaddress = "Christchurch, NZ",
classcodes = "B6140 (Signal processing and detection); B6110
(Information theory); C6130 (Data handling techniques);
C4220 (Automata theory)",
classification = "723; 922; B6110 (Information theory); B6140 (Signal
processing and detection); C4220 (Automata theory);
C6130 (Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Canterbury Univ., Christchurch,
New Zealand",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "automata; Automata Theory--Finite Automata;
compression; Compression performance; Data Compression;
data compression; Directly preceding symbols; directly
preceding symbols; DMC data compression scheme;
dynamic; Dynamic Markov compression; Dynamic Markov
Compression Scheme; finite automata; finite context;
Finite context automata; Finite state automata; finite
state automata; Information Theory; Markov compression;
Markov processes; order Markov models; performance;
Probability--Random Processes; Text compression; text
compression; Text Compression, DMC data compression
scheme; variable-; Variable-order Markov models;
variable-order Markov models",
thesaurus = "Data compression; Finite automata; Markov processes",
treatment = "P Practical",
}
@Article{Bianchi:1989:DCH,
author = "Mark J. Bianchi and Jeffery J. Kato and David J. {Van
Maren}",
title = "Data compression in a half-inch reel-to-reel tape
drive",
journal = j-HEWLETT-PACKARD-J,
volume = "40",
number = "3",
pages = "26--31",
month = jun,
year = "1989",
CODEN = "HPJOAX",
ISSN = "0018-1153",
bibdate = "Tue Mar 25 14:12:15 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "HP 7980 tape drives are industry-standard, half-inch,
reel-to-reel, streaming tape drives that operate at 125
inches per second, have automatic tape loading, and can
be horizontally rack-mounted for better floor space
utilization. They are available in a variety of
configurations and support three industry-standard tape
formats: 800 NRZI, 1600 PE, and 6250 GCR. The HP 7980XC
Tape Drive is a new member of this family. Its special
contribution is its use of a sophisticated real-time
data compression scheme that provides extended
performance to the 6250 GCR format. The implementation
of data compression in the HP 7980XC involves two
different but complementary components. The authors
address the design and implementation of data
compression in the HP 7980XC.",
acknowledgement = ack-nhfb,
affiliationaddress = "USA",
classcodes = "C5320C (Storage on moving magnetic media)",
classification = "713; 714; 721; 722; C5320C (Storage on moving
magnetic media)",
fjournal = "Hewlett-Packard Journal: technical information from
the laboratories of Hewlett-Packard Company",
journalabr = "Hewlett Packard J",
keywords = "6250 GCR format; CMOS VLSI Chip; compression; Data
compression; data compression; Data Storage, Magnetic;
HP 7980 tape drives; HP 7980XC; HP 7980XC Tape Drive;
Information Theory--Data Compression; Integrated
Circuits, VLSI; magnetic tape; magnetic tape equipment;
real-time data; Real-time data compression;
Reel-to-Reel Tape Drive; storage; Tape",
thesaurus = "Data compression; Magnetic tape equipment; Magnetic
tape storage",
treatment = "P Practical; R Product Review",
}
@Article{Capocelli:1989:CAR,
author = "Renato Capocelli",
title = "Comments and Additions to `Robust Transmission of
Unbounded Strings Using {Fibonacci} Representations'",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "35",
number = "1",
pages = "191--193",
month = jan,
year = "1989",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.42193",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Capocelli, Renato (1989) ``Comments and Additions to
`Robust Transmission of Unbounded Strings Using
Fibonacci Representations','' {\it IEEE Transactions on
Information Theory}, {\bf35}(1):191--193, January.",
}
@PhdThesis{Chakreyavanich:1989:RGD,
author = "Udomsak Chakreyavanich",
title = "Regular Grid {DEM} Data Compression By Using
Zero-Crossing: the Automatic Breakline Detection
Method",
type = "{Ph.D.} thesis",
school = "The Ohio State University",
address = "Columbus, OH, USA",
pages = "149",
year = "1989",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303812819",
acknowledgement = ack-nhfb,
advisor = "Anton F. Schenk",
classification = "0370: Earth",
dissertation-thesis-number = "9105809",
subject = "Earth",
}
@Article{Fiala:1989:DCF,
author = "E. R. Fiala and D. H. Greene",
title = "Data Compression with Finite {Windows}",
journal = j-CACM,
volume = "32",
number = "4",
pages = "490--505",
month = apr,
year = "1989",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/63334.63341",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/63341.html",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; design; experimentation; theory",
rawdata = "Fiala, E. R., and D. H. Greene (1989), ``Data
Compression with Finite Windows,'' {\it Communications
of the ACM}, {\bf32}(4):490--505.",
review = "ACM CR 8910-0733",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf E.1}: Data, DATA
STRUCTURES. {\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.",
}
@Article{Fowell:1989:FPF,
author = "Richard A. Fowell and David D. McNeil",
title = "Faster Plots by Fan Data-Compression",
journal = j-IEEE-CGA,
volume = "9",
number = "2",
pages = "58--66",
month = mar,
year = "1989",
CODEN = "ICGADZ",
DOI = "https://doi.org/10.1109/38.19052",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Sat Jan 25 06:42:48 MST 1997",
bibsource = "Compendex database; Graphics/siggraph/89.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecga.bib",
acknowledgement = ack-nhfb,
annote = "Correction on figures 2 to 5 in IEEE CGA v.9 n.3
p.84",
classification = "722; 723; 731",
fjournal = "IEEE Computer Graphics and Applications",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
journalabr = "IEEE Comput Graphics Appl",
keywords = "Bode Plots; Computer Aided Engineering; Computer
Graphics; Computer Peripheral Equipment; Control
Systems --- Bode Diagrams; Fan Data Compression Method;
faster plots; Information Theory --- Data Compression;
Plot Compression; Plotters",
}
@PhdThesis{Ishihara:1989:UHT,
author = "Fumiko Ishihara",
title = "The use of Hadamard Transform as a data compression
technique in the development of a three-dimensional
fluorescence spectral library for qualitative
analysis",
type = "{Ph.D.} thesis",
school = "Virginia Polytechnic Institute and State University",
address = "Blacksburg, VA, USA",
pages = "154",
year = "1989",
ISBN = "0-612-06836-6",
ISBN-13 = "978-0-612-06836-0",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303819442",
acknowledgement = ack-nhfb,
advisor = "Raymond E. Dessy",
classification = "0486: Analytical chemistry",
dissertation-thesis-number = "8917989",
subject = "Analytical chemistry",
}
@Misc{ITU-T:1989:CRG,
author = "{ITU-T}",
title = "{CCITT} Recommendation {G.711}: Pulse Code Modulation
({PCM}) of Voice Frequencies",
pages = "??",
year = "1989",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "ITU-T (1989) CCITT Recommendation G.711: ``Pulse Code
Modulation (PCM) of Voice Frequencies.''",
}
@MastersThesis{Johnson:1989:BDC,
author = "Michael Paul Johnson",
title = "Beyond {DES}: Data Compression and the {MPJ}
Encryption Algorithm",
type = "{M.S.} thesis",
school = "University of Colorado at Colorado Springs",
address = "Colorado Springs, CO, USA",
pages = "135",
year = "1989",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303808583",
acknowledgement = ack-nhfb,
advisor = "Mark A. Wickert",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "1337668",
subject = "Electrical engineering",
}
@MastersThesis{Klein:1989:ACM,
author = "Thomas Joseph Klein",
title = "Arithmetic Coding and the Move-To-Front method: a
study of two data compression schemes",
type = "{M.S.} thesis",
school = "University of Louisville",
address = "Louisville, KY, USA",
pages = "167",
year = "1989",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303725202",
acknowledgement = ack-nhfb,
advisor = "Ahmed H. Desoky",
classification = "0984: Computer science",
dissertation-thesis-number = "1337737",
subject = "Computer science",
}
@Article{Klein:1989:STR,
author = "Shmuel T. Klein and Abraham Bookstein and Scott
Deerwester",
title = "Storing Text Retrieval Systems on {CD-ROM}.
Compression and Encryption Considerations",
journal = j-TOIS,
volume = "7",
number = "3",
pages = "230--245",
month = jul,
year = "1989",
CODEN = "ATISET",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Sat Jan 16 19:04:41 MST 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
http://liinwww.ira.uka.de/bibliography/Database/Graefe.html;
http://www.acm.org/pubs/tois/toc.html;
https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
note = "Special Issue on Research and Development in
Information Retrieval.",
URL = "http://www.acm.org:80",
abstract = "The emergence of the CD-ROM as a storage medium for
full-text databases raises the question of the maximum
size database that can be contained by this medium. As
an example, the problem of storing the Tr{\'e}sor de la
Langue Fran{\c{c}}aise on a CD-ROM is examined.
Pertinent approaches to compression of the various
files are reviewed, and the compression of the text is
related to the problem of data encryption:
Specifically, it is shown that, under simple models of
text generation, Huffman encoding produces a bit-string
indistinguishable from a representation of coin
flips.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Chicago",
affiliationaddress = "Chicago, IL, USA",
classification = "723; 741; 903",
conference = "SIGIR Conference on Research and Development in
Information Retrieval",
fjournal = "ACM Transactions on Information Systems (TOIS)",
journalabr = "ACM Trans Inf Syst",
keywords = "Algorithms; Arts and humanities; Bit-maps; cd-rom;
CD-ROM; Coding and information theory; Computer
applications; Cryptography; Data; Data Encryption; Data
encryption; Data Encryption; Data Storage; Data
Storage, Optical; Full-Text Storage; Full-text storage;
Huffman Coding; Huffman coding; Inf. storage and
retrieval; Information Retrieval Systems --- Database
Systems; Information storage; Information Theory ---
Data Compression; Optical; Security; Storage Devices;
Text Retrieval Systems",
meetingaddress = "Cambridge, MA, USA",
meetingdate = "Jun 1989",
meetingdate2 = "06/89",
wwwtitle = "String Text Retrieval Systems on {CD-ROM}: Compression
and Encryption Considerations",
}
@TechReport{Kordes:1989:UMC,
author = "F. L. G. Kordes and J. J. Schuurman",
title = "The use of {MEBAS} in creating a simulation
environment for compression and encryption",
type = "Report",
number = "NLR TP 89130 U",
institution = "National Lucht-en Ruimtevaartlaboratorium",
address = "Amsterdam, The Netherlands",
pages = "69",
year = "1989",
bibdate = "Mon Oct 19 08:47:56 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
annote = "Cover title.",
keywords = "Algorithms --- Testing; Computer simulation ---
Testing; Data compression (Computer science)",
}
@InProceedings{Loeffler:1989:PFD,
author = "C. Loeffler and A. Ligtenberg and G. Moschytz",
booktitle = "Proceedings of the International Conference on
Acoustics, Speech, and Signal Processing (ICASSP '89)",
title = "Practical Fast {$1$-D DCT} Algorithms with $ 11$
Multiplications",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "988--991",
year = "1989",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Loeffler, C.,~A. Ligtenberg, and G. Moschytz (1989)
``Practical Fast 1-D DCT Algorithms with 11
Multiplications,'' {\it Proceedings of the
International Conference on Acoustics, Speech, and
Signal Processing (ICASSP '89)}, pp. 988--991.",
}
@Article{Makinen:1989:ITA,
author = "E. M{\"a}kinen",
title = "On implementing two adaptive data-compression
schemes",
journal = j-COMP-J,
volume = "32",
number = "3",
pages = "238--240",
month = jun,
year = "1989",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/32.3.238",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:26 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/32/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/32/3/238.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/238.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/239.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/240.tif",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Tampere Univ., Finland",
classcodes = "C6130 (Data handling techniques); C1260 (Information
theory)",
classification = "C1260 (Information theory); C6130 (Data handling
techniques)",
corpsource = "Dept. of Comput. Sci., Tampere Univ., Finland",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "compression methods; data compression; efficiency;
Efficiency; encoding; errors; Errors; interval coding;
Interval coding; locally adaptive data; Locally
adaptive data compression methods; transpose coding;
Transpose coding",
thesaurus = "Data compression; Encoding; Errors",
treatment = "P Practical",
}
@Article{Mallat:1989:TMS,
author = "Stephane Mallat",
title = "A Theory for Multiresolution Signal Decomposition: The
Wavelet Representation",
journal = j-IEEE-TRANS-PATT-ANAL-MACH-INTEL,
volume = "11",
number = "7",
pages = "674--693",
month = jul,
year = "1989",
CODEN = "ITPIDJ",
DOI = "https://doi.org/10.1109/34.192463",
ISSN = "0162-8828",
ISSN-L = "0162-8828",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=34",
rawdata = "Mallat, Stephane (1989) ``A Theory for Multiresolution
Signal Decomposition: The Wavelet Representation,''
{\it IEEE Transactions on Pattern Analysis and Machine
Intelligence}, {\bf11}(7):674--693, July.",
}
@Article{Nelson:1989:LDC,
author = "Mark R. Nelson",
title = "{LZW} data compression",
journal = j-DDJ,
volume = "14",
number = "10",
pages = "29, 32, 34, 36, 86--87",
month = oct,
year = "1989",
CODEN = "DDJOEB",
ISSN = "0888-3076",
bibdate = "Tue Sep 10 09:26:18 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Greenleaf Software Inc., Dallas, TX, USA",
classification = "C5260 (Digital signal processing); C6110 (Systems
analysis and programming); C6130D (Document processing
techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "12-Bit codes; All-purpose data compression technique;
C; Character strings; Decompression; Implementation;
Lempel--Ziv--Welch; LZW algorithm; LZW data
compression; New string; Portability; Program runs;
Single codes; Standard character set",
thesaurus = "C listings; Character sets; Computerised signal
processing; Data compression; Programming; Word
processing",
}
@Misc{Perkins:1989:RPP,
author = "D. Perkins",
title = "{RFC 1134}: Point-to-Point Protocol: a proposal for
multi-protocol transmission of datagrams over
Point-to-Point links",
day = "1",
month = nov,
year = "1989",
bibdate = "Thu Oct 16 09:34:09 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Obsoleted by RFC1171 \cite{Perkins:1990:RPPa}. Status:
PROPOSED STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1134.txt;
ftp://ftp.internic.net/rfc/rfc1171.txt;
https://www.math.utah.edu/pub/rfc/rfc1134.txt;
https://www.math.utah.edu/pub/rfc/rfc1171.txt",
acknowledgement = ack-nhfb,
format = "TXT=87352 bytes",
obsoletedby = "Obsoleted by RFC1171 \cite{Perkins:1990:RPPa}.",
online = "yes",
status = "PROPOSED STANDARD",
}
@Article{Samples:1989:MNL,
author = "A. D. Samples",
title = "{Mache}: no-loss trace compaction",
journal = j-SIGMETRICS,
volume = "17",
number = "1",
pages = "89--97",
month = may,
year = "1989",
CODEN = "????",
DOI = "https://doi.org/10.1145/75372.75382",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Thu Jun 26 11:08:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
abstract = "Execution traces can be significantly compressed using
their referencing locality. A simple observation leads
to a technique capable of compressing execution traces
by an order of magnitude; instruction-only traces are
compressed by two orders of magnitude. This technique
is unlike previously reported trace compression
techniques in that it compresses without loss of
information and, therefore, does not affect
trace-driven simulation time or accuracy.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303820371",
acknowledgement = ack-nhfb,
classification = "0790: Systems design",
dissertation-thesis-number = "DX92220",
subject = "Systems design",
}
@PhdThesis{Thede:1989:HID,
author = "Leslie D. Thede",
title = "A Hybrid Image Data Compression Scheme Using
Quaternary Decomposition and Vector Quantization of
{DCT} Coefficients",
type = "{Ph.D.} thesis",
school = "The University of Toledo",
address = "Toledo, OH, USA",
pages = "244",
year = "1989",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303826006",
acknowledgement = ack-nhfb,
advisor = "S. C. Kwatra",
classification = "0544: Electrical engineering; 0790: Systems design;
0984: Computer science",
dissertation-thesis-number = "9015896",
subject = "Electrical engineering; Systems design; Computer
science",
}
@Article{Tinker:1989:DPI,
author = "Michael Tinker",
title = "{DVI} parallel image compression",
journal = j-CACM,
volume = "32",
number = "7",
pages = "844--851",
month = jul,
year = "1989",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/65445.65451",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/65451.html",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "design; image compression",
review = "ACM CR 8912-0908",
subject = "{\bf I.4.2}: Computing Methodologies, IMAGE
PROCESSING, Compression (Coding). {\bf I.4.1}:
Computing Methodologies, IMAGE PROCESSING,
Digitization. {\bf C.1.2}: Computer Systems
Organization, PROCESSOR ARCHITECTURES, Multiple Data
Stream Architectures (Multiprocessors), Parallel
processors.",
}
@PhdThesis{Todd:1989:IDC,
author = "Martin Peter Todd",
title = "Image Data Compression Based on a Multiresolution
Signal Model (Data Compression)",
type = "{Ph.D.} thesis",
school = "University of Warwick",
address = "Warwick, UK",
pages = "204",
year = "1989",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303789294",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "D-90766",
subject = "Computer science",
}
@Article{VanMaren:1989:MTC,
author = "David J. {Van Maren} and Mark J. Bianchi and Jeffery
J. Kato",
title = "Maximizing tape capacity by super-blocking",
journal = j-HEWLETT-PACKARD-J,
volume = "40",
number = "3",
pages = "32--34",
month = jun,
year = "1989",
CODEN = "HPJOAX",
ISSN = "0018-1153",
bibdate = "Tue Mar 25 14:12:15 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Interrecord gaps on the tape limit the capacity
improvement attainable with data compression in the HP
7980XC Tape Drive. Super-blocking eliminates most of
these gaps.",
abstract-2 = "Super-blocking is a proprietary Hewlett--Packard
method for maximizing half-inch tape data capacity.
This capacity improvement is achieved by the removal of
some of the interrecord gaps ordinarily placed between
host data records. It is performed in real time by the
firmware residing in the cache buffer of the HP 7980XC
tape drive. The authors describe how super-blocking
works.",
acknowledgement = ack-nhfb,
affiliationaddress = "USA",
classcodes = "C5320C (Storage on moving magnetic media)",
classification = "721; 722; C5320C (Storage on moving magnetic
media)",
fjournal = "Hewlett-Packard Journal: technical information from
the laboratories of Hewlett-Packard Company",
journalabr = "Hewlett Packard J",
keywords = "Data Storage, Magnetic; Firmware; firmware; half-inch;
Half-inch tape data capacity; Hewlett--Packard; HP
7980XC; HP 7980XC tape drive; Information Theory--Data
Compression; Interrecord Gaps; Interrecord gaps;
interrecord gaps; Magnetic Tape; magnetic tape storage;
Super-Blocking; Super-blocking; super-blocking; Tape;
Tape capacity; tape capacity; tape data capacity; Tape
Drive; tape drive",
thesaurus = "Magnetic tape storage",
treatment = "P Practical",
}
@Article{Vitter:1989:ADH,
author = "Jeffrey Scott Vitter",
title = "{Algorithm 673}: Dynamic {Huffman} Coding",
journal = j-TOMS,
volume = "15",
number = "2",
pages = "158--167",
month = jun,
year = "1989",
CODEN = "ACMSCU",
DOI = "https://doi.org/10.1145/63522.214390",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
ISSN-L = "0098-3500",
bibdate = "Sun Sep 04 22:47:58 1994",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/toms.bib",
note = "See remark \cite{Novoselsky:2016:RAD}.",
URL = "http://www.acm.org/pubs/citations/journals/toms/1989-15-2/p158-vitter/",
abstract = "We present a Pascal implementation of the one-pass
algorithm for constructing dynamic Huffman codes that
is described and analyzed in a companion paper. The
program runs in real time; that is, the processing time
for each letter of the message is proportional to the
length of its codeword. The number of bits used to
encode a message of $t$ letters is less than $t$ bits
more than that used by the well-known two-pass
algorithm. This is best possible for any one-pass
Huffman scheme. In practice, it uses fewer bits than
all other Huffman schemes. The algorithm has
applications in file compression and network
transmission.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Mathematical Software (TOMS)",
journal-URL = "http://dl.acm.org/pub.cfm?id=J782",
keywords = "algorithms; design; performance; theory",
subject = "{\bf C.2.0}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf E.1}: Data, DATA STRUCTURES,
Trees. {\bf E.4}: Data, CODING AND INFORMATION THEORY,
Data compaction and compression. {\bf E.4}: Data,
CODING AND INFORMATION THEORY, Nonsecret encoding
schemes. {\bf F.2.2}: Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems. {\bf G.2.2}: Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.
{\bf H.1.1}: Information Systems, MODELS AND
PRINCIPLES, Systems and Information Theory, Value of
information.",
}
@Article{Willems:1989:UDC,
author = "F. M. J. Willems",
title = "Universal Data Compression and Repetition Times",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-35",
number = "1",
pages = "54--58",
month = jan,
year = "1989",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.42176",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Willems, F. M. J. (1989) ``Universal Data Compression
and Repetition Times,'' {\it IEEE Transactions on
Information Theory}, {\bf IT-35}(1):54--58, January.",
}
@Article{Zurek:1989:TCC,
author = "Wojciech Zurek",
title = "Thermodynamic Cost of Computation, Algorithmic
Complexity, and the Information Metric",
journal = j-NATURE,
volume = "341",
number = "6238",
pages = "119--124",
day = "14",
month = sep,
year = "1989",
CODEN = "NATUAS",
DOI = "https://doi.org/10.1038/341119a0",
ISSN = "0028-0836 (print), 1476-4687 (electronic)",
ISSN-L = "0028-0836",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Nature",
journal-URL = "http://www.nature.com/nature/archive/",
rawdata = "Zurek, Wojciech (1989) ``Thermodynamic Cost of
Computation, Algorithmic Complexity, and the
Information Metric,''{\it Nature},
{\bf341}(6238):119--124, September 14.",
}
@InProceedings{Antonini:1990:ICU,
author = "Marc Antonini and Michel Barlaud and Pierre Mathieu
and Ingrid Daubechies",
booktitle = "International Conference on Acoustics, Speech, and
Signal Processing",
title = "Image coding using vector quantization in the wavelet
transform domain",
volume = "4",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "2297--2300",
month = apr,
year = "1990",
DOI = "https://doi.org/10.1109/icassp.1990.116036",
ISSN = "1520-6149 (print), 2379-190X (electronic)",
ISSN-L = "1520-6149",
bibdate = "Wed Mar 7 10:19:22 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
keywords = "data compression; encoding; Frequency domain analysis;
frequency domains; frequency-domain analysis; Humans;
image coding; Image coding; image compression;
multiresolution codebook; Noise shaping; noise-shaping
bit-allocation; picture processing; Pixel; progressive
transmission scheme; Psychology; psychovisual features;
pyramidal algorithm architecture; Rate-distortion;
scalar quantization; Shannon's rate-distortion theory;
vector quantization; Vector quantization; visual
perception; Wavelet coefficients; wavelet transform
domain; Wavelet transforms",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
}
@Article{Bailey:1990:PDC,
author = "R. L. Bailey and R. Mukkamala",
title = "Pipelining Data Compression Algorithms",
journal = j-COMP-J,
volume = "33",
number = "4",
pages = "308--313",
month = aug,
year = "1990",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/33.4.308",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:29 MST 2012",
bibsource = "Distributed/CCR.bib;
http://comjnl.oxfordjournals.org/content/33/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/33/4/308.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/308.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/309.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/310.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/311.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/312.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/313.tif",
acknowledgement = ack-nhfb,
affiliation = "UNISYS Defense Syst., Virginia Beach Oper., VA, USA",
classcodes = "B6140 (Signal processing and detection); C1260
(Information theory)",
classification = "B6140 (Signal processing and detection); C1260
(Information theory)",
corpsource = "UNISYS Defense Syst., Virginia Beach Oper., VA, USA",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "compression rates; Compression rates; data
compression; performance; Performance, Data
Compression; pipelining data compression algorithms;
Pipelining data compression algorithms",
thesaurus = "Data compression",
treatment = "P Practical; T Theoretical or Mathematical",
xxauthor = "R. L. Bailey and R. Mukkalama",
}
@Article{Baran:1990:PSG,
author = "N. Baran",
title = "Putting the Squeeze on Graphics: Compression
technologies for full-color graphics and full-motion
video",
journal = j-BYTE,
volume = "15",
number = "13",
pages = "289--290, 292--294",
month = dec,
year = "1990",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Thu Sep 12 18:39:30 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C5260B (Computer vision and picture processing);
C6130B (Graphics techniques)",
fjournal = "BYTE Magazine",
keywords = "Dedicated processors; Image compression;
Image-compression processors; Standards; System
boards",
thesaurus = "Computer graphic equipment; Computer graphics;
Computerised picture processing",
}
@MastersThesis{Barsimantov:1990:DC,
author = "Elie Oscar Barsimantov",
title = "Data compression",
type = "Thesis {(M.S.)}",
school = "University of Colorado",
address = "Boulder, CO, USA",
pages = "132 leaves",
year = "1990",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
acknowledgement = ack-nhfb,
subject = "Data compression (Telecommunication)",
}
@Book{Bell:1990:TC,
author = "Timothy C. Bell and John G. Cleary and Ian H. Witten",
title = "Text Compression",
publisher = pub-PH,
address = pub-PH:adr,
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata-1 = "Bell, Timothy C., John J. Cleary, and Ian Hugh Witten
(1990) {\it Text Compression}, Prentice-Hall, Englewood
Cliffs, N.J.",
rawdata-2 = "Bell, Timothy C., John G. Cleary, and Ian H. Witten
(1990) {\it Text Compression}, Englewood Cliffs,
Prentice Hall.",
}
@Article{Berger:1990:OEB,
author = "T. Berger and R. Yeung",
title = "Optimum `1'-Ended Binary Prefix Codes",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "36",
number = "6",
pages = "1435--1441",
month = nov,
year = "1990",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.59940",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Berger, T. and R. Yeung (1990) ``Optimum `1'-Ended
Binary Prefix Codes,'' {\it IEEE Transactions on
Information Theory}, {\bf36}(6):1435--1441, November.",
}
@Article{Bookstein:1990:CIT,
author = "Abraham Bookstein and Shmuel T. Klein",
title = "Compression, Information Theory, and Grammars: a
Unified Approach",
journal = j-TOIS,
volume = "8",
number = "1",
pages = "27--49",
month = jan,
year = "1990",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/78915.78917",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Sat Jan 16 19:04:41 MST 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
http://liinwww.ira.uka.de/bibliography/Database/Graefe.html;
http://www.acm.org/pubs/tois/toc.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
URL = "http://www.acm.org:80",
abstract = "We propose the notion of a formal grammar as a
flexible model of text generation that encompasses most
of the models offered before as well as, in principle,
extending the possibility of compression to a much more
general class of languages. Assuming a general model of
text generation, a derivation is given of the well
known Shannon entropy formula, making possible a theory
of information based upon text representation rather
than on communication. The ideas are shown to apply to
a number of commonly used text models. Finally, we
focus on a Markov model of text generation, suggest an
information theoretic measure of similarity between two
probability distributions, and develop a clustering
algorithm based on this measure. This algorithm allows
us to cluster Markov states and thereby base our
compression algorithm on a smaller number of
probability distributions than would otherwise have
been required. A number of theoretical consequences of
this approach to compression are explored, and a
detailed example is given.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Chicago",
affiliationaddress = "Chicago, IL, USA",
classification = "721; 723; 922",
fjournal = "ACM Transactions on Information Systems (TOIS)",
journalabr = "ACM Trans Inf Syst",
keywords = "Algorithms; Artificial intelligence; Automata
Theory--Grammars; Codes; Coding and information theory;
Computer Programming--Algorithms; Data; Data compaction
and compression; Data Compression; Huffman coding;
Huffman Coding; Information storage; Information
storage and retrieval; Information theory; Information
Theory; Language Generation; Markov model of language
generation; Markov Models; Models and principles;
Natural language processing; Probability--Random
Processes; Symbolic--Encoding; Systems and information
theory; Theory",
}
@TechReport{Coifman:1990:SPC,
author = "Ronald R. Coifman and Yves Meyer and Stephen R. Quake
and Mladen Victor Wickerhauser",
title = "Signal Processing and Compression with Wavelet
Packets",
type = "Preprint",
institution = "Yale University",
address = "New Haven",
month = apr,
year = "1990",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://math.yale.edu/pub/wavelets/cmqw.tex",
}
@TechReport{Cushing:1990:DCA,
author = "John Aikin Cushing",
title = "Data compression algorithms for {English} text based
on word frequency",
volume = "109",
type = "Working paper",
institution = "Institute of Economic Research, Kobe University of
Commerce",
address = "Kobe, Japan",
pages = "57",
year = "1990",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Working paper",
acknowledgement = ack-nhfb,
}
@InProceedings{Feig:1990:DCT,
author = "Ephraim N. Feig and Elliot Linzer",
booktitle = "{Proceedings Electronic Imaging '90 East, Boston, MA,
USA}",
title = "Discrete Cosine Transform Algorithms for Image Data
Compression",
publisher = "????",
address = "????",
pages = "84--87",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata-1 = "Feig, E., and E. Linzer (1990) ``Discrete Cosine
Transform Algorithms for Image Data Compression,'' in
{\it Proceedings Electronic Imaging '90 East}, pp.
84--87, Boston, MA.",
rawdata-2 = "Feig, Ephraim N., and Elliot Linzer (1990) ``Discrete
Cosine Transform Algorithms for Image Data
Compression,'' {\it Proceedings Electronic Imaging '90
East}, pages 84--87, Boston, MA.",
}
@Article{Fraenkel:1990:BHC,
author = "Aviezri S. Fraenkel and Shmuel T. Klein",
title = "Bidirectional {Huffman} Coding",
journal = j-COMP-J,
volume = "33",
number = "4",
pages = "296--307",
month = aug,
year = "1990",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/33.4.296",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "94A29",
MRnumber = "92a:94005",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Distributed/CCR.bib;
http://comjnl.oxfordjournals.org/content/33/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/33/4/296.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/296.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/297.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/298.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/299.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/300.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/301.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/302.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/303.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/304.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/305.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/306.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/307.tif",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliation = "Dept. of Appl. Math. and Comput. Sci., Weizmann Inst.
of Sci, Rehovot, Israel",
classcodes = "B6120B (Codes); C1260 (Information theory)",
classification = "B6120B (Codes); C1260 (Information theory)",
corpsource = "Dept. of Appl. Math. and Comput. Sci., Weizmann Inst.
of Sci, Rehovot, Israel",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "Affix property; affix property; bidirectional Huffman
coding; Data Compression, Bidirectional Huffman coding;
Decoding; decoding; encoding; Necessary conditions;
necessary conditions; Prefix; prefix; Suffix; suffix;
Worst case complexity; worst case complexity",
rawdata = "Fraenkel, Aviezri S. and Shmuel T. Klein (1990)
``Bidirectional Huffman Coding,'' {\it The Computer
Journal}, {\bf33}:296--307.",
reviewer = "Alexander M. Barg",
thesaurus = "Decoding; Encoding",
treatment = "P Practical; T Theoretical or Mathematical",
}
@InProceedings{Hawley:1990:POAa,
author = "Michael Hawley",
title = "The Personal Orchestra, or Audio Data Compression by
10,000:1",
crossref = "USENIX:1990:CSSa",
volume = "3",
number = "2",
pages = "289--330",
month = "Spring",
year = "1990",
bibdate = "Fri Oct 18 07:24:24 MDT 1996",
bibsource = "ftp://ftp.uu.net/library/bibliography;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "MIT Media Laboratory",
}
@Article{Hawley:1990:POAb,
author = "Michael Hawley",
title = "The Personal Orchestra, or Audio Data Compression by
10,000:1",
journal = j-COMP-SYS,
volume = "3",
number = "2",
pages = "289--329",
month = "Spring",
year = "1990",
CODEN = "CMSYE2",
ISSN = "0895-6340",
bibdate = "Fri Sep 13 08:53:14 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Media Lab., MIT, Cambridge, MA, USA",
classification = "B6450F (Sound synthesisers); C7820 (Humanities)",
fjournal = "Computing Systems",
keywords = "Analytical programs; Audio data compression;
Bosendorfer Imperial concert grand piano; Complex
scores; Computer disk; Music system; Musical research;
Personal orchestra; Synthesizers; Synthetic orchestra;
Totentanz; Western classical music; Workstation",
thesaurus = "Computer aided analysis; Electronic music; Music;
Personal computing",
}
@Article{Hirschberg:1990:EDP,
author = "Daniel S. Hirschberg and Debra A. Lelewer",
title = "Efficient Decoding of Prefix Codes",
journal = j-CACM,
volume = "33",
number = "4",
pages = "449--459",
month = apr,
year = "1990",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/77556.77566",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
note = "This is the first of four key papers behind the {\tt
bzip2} compression tools. The others are
\cite{Burrows:1994:BSL,Wheeler:1997:UBM,Sedgewick:1997:FAS}.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/77566.html",
abstract = "A special case of the data compression problem is
presented, in which a powerful encoder transmits a
coded file to a decoder that has severely constrained
memory. A data structure that achieves minimum storage
is presented, and alternative methods that sacrifice a
small amount of storage to attain faster decoding are
described.",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; bzip2; performance",
rawdata = "Hirschberg, D., and D. Lelewer (1990) ``Efficient
Decoding of Prefix Codes,'' {\it Communications of the
ACM}, {\bf33}(4):449--459.",
remark = "This is the first of four key papers behind the {\tt
bzip2} compression tools. The others are listed in the
{\tt bzip2} manual.",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf E.1}: Data, DATA
STRUCTURES, Tables. {\bf E.2}: Data, DATA STORAGE
REPRESENTATIONS. {\bf H.1.1}: Information Systems,
MODELS AND PRINCIPLES, Systems and Information Theory,
Information theory.",
}
@Misc{ITU-T:1990:RGK,
author = "{ITU-T}",
title = "Recommendation {G.726} (12/90): 40, 32, 24, 16 kbit/s
{Adaptive Differential Pulse Code Modulation (ADPCM)}",
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "ITU-T (1990), Recommendation G.726 (12/90), {\it40,
32, 24, 16 kbit/s Adaptive Differential Pulse Code
Modulation (ADPCM)}.",
}
@Article{Jagadish:1990:CTM,
author = "H. V. Jagadish",
title = "A Compression Technique to Materialize Transitive
Closure",
journal = j-TODS,
volume = "15",
number = "4",
pages = "558--598",
month = dec,
year = "1990",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/99935.99944",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P10",
MRnumber = "1 093 244",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-4/p558-jagadish/p558-jagadish.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-4/p558-jagadish/;
http://www.acm.org/pubs/toc/Abstracts/tods/99944.html",
abstract = "An important feature of database support for expert
systems is the ability of the database to answer
queries regarding the existence of a path from one node
to another in the directed graph underlying some
database relation. Given just the database relation,
answering such a query is time-consuming, but given the
transitive closure of the database relation a table
look-up suffices. We present an indexing scheme that
permits the storage of the pre-computed transitive
closure of a database relation in a compressed form.
The existence of a specified tuple in the closure can
be determined from this compressed store by a single
look-up followed by an index comparison. We show how to
add nodes and arcs to the compressed closure
incrementally. We also suggest how this compression
technique can be used to reduce the effort required to
compute the transitive closure.",
acknowledgement = ack-nhfb,
affiliation = "AT\&T Bell Lab., Murray Hill, NJ, USA",
annote = "an indexing scheme that permits the storage of the
pre-computed transitive closure",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
keywords = "performance; recursive query processing TODS,
algorithms",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf I.2.1}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Applications
and Expert Systems. {\bf I.2.8}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Problem
Solving, Control Methods, and Search.",
}
@Article{Karpovsky:1990:ORC,
author = "M. G. Karpovsky and P. Nagvajara",
title = "Optimal robust compression of test responses",
journal = j-IEEE-TRANS-COMPUT,
volume = "39",
number = "1",
pages = "138--141",
month = jan,
year = "1990",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/12.46290",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 7 14:19:59 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1990.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=46290",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Kyle:1990:EIC,
author = "Jim Kyle",
title = "{ECOMP} Image Compression",
journal = j-COMP-LANG-MAG,
volume = "7",
number = "12",
pages = "78--??",
month = dec,
year = "1990",
CODEN = "COMLEF",
ISSN = "0749-2839",
bibdate = "Tue Jan 23 08:04:25 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Language Magazine",
}
@TechReport{Lamb:1990:CRT,
author = "D. A. Lamb and D. T. Barnard",
key = "Lamb \& Barnard",
title = "Compact Representation of Text Files",
institution = "Queen's University",
address = "Kingston, Ontario",
pages = "1--7",
month = mar,
year = "1990",
bibdate = "Tue Jun 12 15:38:29 1990",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
Misc/programming.env.bib",
abstract = "We describe a simple method of representing text files
as sequences of one-byte or two-byte codes; each code
represents a word, a control code, or a punctuation
mark. For our sample of English prose, this method
obtains compression similar to that of Lempel--Ziv (as
embodied in the UNIX compress utility). The
representation is suited for modern
what-you-see-is-what-you-get text formatting programs,
since it permits them to do some operations (such as
determining the width of a word in a particular font)
once per distinct word rather than at each occurrence
of a word.",
owner = "robyn",
}
@InProceedings{Mahoney:1990:GB,
author = "Michael S. Mahoney",
editor = "Charles Coulston Gillispie",
booktitle = "Dictionary of Scientific Biography",
title = "{Goldbach}'s Biography",
publisher = "Scribner's",
address = "New York, NY, USA",
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "14 volumes, 1970--1990",
acknowledgement = ack-ds,
rawdata = "Mahoney, Michael S. (1990) ``Goldbach's Biography'' in
Charles Coulston Gillispie {\it Dictionary of
Scientific Biography}, New York, NY, Scribner's, 14
vols. 1970--1990.",
}
@Article{Marking:1990:DGI,
author = "Michael P. Marking",
title = "Decoding Group 3 Images",
journal = j-CUJ,
volume = "8",
number = "6",
pages = "45--54",
month = jun,
year = "1990",
ISSN = "0898-9788",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.cuj.com/cbklist.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "C Users Journal",
rawdata = "Marking, Michael P. (1990) ``Decoding Group~3
Images,'' {\it The C Users Journal}, pp. 45--54,
June.",
}
@Article{Miastkowski:1990:MFG,
author = "S. Miastkowski",
title = "A `more filling' generation of tape backup",
journal = j-BYTE,
volume = "15",
number = "13",
pages = "235--237",
month = dec,
year = "1990",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Thu Sep 12 18:39:30 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C5310 (Storage system design); C5320C (Storage on
moving magnetic media)",
fjournal = "BYTE Magazine",
keywords = "250 MB; 300 MB; Colorado Memory Systems; Core
International; Coretape Light; Data compression; Jumbo
250; Tape backup",
numericalindex = "Memory size 2.6E+08 Byte; Memory size 3.1E+08 Byte",
thesaurus = "Magnetic tape storage; Storage units",
}
@Article{Moffat:1990:IPD,
author = "Alistair Moffat",
title = "Implementing the {PPM} Data Compression Scheme",
journal = j-IEEE-TRANS-COMM,
volume = "COM-38",
number = "11",
pages = "1917--1921",
month = nov,
year = "1990",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/26.61469",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
keywords = "prediction by partial matching (PPM) data compression
algorithm",
rawdata-1 = "Moffat, Alistair (1990) ``Implementing the PPM Data
Compression Scheme,'' {\it IEEE Transactions on
Communications}, {\bf COM-38}(11):1917--1921,
November.",
rawdata-2 = "Moffat, Alistair (1990) ``Implementing the PPM Data
Compression Scheme,'' {\it IEEE Transactions on
Communications} COM-38(11):1917--1921, November.",
}
@Article{Ornstein:1990:UAS,
author = "Donald S. Ornstein and Paul C. Shields",
title = "Universal Almost Sure Data Compression",
journal = j-ANN-PROBAB,
volume = "18",
number = "2",
pages = "441--452",
month = apr,
year = "1990",
CODEN = "APBYAE",
DOI = "https://doi.org/10.1214/aop/1176990840",
ISSN = "0091-1798 (print), 2168-894X (electronic)",
ISSN-L = "0091-1798",
bibdate = "Sun Apr 20 10:44:17 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/annprobab1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://projecteuclid.org/euclid.aop/1176990840",
acknowledgement = ack-nhfb,
fjournal = "Annals of Probability",
journal-URL = "http://projecteuclid.org/all/euclid.aop",
}
@Misc{Perkins:1990:RPPa,
author = "D. Perkins",
title = "{RFC 1171}: Point-to-Point Protocol for the
transmission of multi-protocol datagrams over
Point-to-Point links",
day = "1",
month = jul,
year = "1990",
bibdate = "Thu Oct 16 09:34:09 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Obsoleted by RFC1331 \cite{Simpson:1992:RPP}.
Obsoletes RFC1134 \cite{Perkins:1989:RPP}. Status:
DRAFT STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1134.txt;
ftp://ftp.internic.net/rfc/rfc1171.txt;
ftp://ftp.internic.net/rfc/rfc1331.txt;
https://www.math.utah.edu/pub/rfc/rfc1134.txt;
https://www.math.utah.edu/pub/rfc/rfc1171.txt;
https://www.math.utah.edu/pub/rfc/rfc1331.txt",
acknowledgement = ack-nhfb,
format = "TXT=92321 bytes",
obsoletedby = "Obsoleted by RFC1331 \cite{Simpson:1992:RPP}.",
obsoletes = "Obsoletes RFC1134 \cite{Perkins:1989:RPP}.",
online = "yes",
status = "DRAFT STANDARD",
}
@Misc{Perkins:1990:RPPb,
author = "D. Perkins and R. Hobby",
title = "{RFC 1172}: Point-to-Point Protocol ({PPP}) initial
configuration options",
day = "1",
month = jul,
year = "1990",
bibdate = "Fri Oct 17 17:20:11 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Obsoleted by RFC1331 \cite{Simpson:1992:RPP}. Status:
PROPOSED STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1172.txt;
ftp://ftp.internic.net/rfc/rfc1331.txt;
https://www.math.utah.edu/pub/rfc/rfc1172.txt;
https://www.math.utah.edu/pub/rfc/rfc1331.txt",
acknowledgement = ack-nhfb,
format = "TXT=76132 bytes",
obsoletedby = "Obsoleted by RFC1331 \cite{Simpson:1992:RPP}.",
online = "yes",
status = "PROPOSED STANDARD",
}
@Book{Prusinkiewicz:1990:ABP,
author = "P. Prusinkiewicz and A. Lindenmayer",
title = "The Algorithmic Beauty of Plants",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Prusinkiewicz, P., and A. Lindenmayer (1990) {\it The
Algorithmic Beauty of Plants}, New York,
Springer-Verlag. Prusinkiewicz, P., A. Lindenmayer, and
F. D. Fracchia (1991) ``Synthesis of Space-Filling
Curves on the Square Grid,'' {\it Fractals in the
Fundamental and Applied Sciences}, Peitgen, H.-O., et
al. (eds.), Amsterdam, Elsevier Science Publishers, pp.
341--366. Pylak, Pawe\l\ (2003) ``Efficient
Modification of LZSS Compression Algorithm,'' {\it
Annales UMCS Informatica}, section AI, pp. 61--72,
Lublin, Poland. Also available online at
|www.annales.umcs.lublin.pl/AI/2003/07.pdf|.",
}
@Article{Pylak:1990:EML,
author = "Pawe{\l} Pylak",
title = "Efficient Modification of {LZSS} Compression
Algorithm",
journal = "Annales UMCS Informatica, section AI",
pages = "61--72",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.annales.umcs.lublin.pl/AI/2003/07.pdf",
acknowledgement = ack-ds,
rawdata = "Prusinkiewicz, P., and A. Lindenmayer (1990) {\it The
Algorithmic Beauty of Plants}, New York,
Springer-Verlag. Prusinkiewicz, P., A. Lindenmayer, and
F. D. Fracchia (1991) ``Synthesis of Space-Filling
Curves on the Square Grid,'' {\it Fractals in the
Fundamental and Applied Sciences}, Peitgen, H.-O., et
al. (eds.), Amsterdam, Elsevier Science Publishers, pp.
341--366. Pylak, Pawe\l\ (2003) ``Efficient
Modification of LZSS Compression Algorithm,'' {\it
Annales UMCS Informatica}, section AI, pp. 61--72,
Lublin, Poland. Also available online at
|www.annales.umcs.lublin.pl/AI/2003/07.pdf|.",
remark = "Lublin, Poland",
}
@Book{Rao:1990:DCT,
author = "K. R. Rao and P. Yip",
title = "Discrete Cosine Transform---Algorithms, Advantages,
Applications",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Rao, K. R., and P. Yip (1990) {\it Discrete Cosine
Transform---Algorithms, Advantages, Applications},
London, Academic Press.",
}
@Article{Regan:1990:LRS,
author = "Shawn M. Regan",
title = "{LZW} revisited (speeding up data compression)",
journal = j-DDJ,
volume = "15",
number = "6",
pages = "126--127, 167",
month = jun,
year = "1990",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 10 09:26:18 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "Shawn enhances this popular data compression
algorithm.",
acknowledgement = ack-nhfb,
affiliation = "MicroBilt Inc., Atlanta, GA, USA",
classification = "C6130 (Data handling techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "9-Bit codes; Code size; Compression program;
Compression ratio; Execution speed; Expansion programs;
LZW data compression algorithm; String table; Table
clearing",
thesaurus = "C listings; Data compression",
}
@Misc{Rokicki:1990:GV,
author = "Tomas Rokicki",
title = "{GFtoPK}, v. 2.3",
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://tug.org/texlive/devsrc/Build/source/texk/web2c/gftopk.web",
acknowledgement = ack-ds,
rawdata = "Rokicki, Tomas (1990) ``GFtoPK, v. 2.3,'' available
at\hfil\break
|http://tug.org/texlive/devsrc/Build/source/texk/web2c/gftopk.web|.",
}
@Book{Samet:1990:ASD,
author = "Hanan Samet",
title = "Applications of Spatial Data Structures: Computer
Graphics, Image Processing, and {GIS}",
publisher = pub-AW,
address = pub-AW:adr,
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Samet, Hanan (1990a) {\it Applications of Spatial Data
Structures: Computer Graphics, Image Processing, and
GIS}, Reading, MA, Addison-Wesley.",
}
@Book{Samet:1990:DAS,
author = "Hanan Samet",
title = "The Design and Analysis of Spatial Data Structures",
publisher = pub-AW,
address = pub-AW:adr,
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Samet, Hanan (1990b) {\it The Design and Analysis of
Spatial Data Structures}, Reading, MA,
Addison-Wesley.",
}
@Article{Searfoss:1990:BBD,
author = "Glenn Searfoss",
title = "Bounding Box Data Compression",
journal = j-DDJ,
volume = "15",
number = "4",
pages = "56--64, 108",
month = apr,
year = "1990",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 03 09:12:37 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "The ``bounding box'' method of data compression is
fast and efficient for bit-mapped data. Glenn describes
this technique and compares it to the better-known
RLE.",
acknowledgement = ack-nhfb,
affiliation = "Data Transforms Inc., Denver, CO, USA",
classification = "C6130 (Data handling techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Bit-mapped data; Bounding box method; C program
listings; Data compression; RLE; Run length bit
encoding",
thesaurus = "C listings; Data compression",
}
@Article{Shepard:1990:DCM,
author = "Ron Shepard",
title = "A data compression method applicable to first-order
convergent iterative procedures",
journal = j-J-COMPUT-CHEM,
volume = "11",
number = "1",
pages = "45--57",
month = jan,
year = "1990",
CODEN = "JCCHDD",
DOI = "https://doi.org/10.1002/jcc.540110105",
ISSN = "0192-8651 (print), 1096-987X (electronic)",
ISSN-L = "0192-8651",
bibdate = "Thu Nov 29 14:54:09 MST 2012",
bibsource = "http://www.interscience.wiley.com/jpages/0192-8651;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputchem1990.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational Chemistry",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1096-987X",
onlinedate = "7 Sep 2004",
}
@InProceedings{Sierpinski:1990:NCQ,
author = "W. Sierpi{\'n}ski",
editor = "John Woods",
booktitle = "Subband Coding",
title = "Sur Une Nouvelle Courbe Qui Remplit Toute Une Aire
Plaine,'' {{\it Bull. Acad. Sci. Cracovie}}, {{\bf
Serie A}}:462--478. {Simoncelli, Eero P., and Edward.
H. Adelson (1990) ``Subband Transforms''}",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "143--192",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprint of \cite{Sierpinski:1912:CQR}.",
acknowledgement = ack-ds,
rawdata = "Sierpi\'nski, W. (1912) ``Sur Une Nouvelle Courbe Qui
Remplit Toute Une Aire Plaine,'' {\it Bull. Acad. Sci.
Cracovie}, {\bf Serie~A}:462--478. Simoncelli, Eero P.,
and Edward. H. Adelson (1990) ``Subband Transforms,''
{\it Subband Coding}, John Woods, ed., Boston, MA,
Kluwer Academic Press, pp. 143--192.",
}
@InProceedings{Simoncelli:1990:ST,
author = "Eero P. Simoncelli and Edward. H. Adelson",
editor = "John Woods",
booktitle = "Subband Coding",
title = "Subband Transforms",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "143--192",
year = "1990",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Simoncelli, Eero P., and Edward. H. Adelson (1990)
``Subband Transforms,'' in Woods, John, editor, {\it
Subband Coding}, Boston, Kluwer Academic Press,
143--192.",
}
@MastersThesis{Tong:1990:DCS,
author = "Tak Yen Tong",
title = "Diversity and coding in spread spectrum systems",
school = "University of Waterloo",
address = "Waterloo, ON, Canada",
pages = "1",
year = "1990",
ISBN = "0-315-57908-0",
ISBN-13 = "978-0-315-57908-8",
LCCN = "????",
bibdate = "Tue Jan 29 10:44:38 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303906263",
acknowledgement = ack-nhfb,
classification = "0537: Engineering",
dissertation-thesis-number = "ML57908",
subject = "Engineering",
}
@Article{Vaughan-Nichols:1990:GYBb,
author = "S. J. Vaughan-Nichols",
title = "Getting Your Byte's Worth: Hardware-based data
compression gives you more bang for your {QIC}, {DAT},
and hard disk buck",
journal = j-BYTE,
volume = "15",
number = "12",
pages = "331--332, 334--336",
month = nov,
year = "1990",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Thu Sep 12 18:39:30 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Bendix Field Eng. Corp., Seabrook, MD, USA",
classification = "B1265B (Logic circuits); B3120B (Magnetic recording
); B6120B (Codes); C5120 (Logic and switching
circuits); C5320C (Storage on moving magnetic media);
C6130 (Data handling techniques)",
fjournal = "BYTE Magazine",
keywords = "DAT; Data compression chips; Digital audio tape; Hard
discs; QIC; Quarter inch tape; Tape drive controllers",
thesaurus = "Application specific integrated circuits; Data
compression; Digital audio tape; Magnetic tape
storage",
}
@Article{Vaughan-Nichols:1990:SSW,
author = "S. J. Vaughan-Nichols",
title = "Saving Space: Whatever size hard disk you have, it's
probably nearly full. Data compression can help",
journal = j-BYTE,
volume = "15",
number = "3",
pages = "237--238, 240, 242--243",
month = mar,
year = "1990",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Thu Sep 12 17:47:21 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C5320C (Storage on moving magnetic media); C6120
(File organisation)",
fjournal = "BYTE Magazine",
keywords = "Data compression; Floppy disks; Hard disk; Storage
space",
thesaurus = "Data compression; Hard discs; Storage management",
}
@PhdThesis{Weiss:1990:SRI,
author = "Peter Weiss",
title = "Size reduction of inverted files using data
compression and data structure reorganization",
type = "{D.Sc.} thesis",
school = "The George Washington University",
address = "Washington, DC, USA",
pages = "174",
year = "1990",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303869016",
acknowledgement = ack-nhfb,
advisor = "Arnold C. Meltzer",
classification = "0984: Computer science",
dissertation-thesis-number = "9113770",
subject = "Computer science",
}
@TechReport{Wickerhauser:1990:PCB,
author = "Mladen Victor Wickerhauser",
title = "Picture Compression by Best-Basis Sub-Band Coding",
type = "Preprint",
institution = "Yale University",
year = "1990",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://math.yale.edu/pub/wavelets/pic.tar",
}
@PhdThesis{Zhang:1990:JID,
author = "Manyun Zhang",
title = "The {JPEG} and Image Data Compression Algorithms",
school = "????",
address = "????",
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Zhang, Manyun (1990) {\it The JPEG and Image Data
Compression Algorithms} (dissertation).",
remark = "Not in Proquest Dissertations \& Theses (PQDT)
database.",
}
@InProceedings{Anderson:1991:VHS,
author = "R. Anderson and J. Bowers and W.-C. Fang and D.
Johnson and J.-J. Lee and R. Nixon",
title = "A very high speed noiseless data compression chip for
space imaging applications",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213299",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213299",
acknowledgement = ack-nhfb,
}
@Article{Ang:1991:VCM,
author = "P. H. Ang and P. A. Ruetz and D. Auld",
title = "Video compression makes big gains",
journal = j-IEEE-SPECTRUM,
volume = "28",
number = "10",
pages = "16--19",
month = oct,
year = "1991",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.90209",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Wed Jan 15 16:15:28 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Bandwidth; broadcasting; CCITT; CCITT Recommendation
H.261; communication; computing; data compression;
Digital audio broadcasting; digital integrated
circuits; digital storage media; Digital video
broadcasting; digital video standards; full-motion
compression; HDTV; High definition video; Humans; IC
chips; Image coding; Image storage; Joint Photographic
Experts Group; monolithic integrated circuits; Moving
Pictures Experts Group; picture processing; Signal
resolution; standards; teleconferencing; Video
compression; video compression; video equipment; video
signals; video teleconferencing",
}
@Article{Anonymous:1991:DDC,
author = "Anonymous",
title = "The {DDJ} Data Compression Contest",
journal = j-DDJ,
volume = "16",
number = "2",
pages = "52--??",
month = feb,
year = "1991",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 03 09:15:28 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "Here's your chance to prove that your favorite
compression technique is better than that of your
fellow programmers.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Apiki:1991:LDC,
author = "Steve Apiki",
title = "Lossless Data Compression: An explanation of two
compression algorithms",
journal = j-BYTE,
volume = "16",
number = "3",
pages = "309--312, 314, 386--387",
month = mar,
year = "1991",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Tue Jan 2 10:01:41 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
fjournal = "BYTE Magazine",
keywords = "Compression algorithms; Data compression; Huffman
coding; Lossless compression; LZW coding",
thesaurus = "Data compression; Encoding",
}
@InProceedings{Bassiouni:1991:EIC,
author = "M. Bassiouni and A. Mukherjee and N. Tzannes",
title = "Experiments on improving the compression of special
data types",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213328",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213328",
acknowledgement = ack-nhfb,
}
@InProceedings{Basu:1991:TCU,
author = "D. Basu",
title = "Text compression using several {Huffman} trees",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213309",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213309",
acknowledgement = ack-nhfb,
}
@InProceedings{Blitstein:1991:DIM,
author = "R. Blitstein",
title = "A design to increase media-independent data integrity
and availability through the use of robotic media
management systems",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213332",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213332",
acknowledgement = ack-nhfb,
}
@InProceedings{Bodlaender:1991:CAM,
author = "H. Bodlaender and T. Gonzalez and T. Kloks",
title = "Complexity aspects of map compression",
crossref = "Storer:1991:DDC",
pages = "287--296",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213352",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213352",
acknowledgement = ack-nhfb,
}
@InProceedings{Bookstein:1991:FCB,
author = "A. Bookstein and S. T. Klein",
title = "Flexible compression for bitmap sets",
crossref = "Storer:1991:DDC",
pages = "402--410",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213340",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213340",
acknowledgement = ack-nhfb,
}
@Article{Boyd:1991:ESD,
author = "Colin Boyd",
title = "Enhancing Secrecy by Data Compression: Theoretical and
Practical Aspects",
journal = j-LECT-NOTES-COMP-SCI,
volume = "547",
pages = "266--??",
year = "1991",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Feb 4 12:02:05 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t0547.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/0547/05470266.htm;
http://link.springer-ny.com/link/service/series/0558/papers/0547/05470266.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bridges:1991:DIC,
author = "John Bridges",
title = "Differential image compression",
journal = j-DDJ,
volume = "16",
number = "2",
pages = "38, 40--42, 44, 46, 48, 51",
month = feb,
year = "1991",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 10 09:11:02 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "DFF keeps track of the differences between images
rather than the images themselves.",
acknowledgement = ack-nhfb,
classification = "B6140C (Optical information and image processing);
C5260B (Computer vision and picture processing); C6130
(Data handling techniques); C7820 (Humanities)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Animated sequences; DFF algorithm; Differential image
compression; Display memory; Frame differences;
Real-time decoding; Space savings performance",
thesaurus = "Cinematography; Computer animation; Computerised
picture processing; Data compression",
}
@Article{Cate:1991:CCCa,
author = "Vincent Cate and Thomas Gross",
title = "Combining the concepts of compression and caching for
a two-level filesystem",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "200--211",
month = apr,
year = "1991",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/106974.106993",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
}
@Article{Cate:1991:CCCb,
author = "Vincent Cate and Thomas Gross",
title = "Combining the concepts of compression and caching for
a two-level filesystem",
journal = j-COMP-ARCH-NEWS,
volume = "19",
number = "2",
pages = "200--211",
month = apr,
year = "1991",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/106975.106993",
ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@PhdThesis{Cespedes:1991:ACM,
author = "Ernesto Raul Cespedes",
title = "Adaptive compression of multisensor image data",
type = "{Ph.D.} thesis",
school = "Mississippi State University",
address = "Mississippi State, MS 39762, USA",
pages = "204",
year = "1991",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303923204",
acknowledgement = ack-nhfb,
advisor = "John K. Owens",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "9218185",
subject = "Electrical engineering",
}
@Article{Chang:1991:DCU,
author = "Daniel K. Chang",
title = "Data Compression Using Hierarchical Dictionaries",
journal = j-J-SYST-SOFTW,
volume = "15",
number = "3",
pages = "233--238",
month = jul,
year = "1991",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/0164-1212(91)90039-9",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed Sep 8 09:22:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Chang:1991:ECC,
author = "M. Chang and G. G. {Langdon, Jr.}",
title = "Effect of coefficient coding on {JPEG} baseline image
compression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213331",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213331",
acknowledgement = ack-nhfb,
}
@InProceedings{Chang:1991:EDC,
author = "D. K. Chang",
title = "Exact data compression using hierarchical
dictionaries",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213330",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213330",
acknowledgement = ack-nhfb,
}
@Article{Chang:1991:LOP,
author = "Chin-Chen Chang and Tzong-Chen Wu",
title = "A Letter-oriented Perfect Hashing Scheme Based upon
{Sparse} Table Compression",
journal = j-SPE,
volume = "21",
number = "1",
pages = "35--49",
month = jan,
year = "1991",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.4380210104",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Sat May 31 13:36:16 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@InProceedings{Chang:1991:UDCa,
author = "S.-Y. Chang and J. J. Metzner",
title = "Universal data compression algorithms by using full
tree models",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213303",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213303",
acknowledgement = ack-nhfb,
}
@PhdThesis{Chang:1991:UDCb,
author = "Soo-Young Chang",
title = "Universal data compression by using tree models",
type = "{Ph.D.} thesis",
school = "The Pennsylvania State University",
address = "University Park, PA, USA",
pages = "166",
year = "1991",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303950372",
acknowledgement = ack-nhfb,
advisor = "John J. Metzner",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "9127305",
subject = "Electrical engineering",
}
@InProceedings{Chau:1991:SCB,
author = "W. K. Chau and S. K. M. Wong and X. D. Yang and S. J.
Wan",
title = "On the selection of color basis for image
compression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213320",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213320",
acknowledgement = ack-nhfb,
}
@PhdThesis{Chen:1991:EDC,
author = "Ji Chen",
title = "The effect of data compression on image quality in
high-resolution 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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303978189",
acknowledgement = ack-nhfb,
advisor = "Janice M. Jenkins and Michael J. Flynn",
classification = "0541: Biomedical research; 0544: Electrical
engineering; 0574: Radiology",
dissertation-thesis-number = "9135566",
subject = "Electrical engineering; Radiology; Biomedical
research",
}
@InProceedings{Chen:1991:IHI,
author = "K. Chen and T. V. Ramabadran",
title = "An improved hierarchical interpolation ({HINT}) method
for the reversible compression of grayscale images",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213325",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213325",
acknowledgement = ack-nhfb,
}
@InProceedings{Chevion:1991:HEM,
author = "D. Chevion and E. D. Karnin and E. Walach",
title = "High efficiency, multiplication free approximation of
arithmetic coding",
crossref = "Storer:1991:DDC",
pages = "43--52",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213372",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213372",
acknowledgement = ack-nhfb,
}
@InProceedings{Chou:1991:UMP,
author = "W.-K. Chou and D. Y. Y. Yun",
title = "A uniform model for parallel {Fast Fourier Transform
(FFT)} and {Fast Discrete Cosine Transform (FDCT)}",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213304",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213304",
acknowledgement = ack-nhfb,
}
@InProceedings{Cosman:1991:CVQ,
author = "P. C. Cosman and R. M. Gray and E. A. Riskin",
title = "Combining vector quantization and histogram
equalization",
crossref = "Storer:1991:DDC",
pages = "113--118",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213378",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213378",
acknowledgement = ack-nhfb,
}
@InProceedings{Culik:1991:UFG,
author = "K. {Culik II} and S. Dube",
title = "Using fractal geometry for image compression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213302",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213302",
acknowledgement = ack-nhfb,
}
@InProceedings{Desoky:1991:PAV,
author = "A. Desoky and Y. You",
title = "Performance analysis of a vector quantization
algorithm of image data",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213318",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213318",
acknowledgement = ack-nhfb,
}
@InProceedings{DeVore:1991:DCU,
author = "R. A. DeVore and B. Jawerth and B. J. Lucier",
title = "Data compression using wavelets: error, smoothness and
quantization",
crossref = "Storer:1991:DDC",
pages = "186--195",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213386",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213386",
acknowledgement = ack-nhfb,
}
@InProceedings{Dozier:1991:OED,
author = "J. Dozier",
title = "Overview of the {EOS} Data and Information System",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213295",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213295",
acknowledgement = ack-nhfb,
}
@Book{ECMA-151,
author = "{ECMA}",
title = "{ECMA-151}: Data Compression for Information
Interchange --- Adaptive Coding with Embedded
Dictionary --- {DCLZ} Algorithm",
publisher = pub-ECMA,
address = pub-ECMA:adr,
month = jun,
year = "1991",
bibdate = "Thu Feb 22 08:43:46 MST 2001",
bibsource = "http://www.ecma-international.org/publications/standards/Standard.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ecma.ch/ecma1/STAND/ECMA-151.HTM",
acknowledgement = ack-nhfb,
ECMAnumber = "ECMA-151",
}
@Book{ECMA-159,
author = "{ECMA}",
title = "{ECMA-159}: Data Compression for Information
Interchange --- Binary Arithmetic Coding Algorithm",
publisher = pub-ECMA,
address = pub-ECMA:adr,
month = dec,
year = "1991",
bibdate = "Thu Feb 22 08:43:46 MST 2001",
bibsource = "http://www.ecma-international.org/publications/standards/Standard.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ecma.ch/ecma1/STAND/ECMA-159.HTM",
acknowledgement = ack-nhfb,
ECMAnumber = "ECMA-159",
}
@InProceedings{Elliott:1991:CTD,
author = "J. A. Elliott and P. M. Grant and G. G. Sexton",
title = "Concurrent techniques for developing motion video
compression algorithms",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213335",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213335",
acknowledgement = ack-nhfb,
}
@InProceedings{Fang:1991:NNB,
author = "W. C. Fang and B. J. Sheu and O. T.-C. Chen",
title = "A neural network based {VLSI} vector quantizer for
real-time image compression",
crossref = "Storer:1991:DDC",
pages = "342--351",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213346",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213346",
acknowledgement = ack-nhfb,
}
@InProceedings{Fischer:1991:ECT,
author = "T. R. Fischer and M. Wang",
title = "Entropy-constrained trellis coded quantization",
crossref = "Storer:1991:DDC",
pages = "103--112",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213377",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213377",
acknowledgement = ack-nhfb,
}
@Article{Fox:1991:OPM,
author = "Edward A. Fox and Qi Fan Chen and Amjad M. Daoud and
Lenwood S. Heath",
title = "Order Preserving Minimal Perfect Hash Functions and
Information Retrieval",
journal = j-TOIS,
volume = "9",
number = "3",
pages = "281--308",
month = jul,
year = "1991",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/125187.125200",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.acm.org/pubs/tois/toc.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
note = "Special Issue on Research and Development in
Information Retrieval.",
URL = "http://www.acm.org:80",
abstract = "Rapid access to information is essential for a wide
variety of retrieval systems and applications. Hashing
has long been used when the fastest possible direct
search is desired, but is generally not appropriate
when sequential or range searches are also required.
This paper describes a hashing method, developed for
collections that are relatively static, that supports
both direct and sequential access. The algorithms
described give hash functions that are optimal in terms
of time and hash table space utilization, and that
preserve any a priori ordering desired. Furthermore,
the resulting order-preserving minimal perfect hash
functions (OPMPHFs) can be found using time and space
that are linear in the number of keys involved; this is
close to optimal.",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "ACM Transactions on Information Systems (TOIS)",
keywords = "Access methods; Algorithms; Content analysis and
indexing; Data; Data storage representations; Database
management; Dictionary structure; Experimentation; File
organization; Hash table representations; Indexing;
Indexing methods; Information storage; Information
storage and retrieval; Inverted file structures;
Minimal perfect hashing; Perfect hashing; Physical
design; Random graph; TOOIS TOIS Data",
rawdata = "Fox, E. A., et al. (1991) ``Order Preserving Minimal
Perfect Hash Functions and Information Retrieval,''
{\it ACM Transactions on Information Systems},
{\bf9}(2):281--308.",
}
@InProceedings{Freeman:1991:ACD,
author = "G. H. Freeman",
title = "Asymptotic Convergence of Dual-Tree Entropy Codes",
crossref = "Storer:1991:DDC",
pages = "208--217",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213360",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213360",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Freeman, G. H. (1991) ``Asymptotic Convergence of
Dual-Tree Entropy Codes,'' {\it Proceedings of the Data
Compression Conference (DCC '91)}, pp. 208--217.",
}
@InProceedings{Frost:1991:DPR,
author = "R. L. Frost and C. F. Barnes and F. Xu",
title = "Design and performance of residual quantizers",
crossref = "Storer:1991:DDC",
pages = "129--138",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213380",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213380",
acknowledgement = ack-nhfb,
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303965529",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering; 0800: Artificial
intelligence; 0984: Computer science",
dissertation-thesis-number = "DX94719",
subject = "Computer science; Electrical engineering; Artificial
intelligence",
}
@InProceedings{Gerencser:1991:APS,
author = "L. Gerencser",
title = "Asymptotics of predictive stochastic complexity",
crossref = "Storer:1991:DDC",
pages = "228--238",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213358",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213358",
acknowledgement = ack-nhfb,
}
@InProceedings{Gertner:1991:GSM,
author = "I. Gertner and Y. Y. Zeevi",
title = "Generalized scanning and multiresolution image
compression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213327",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213327",
acknowledgement = ack-nhfb,
}
@PhdThesis{Goodman:1991:TPI,
author = "Stephen Darrow Goodman",
title = "Temporal pattern identification in a self-organizing
neural network with an application to data
compression",
type = "{Ph.D.} thesis",
school = "Georgia Institute of Technology",
address = "Atlanta, GA, USA",
pages = "209",
year = "1991",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303954063",
acknowledgement = ack-nhfb,
advisor = "Martin A. Brooke",
classification = "0544: Electrical engineering; 0800: Artificial
intelligence",
dissertation-thesis-number = "9206076",
subject = "Electrical engineering; Artificial intelligence",
}
@InProceedings{Gray:1991:IC,
author = "R. M. Gray",
title = "Image compression",
crossref = "Storer:1991:DDC",
pages = "474--475",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213293",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213293",
acknowledgement = ack-nhfb,
}
@Book{Held:1991:DCT,
author = "Gilbert Held and Thomas (Thomas R.) Marshall",
title = "Data compression: techniques and applications:
hardware and software considerations",
publisher = pub-WILEY,
address = pub-WILEY:adr,
edition = "Third",
pages = "xi + 301",
year = "1991",
ISBN = "0-471-92941-7",
ISBN-13 = "978-0-471-92941-3",
LCCN = "QA76.9.D33 H44 1991",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
subject = "Data compression (Computer science)",
}
@InProceedings{Horspool:1991:IL,
author = "N. R. Horspool",
editor = "James A. Storer",
booktitle = "Proceedings of the 1991 Data Compression Conference",
title = "Improving {LZW}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "332--341",
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Horspool, N. R. (1991) ``Improving LZW,'' {\it
Proceedings of the 1991 Data Compression Conference},
J. Storer, ed., Los Alamitos, CA, IEEE Computer Society
Press, pp~.332--341.",
}
@InProceedings{Horspool:1991:ILD,
author = "R. N. Horspool",
title = "Improving {LZW} [data compression algorithm]",
crossref = "Storer:1991:DDC",
pages = "332--341",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213347",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213347",
acknowledgement = ack-nhfb,
}
@InProceedings{Howard:1991:AAC,
author = "P. G. Howard and J. S. Vitter",
title = "Analysis of arithmetic coding for data compression",
crossref = "Storer:1991:DDC",
pages = "3--12",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213368",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213368",
acknowledgement = ack-nhfb,
}
@InProceedings{Howard:1991:NML,
author = "P. G. Howard and J. S. Vitter",
title = "New methods for lossless image compression using
arithmetic coding",
crossref = "Storer:1991:DDC",
pages = "257--266",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213355",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213355",
acknowledgement = ack-nhfb,
}
@PhdThesis{Huang:1991:MPI,
author = "Shih-Chi Huang",
title = "Multilayer perceptrons for image data compression and
speech recognition",
type = "{Ph.D.} thesis",
school = "University of Notre Dame",
address = "Notre Dame, IN, USA",
pages = "200",
year = "1991",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303940741",
acknowledgement = ack-nhfb,
advisor = "Yih-Fang Huang",
classification = "0544: Electrical engineering; 0800: Artificial
intelligence; 0984: Computer science",
dissertation-thesis-number = "9210348",
subject = "Electrical engineering; Computer science; Artificial
intelligence",
}
@InProceedings{Indjic:1991:RPS,
author = "D. Indjic",
title = "Reduction in power system load data training sets size
using fractal approximation theory",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213315",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213315",
acknowledgement = ack-nhfb,
}
@InProceedings{Israelsen:1991:VIV,
author = "P. Israelsen",
title = "{VLSI} implementation of a vector quantization
processor",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213298",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213298",
acknowledgement = ack-nhfb,
}
@TechReport{ITU:1991:BAQ,
author = "{ITU/TG10}",
title = "Basic Audio Quality Requirements for Digital Audio
Bit-Rate Reduction Systems for Broadcast Emission and
Primary Distribution",
type = "{ITU-R} document",
number = "TG-10-2/3-E",
institution = "ITU",
address = "????",
pages = "??",
month = oct,
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "ITU/TG10 (1991) ITU-R document TG-10-2/3-E ``Basic
Audio Quality Requirements for Digital Audio Bit-Rate
Reduction Systems for Broadcast Emission and Primary
Distribution,'' 28 October.",
}
@InProceedings{Ivie:1991:TIC,
author = "E. L. Ivie and J. J. Ekstrom",
title = "Techniques for index compression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213310",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213310",
acknowledgement = ack-nhfb,
}
@InProceedings{Jones:1991:PED,
author = "D. W. Jones",
title = "Practical evaluation of a data compression algorithm",
crossref = "Storer:1991:DDC",
pages = "372--381",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213343",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213343",
acknowledgement = ack-nhfb,
}
@Article{Jurgen:1991:CDH,
author = "R. K. Jurgen",
title = "The challenges of digital {HDTV}",
journal = j-IEEE-SPECTRUM,
volume = "28",
number = "4",
pages = "28--30",
month = apr,
year = "1991",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.76298",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Wed Jan 15 16:15:28 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Algorithm design and analysis; compression coding;
data compression; Degradation; digital communication
systems; digital HDTV; Digital systems; digital
transmission; encoding; FCC; HDTV; high definition
television; high-definition television; Instruments;
Motion compensation; motion compensation algorithms;
picture processing; System testing; television
broadcasting; terrestrial broadcast environment;
Transmitters; TV broadcasting",
}
@PhdThesis{Keshet:1991:NAT,
author = "Yehoshua Keshet",
title = "A new approach towards seismic data compression and
automated classification of seismic attributes, with
application to {East Africa} rift lakes data",
type = "{Ph.D.} thesis",
school = "Duke University",
address = "Durham, NC 27708, USA",
pages = "185",
year = "1991",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303948606",
acknowledgement = ack-nhfb,
advisor = "Richard A. Strelitz",
classification = "0373: Geophysics; 0463: Statistics; 0984: Computer
science",
dissertation-thesis-number = "9127513",
subject = "Geophysics; Computer science; Statistics",
}
@InProceedings{Ko:1991:DDC,
author = "C. Ko and W. Chung",
title = "{$2$-D} discrete cosine transform array processor
using non-planar connections",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213305",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213305",
acknowledgement = ack-nhfb,
}
@InProceedings{Koch:1991:DCV,
author = "E. Koch and M. Sommer",
title = "Data compression in view of data sealing",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213334",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213334",
acknowledgement = ack-nhfb,
}
@Article{Kratzer:1991:NAD,
author = "K. P. Kratzer",
title = "A Neural Approach to Data Compression and
Classification",
journal = j-LECT-NOTES-COMP-SCI,
volume = "541",
pages = "250--??",
year = "1991",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon May 13 08:51:55 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Lagana:1991:ECD,
author = "M. R. Lagana and G. Turrini and G. Zanchi",
title = "Experiments on the compression of dictionary entries",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213329",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213329",
acknowledgement = ack-nhfb,
}
@InProceedings{Langdon:1991:PQC,
author = "G. G. {Langdon, Jr.}",
title = "Probabilistic and {Q}-Coder algorithms for binary
source adaptation",
crossref = "Storer:1991:DDC",
pages = "13--22",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213369",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213369",
acknowledgement = ack-nhfb,
}
@InProceedings{Lee:1991:DIC,
author = "H. Lee and Y. Kim and A. H. Rowberg and E. A. Riskin",
title = "{$3$-D} image compression for {X}-ray {CT} images
using displacement estimation",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213308",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213308",
acknowledgement = ack-nhfb,
}
@InProceedings{Lee:1991:PDC,
author = "E. T. Lee",
title = "Pictorial data compression using array grammars",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213317",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213317",
acknowledgement = ack-nhfb,
}
@Article{LeGall:1991:MVC,
author = "Didier {Le Gall}",
title = "{MPEG}: a video compression standard for multimedia
applications",
journal = j-CACM,
volume = "34",
number = "4",
pages = "46--58",
month = apr,
year = "1991",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/103085.103090",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1991.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/103090.html",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; design; packet video; standardization",
subject = "{\bf I.4.2}: Computing Methodologies, IMAGE
PROCESSING, Compression (Coding), Approximate methods.
{\bf K.1}: Computing Milieux, THE COMPUTER INDUSTRY,
Standards. {\bf C.2.0}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf H.5.1}: Information Systems,
INFORMATION INTERFACES AND PRESENTATION, Multimedia
Information Systems.",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303921041",
acknowledgement = ack-nhfb,
advisor = "Daniel S. Hirschberg",
classification = "0984: Computer science",
dissertation-thesis-number = "9120543",
subject = "Computer science",
}
@Article{Lelewer:1991:HCD,
author = "Debra A. Lelewer and Cheng Ng",
title = "An honors course in data compression",
journal = j-SIGCSE,
volume = "23",
number = "1",
pages = "146--150",
month = mar,
year = "1991",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/107005.107031",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 18:57:15 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@InProceedings{Lelewer:1991:SCM,
author = "D. A. Lelewer and D. S. Hirschberg",
title = "Streamlining context models for data compression",
crossref = "Storer:1991:DDC",
pages = "313--322",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213349",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213349",
acknowledgement = ack-nhfb,
}
@InProceedings{Leung:1991:ICE,
author = "Wai-Hong Leung and S. S. Skiena",
title = "Inducing codes from examples",
crossref = "Storer:1991:DDC",
pages = "267--276",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213354",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213354",
acknowledgement = ack-nhfb,
}
@InProceedings{Lewis:1991:KVC,
author = "A. S. Lewis and G. Knowles",
title = "A {64 Kb/s} video codec using the {$2$-D} wavelet
transform",
crossref = "Storer:1991:DDC",
pages = "196--201",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213362",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213362",
acknowledgement = ack-nhfb,
}
@InProceedings{Liang:1991:RDP,
author = "K. M. Liang and S. E. Budge and R. W. Harris",
title = "Rate distortion performance of {VQ} and {PVQ}
compression algorithms",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213316",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213316",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:1991:COT,
author = "J. Lin and J. A. Storer and M. Cohn",
title = "On the complexity of optimal tree pruning for source
coding",
crossref = "Storer:1991:DDC",
pages = "63--72",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213363",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213363",
acknowledgement = ack-nhfb,
}
@InProceedings{Lindsay:1991:RBV,
author = "R. A. Lindsay and D. E. Abercrombie",
title = "Restricted boundary vector quantization",
crossref = "Storer:1991:DDC",
pages = "159--165",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213383",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213383",
acknowledgement = ack-nhfb,
}
@Article{Liou:1991:OPK,
author = "Ming Liou",
title = "Overview of the p$ \times $ 64 kbits/s Video Coding
Standard",
journal = j-CACM,
volume = "34",
number = "4",
pages = "59--63",
month = apr,
year = "1991",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/103085.103091",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Communications of the ACM",
journal-URL = "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):59--63, April.",
}
@PhdThesis{Liu:1991:IUD,
author = "Chuang-Chun 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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303967206",
acknowledgement = ack-nhfb,
advisor = "Prakash Narayan",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "9133119",
subject = "Electrical engineering",
}
@InProceedings{Liu:1991:OFA,
author = "Y. Liu and H. Ma",
title = "$ \omega $-orbit finite automata for data
compression",
crossref = "Storer:1991:DDC",
pages = "166--175",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213384",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213384",
acknowledgement = ack-nhfb,
}
@Article{Liu:1991:RDC,
author = "Chengwen Liu and Clement Yu",
title = "Research: Data compression using word encoding with
{Huffman} code",
journal = j-J-AM-SOC-INF-SCI,
volume = "42",
number = "9",
pages = "685--698",
month = oct,
year = "1991",
CODEN = "AISJB6",
DOI = "https://doi.org/10.1002/(SICI)1097-4571(199110)42:9<685::AID-ASI7>3.0.CO%3B2-1",
ISSN = "0002-8231 (print), 1097-4571 (electronic)",
ISSN-L = "0002-8231",
bibdate = "Fri Sep 11 09:03:47 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jasis.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Society for Information
Science",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2330-1643",
onlinedate = "7 Jan 1999",
}
@InProceedings{Lu:1991:ASM,
author = "Cheng-Chang Lu and Ngee-Boo Choong",
title = "Adaptive source modeling using conditioning tree with
maximum entropy reduction criterions",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213338",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213338",
acknowledgement = ack-nhfb,
}
@InProceedings{Malak:1991:IDL,
author = "M. Malak and J. Baker",
title = "An image database for low bandwidth communication
links",
crossref = "Storer:1991:DDC",
pages = "53--62",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213373",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213373",
acknowledgement = ack-nhfb,
}
@InProceedings{Markas:1991:ICM,
author = "T. Markas and J. Reif",
title = "Image compression methods with distortion controlled
capabilities",
crossref = "Storer:1991:DDC",
pages = "93--102",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213376",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213376",
acknowledgement = ack-nhfb,
}
@InProceedings{Masui:1991:KDC,
author = "T. Masui",
title = "Keyword dictionary compression using efficient trie
implementation",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213323",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213323",
acknowledgement = ack-nhfb,
}
@InProceedings{Memon:1991:PTL,
author = "N. D. Memon and S. S. Magliveras and K. Sayood",
title = "Prediction trees and lossless image compression",
crossref = "Storer:1991:DDC",
pages = "83--92",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213375",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213375",
acknowledgement = ack-nhfb,
}
@InProceedings{Mermelstein:1991:TAS,
author = "P. Mermelstein",
title = "Trends in audio and speech compression for storage and
real-time communication",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213306",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213306",
acknowledgement = ack-nhfb,
}
@InProceedings{Millett:1991:ICM,
author = "R. P. Millett and E. L. Ivie",
title = "Index compression method with compressed mode
{Boolean} operators",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213324",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213324",
acknowledgement = ack-nhfb,
}
@InProceedings{Minami:1991:OAR,
author = "S. Minami and A. Zakhor",
title = "An optimization approach for removing blocking effects
in transform coding",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213319",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213319",
acknowledgement = ack-nhfb,
}
@MastersThesis{Mishra:1991:AID,
author = "Sanjay Mishra",
title = "An algorithm for image data compression based on
vector quantization",
type = "{M.S.} thesis",
school = "Texas A\&I University",
address = "Kingsville, TX, USA",
pages = "128",
year = "1991",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303967682",
acknowledgement = ack-nhfb,
advisor = "Iqbal Omar",
classification = "0984: Computer science",
dissertation-thesis-number = "1343720",
subject = "Computer science",
}
@InProceedings{Moffat:1991:TLC,
author = "Alistair Moffat",
title = "Two-Level Context Based Compression of Binary Images",
crossref = "Storer:1991:DDC",
pages = "382--391",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213342",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213342",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Moffat, Alistair (1991) ``Two-Level Context Based
Compression of Binary Images,'' in {\it Proceedings of
the 1991 Data Compression Conference}, J. Storer, ed.,
Los Alamitos, CA, IEEE Computer Society Press, pp.
382--391.",
}
@InProceedings{Mukherjee:1991:MDE,
author = "A. Mukherjee and H. Bheda and M. A. Bassiouni and T.
Acharya",
title = "Multibit decoding\slash encoding of binary codes using
memory based architectures",
crossref = "Storer:1991:DDC",
pages = "352--361",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213345",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213345",
acknowledgement = ack-nhfb,
}
@Article{Mund:1991:ZLC,
author = "Sibylle Mund",
title = "{Ziv--Lempel} Complexity for Periodic Sequences and
its Cryptographic Application",
journal = j-LECT-NOTES-COMP-SCI,
volume = "547",
pages = "114--??",
year = "1991",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Feb 4 12:02:05 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t0547.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs1991.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/0547/05470114.htm;
http://link.springer-ny.com/link/service/series/0558/papers/0547/05470114.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Nakamura:1991:DCB,
author = "Hirofumi Nakamura and Sadayuki Murashima",
booktitle = "{Proceedings of the 14th Symposium on Information
Theory and its Applications (SITA '91), December
11--14, 1991, Ibusuki, Japan}",
title = "The Data Compression Based on Concatenation of
Frequentative Code Neighbor",
publisher = "????",
address = "????",
pages = "701--704",
day = "11",
month = dec,
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "In Japanese.",
acknowledgement = ack-ds,
rawdata = "Nakamura, Hirofumi and Sadayuki Murashima (1991) ``The
Data Compression Based on Concatenation of
Frequentative Code Neighbor,'' {\it Proceedings of the
14th Symposium on Information Theory and its
Applications (SITA '91)}, (Ibusuki, Japan), pp.
701--704, December 11--14 (in Japanese).",
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303929431",
acknowledgement = ack-nhfb,
advisor = "Mohammed Arozullah",
classification = "0317: Neurology; 0544: Electrical engineering",
dissertation-thesis-number = "9123107",
subject = "Electrical engineering; Neurology",
}
@Article{Nelson:1991:DDC,
author = "Mark R. Nelson",
title = "{DDJ} Data Compression Contest Results",
journal = j-DDJ,
volume = "16",
number = "11",
pages = "62--??",
month = nov,
year = "1991",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Mon Sep 2 09:09:39 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@InProceedings{Nguyen:1991:CSP,
author = "H. Nguyen and J. W. Mark",
title = "Concentric-shell partition vector quantization with
application to image coding",
crossref = "Storer:1991:DDC",
pages = "119--128",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213379",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213379",
acknowledgement = ack-nhfb,
}
@InProceedings{Nickels:1991:SDA,
author = "K. Nickels and C. Thacker",
title = "Satellite data archives algorithm",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213314",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213314",
acknowledgement = ack-nhfb,
}
@InProceedings{Omodeo:1991:IJA,
author = "A. Omodeo and M. Pugassi and N. Scarabottolo",
title = "Implementing {JPEG} algorithm on {INMOS} transputer
equipped machines",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213326",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213326",
acknowledgement = ack-nhfb,
}
@InCollection{Paeth:1991:IFC,
author = "Alan W. Paeth",
editor = "James Arvo",
booktitle = "Graphics Gems II",
title = "Image File Compression Made Easy",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "??",
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Paeth, Alan W. (1991) ``Image File Compression Made
Easy,'' {\it Graphics Gems II}, James Arvo, editor, San
Diego, CA, Academic Press.",
}
@InProceedings{Pentland:1991:PAF,
author = "A. Pentland and B. Horowitz",
title = "A practical approach to fractal-based image
compression",
crossref = "Storer:1991:DDC",
pages = "176--185",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213385",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213385",
acknowledgement = ack-nhfb,
}
@Article{Perl:1991:CLA,
author = "Yehoshua Perl and Ashish Mehta",
title = "Cascading {LZW} Algorithm with {Huffman} Coding: a
Variable to Variable Length Compression Algorithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "507",
pages = "170--??",
year = "1991",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon May 13 08:51:55 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Perl:1991:CLC,
author = "Y. Perl and V. Maram and N. Kadakuntla",
title = "The cascading of the {LZW} compression algorithm with
arithmetic coding",
crossref = "Storer:1991:DDC",
pages = "277--286",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213353",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213353",
acknowledgement = ack-nhfb,
}
@Article{Phillips:1991:IPPa,
author = "Dwayne Phillips",
title = "Image Processing --- Part 1: Reading the {Tag Image
File Format}",
journal = j-CUJ,
volume = "9",
number = "3",
pages = "92--??",
month = mar,
year = "1991",
ISSN = "0898-9788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "C Users Journal",
keywords = "{Tag Image File Format} (TIFF)",
}
@InProceedings{Polit:1991:NTD,
author = "P. P. Polit and N. M. Nasrabadi",
title = "A new transform domain vector quantization technique
for image data compression in an asynchronous transfer
mode network",
crossref = "Storer:1991:DDC",
pages = "149--158",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213382",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213382",
acknowledgement = ack-nhfb,
}
@InProceedings{Promhouse:1991:SDC,
author = "G. Promhouse and M. Bennett",
title = "Semantic data compression",
crossref = "Storer:1991:DDC",
pages = "323--331",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213348",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213348",
acknowledgement = ack-nhfb,
}
@InCollection{Prusinkiewicz:1991:SSF,
author = "P. Prusinkiewicz and A. Lindenmayer and F. D.
Fracchia",
editor = "H.-O. Peitgen and others",
booktitle = "Fractals in the Fundamental and Applied Sciences",
title = "Synthesis of Space-Filling Curves on the Square Grid",
publisher = pub-ELSEVIER-SCIENCE,
address = pub-ELSEVIER-SCIENCE:adr,
pages = "341--366",
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Prusinkiewicz, P., and A. Lindenmayer (1990) {\it The
Algorithmic Beauty of Plants}, New York,
Springer-Verlag. Prusinkiewicz, P., A. Lindenmayer, and
F. D. Fracchia (1991) ``Synthesis of Space-Filling
Curves on the Square Grid,'' {\it Fractals in the
Fundamental and Applied Sciences}, Peitgen, H.-O., et
al. (eds.), Amsterdam, Elsevier Science Publishers, pp.
341--366. Pylak, Pawe\l\ (2003) ``Efficient
Modification of LZSS Compression Algorithm,'' {\it
Annales UMCS Informatica}, section AI, pp. 61--72,
Lublin, Poland. Also available online at
|www.annales.umcs.lublin.pl/AI/2003/07.pdf|.",
}
@Book{Rabbani:1991:DIC,
author = "Majid Rabbani and Paul W. Jones",
title = "Digital Image Compression Techniques",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "??",
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Rabbani, Majid, and Paul W. Jones (1991) {\it Digital
Image Compression Techniques}, Bellingham, WA, Spie
Optical Engineering Press.",
}
@InProceedings{Ramabadran:1991:SRA,
author = "T. V. Ramabadran",
title = "Some results on adaptive statistics estimation for the
reversible compression of sequences",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213312",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213312",
acknowledgement = ack-nhfb,
}
@InProceedings{Ranganathan:1991:SAL,
author = "N. Ranganathan and S. Henriques",
title = "A systolic architecture for {LZ} based decompression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213311",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213311",
acknowledgement = ack-nhfb,
}
@Article{Ranganathan:1991:VAD,
author = "N. Ranganathan and Amar Mukherjee and M. Bassiouni",
title = "{VLSI} algorithms for data compression",
journal = j-COMPUT-SYST-SCI-ENG,
volume = "6",
number = "4",
pages = "238--253",
month = oct,
year = "1991",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Thu Feb 4 13:21:32 MST 1999",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
OCLC Contents1st database",
acknowledgement = ack-nhfb,
affiliation = "Univ of South Florida",
affiliationaddress = "Tampa, USA",
classification = "713; 723",
fjournal = "Computer Systems Science and Engineering",
journalabr = "Comput Syst Sci Eng",
keywords = "Codes, Symbolic --- Encoding; Computer Programming ---
Algorithms; Hardware Algorithms; Huffman Compression;
Information Theory; Integrated Circuits, VLSI; VLSI
Algorithms",
}
@TechReport{Rice:1991:SPU,
author = "Robert F. Rice",
title = "Some Practical Universal Noiseless Coding Techniques
--- {Part III}. {Module PSI14.K}",
type = "JPL Publication",
number = "91-3",
institution = "Jet Propulsion Laboratory",
address = "Pasadena, CA, USA",
pages = "??",
month = nov,
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata-1 = "Rice, R. F. (1991) ``Some Practical Universal
Noiseless Coding Techniques---Part III. Module
PSI14.K,'' Jet Propulsion Laboratory, JPL Publication
91-3, Pasadena, CA, November.",
rawdata-2 = "Rice, Robert F. (1991) ``Some Practical Universal
Noiseless Coding Techniques---Part III. Module
PSI14.K,'' Jet Propulsion Laboratory, JPL Publication
91-3, Pasadena, CA, November.",
}
@Article{Robinson:1991:APF,
author = "J. P. Robinson",
title = "Aliasing probabilities for feedback signature
compression of test data",
journal = j-IEEE-TRANS-COMPUT,
volume = "40",
number = "7",
pages = "867--873",
month = jul,
year = "1991",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/12.83625",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 7 12:52:22 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1990.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=83625",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Robinson:1991:CNI,
author = "J. A. Robinson",
title = "Compression of natural images using thread-like visual
primitives",
crossref = "Storer:1991:DDC",
pages = "307--312",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213350",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213350",
acknowledgement = ack-nhfb,
}
@InProceedings{Salari:1991:CSI,
author = "E. Salari and W. A. {Whyte, Jr.}",
title = "Compression of stereoscopic image data",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213336",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213336",
acknowledgement = ack-nhfb,
}
@InProceedings{Salomonson:1991:MRI,
author = "V. V. Salomonson",
title = "The {Moderate Resolution Imaging Spectrometer}. An
{EOS} facility instrument candidate for application of
data compression methods",
crossref = "Storer:1991:DDC",
pages = "468--471",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213296",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213296",
acknowledgement = ack-nhfb,
}
@InProceedings{Santis:1991:OAC,
author = "A. {De Santis} and G. Persiano",
title = "An optimal algorithm for the construction of optimal
prefix codes with given fringe",
crossref = "Storer:1991:DDC",
pages = "297--306",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213351",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213351",
acknowledgement = ack-nhfb,
}
@PhdThesis{Shalaby:1991:DHT,
author = "Hossam M. H. Shalaby",
title = "Distributed hypothesis testing with data compression",
type = "{Ph.D.} thesis",
school = "University of Maryland",
address = "College Park, MD, USA",
pages = "136",
year = "1991",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304016569",
acknowledgement = ack-nhfb,
advisor = "Adrian Papamarcou",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "9133160",
subject = "Electrical engineering",
}
@InProceedings{Sheinwald:1991:CTW,
author = "D. Sheinwald and A. Lempel and J. Ziv",
title = "On compression with two-way head machines",
crossref = "Storer:1991:DDC",
pages = "218--227",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213359",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213359",
acknowledgement = ack-nhfb,
}
@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 = j-IEEE-J-SEL-AREAS-COMMUN,
volume = "9",
number = "3",
pages = "294--304",
month = apr,
year = "1991",
CODEN = "ISACEM",
DOI = "https://doi.org/10.1109/49.76627",
ISSN = "0733-8716 (print), 1558-0008 (electronic)",
ISSN-L = "0733-8716",
bibdate = "Tue Mar 14 19:23:09 1995",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "IEEE Log Number 9042034.",
abstract = "The purpose of this paper is to examine some methods
of supporting voice in broadband ISDN's (B-ISDN)
asynchronous transfer mode (ATM), including voice
compression. Techniques for voice compression with
variable-length packet format at DS1 transmission rate
[e.g., wideband packet technology (WPT)] have been
successfully implemented utilizing embedded ADPCM
coding, digital speech interpolation (DSI), and
block-dropping schemes. For supporting voice in B-ISDN,
we consider voice compression techniques similar to
those use in WPT but with different packetization and
congestion control methods designed for the
fixed-length ATM protocol. Possible approaches for
packetization and implementation of variable bit-rate
voice coding schemes are described. We consider using
ADPCM and DSI for voice coding and compression, and
cell discarding (CD) for congestion control. The
advantages of voice compression and cell discarding in
ATM networks are demonstrated in terms of transmission
bandwidth savings and resiliency of the network during
congestion.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Journal on Selected Areas in Communications",
keywords = "voice compression ATM ADPCM (adaptive pulse code
modulation) wideband packet technology (WPT) G727 G764
Packet Voice Protocol (PVP) digital speech
interpolation (DSI) cell discarding (CD) cell
prioritization queueing delay congestion control echo
cancellation clock synchronization coding, voice
packetization performance modeling performance analysis
queueing model queue, M/D/1/k",
}
@InProceedings{Stearns:1991:WDC,
author = "S. D. Stearns",
title = "Waveform data compression with exact recovery",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213297",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213297",
acknowledgement = ack-nhfb,
}
@Article{Storer:1991:PAH,
author = "James A. Storer and John H. Reif",
title = "A parallel architecture for high-speed data
compression",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "222--227",
month = oct,
year = "1991",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/0743-7315(91)90091-m",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Brandeis Univ",
affiliationaddress = "Waltham, MA, USA",
classification = "713; 716; 717; 718; 722; 723; B1265F
(Microprocessors and microcomputers); B2570
(Semiconductor integrated circuits); B6120B (Codes);
B6140 (Signal processing and detection); B6220
(Stations and subscriber equipment); C5130
(Microprocessor chips); C5220 (Computer architecture);
C5440 (Multiprocessor systems and techniques); C6130
(Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Brandeis Univ., Waltham, MA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
journalabr = "J Parallel Distrib Comput",
keywords = "40 MHz; application specific integrated circuits;
architectures; associative memory; codecs; complete
encoding-decoding pipe; compression; Computer
Architecture; Computer Systems, Digital--Parallel
Processing; custom VLSI chip; Custom VLSI chips; data;
Data Compression; Data Transmission; digital signal
processing chips; high-; high-speed data
communications; High-speed data compression;
Information Theory; Integrated Circuits, VLSI;
massively parallel architecture; parallel; Parallel
architecture; parallel architecture; serial learning
strategy; speed data compression; systolic arrays;
systolic pipe; textual substitution; VLSI",
treatment = "P Practical",
}
@InProceedings{Szpankowski:1991:TBS,
author = "W. Szpankowski",
title = "A typical behavior of some data compression schemes",
crossref = "Storer:1991:DDC",
pages = "247--256",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213356",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213356",
acknowledgement = ack-nhfb,
}
@InProceedings{Tai:1991:DCE,
author = "W. Tai and J. Dozier",
title = "Data compression in end-to-end information systems for
{NASA} space science missions",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213294",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213294",
acknowledgement = ack-nhfb,
}
@InProceedings{Teuhola:1991:PAC,
author = "J. Teuhola and T. Raita",
title = "Piecewise arithmetic coding",
crossref = "Storer:1991:DDC",
pages = "33--42",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213371",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213371",
acknowledgement = ack-nhfb,
}
@Article{Thomas:1991:EKD,
author = "Kas Thomas",
title = "Entropy: the key to data compression",
journal = j-DDJ,
volume = "16",
number = "2",
pages = "32, 34, 110",
month = feb,
year = "1991",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 10 09:11:02 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "Understanding entropy is key to understanding data
compression.",
acknowledgement = ack-nhfb,
classification = "B6110 (Information theory); B6120B (Codes); B6140
(Signal processing and detection); C1260 (Information
theory); C6130 (Data handling techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Bits per symbol; Data compression; Data stream;
Entropy; Huffman encoding; Information theory; Message
encoding; Redundancy removal; Uncertainty",
thesaurus = "C listings; Data compression; Encoding; Entropy;
Information theory",
}
@InProceedings{Thomborson:1991:VOZ,
author = "C. Thomborson",
title = "{V.42bis} and other {Ziv--Lempel} variants",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213301",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213301",
acknowledgement = ack-nhfb,
}
@InProceedings{Tilton:1991:CEA,
author = "J. C. Tilton and D. Han and M. Manohar",
title = "Compression experiments with {AVHRR} data",
crossref = "Storer:1991:DDC",
pages = "411--420",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213339",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213339",
acknowledgement = ack-nhfb,
}
@InProceedings{Tong:1991:TCM,
author = "K.-L. Tong and M. W. Marcellin",
title = "Transform coding of monochrome and color images using
trellis coded quantization",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213307",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213307",
acknowledgement = ack-nhfb,
}
@InProceedings{Tsai:1991:SPC,
author = "Y. T. Tsai",
title = "Signal processing and compression for image capturing
systems using a single-chip sensor",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213313",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213313",
acknowledgement = ack-nhfb,
}
@InProceedings{VanHouten:1991:ATS,
author = "K. {Van Houten} and P. W. Oman",
title = "An algorithm for tree structure compression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213337",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213337",
acknowledgement = ack-nhfb,
}
@InProceedings{Venbrux:1991:VHS,
author = "J. Venbrux and N. Liu",
title = "A very high speed lossless compression\slash
decompression chip set",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213300",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213300",
acknowledgement = ack-nhfb,
}
@InProceedings{Vitter:1991:OPD,
author = "J. S. Vitter and P. Krishnan",
title = "Optimal prefetching via data compression",
crossref = "IEEE:1991:PAS",
pages = "121--130",
year = "1991",
bibdate = "Thu Apr 5 06:13:50 MDT 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Article{Wallace:1991:JSI,
author = "Gregory K. Wallace",
title = "The {JPEG} Still Image Compression Standard",
journal = j-CACM,
volume = "34",
number = "4",
pages = "30--44",
month = apr,
year = "1991",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/103085.103089",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
rawdata = "Wallace, Gregory K. (1991) ``The JPEG Still Image
Compression Standard,'' {\it Communications of the
ACM}, {\bf34}(4):30--44, April.",
}
@Article{Wallace:1991:JSP,
author = "Gregory K. Wallace",
title = "The {JPEG} still picture compression standard",
journal = j-CACM,
volume = "34",
number = "4",
pages = "30--44",
month = apr,
year = "1991",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/103085.103089",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/misc.1.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/103089.html",
acknowledgement = ack-nhfb,
annote = "Describes in simple terms the JPEG compression
algorithm. Useful in that it gives an introduction to
the DCT.",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "design; jpeg compression; standardization",
subject = "{\bf I.4.2}: Computing Methodologies, IMAGE
PROCESSING, Compression (Coding). {\bf H.5.1}:
Information Systems, INFORMATION INTERFACES AND
PRESENTATION, Multimedia Information Systems. {\bf
K.1}: Computing Milieux, THE COMPUTER INDUSTRY,
Standards. {\bf I.3.3}: Computing Methodologies,
COMPUTER GRAPHICS, Picture/Image Generation.",
}
@InProceedings{Weinberger:1991:OAP,
author = "M. J. Weinberger and J. Ziv and A. Lempel",
title = "On the optimal asymptotic performance of universal
ordering and discrimination of individual sequences",
crossref = "Storer:1991:DDC",
pages = "239--246",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213357",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213357",
acknowledgement = ack-nhfb,
}
@TechReport{Whyte:1991:DCF,
author = "Wayne A. Whyte and Khalid Sayood",
title = "Data compression for full motion video transmission",
type = "NASA technical memorandum",
number = "105239",
institution = pub-NASA,
address = pub-NASA:adr,
pages = "????",
year = "1991",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
note = "Shipping list number 92-0647-M.",
series = "NASA-TM",
acknowledgement = ack-nhfb,
subject = "Data compression (Computer science); Data transmission
systems",
}
@Book{Williams:1991:ADC,
author = "Ross N. Williams",
title = "Adaptive Data Compression",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "??",
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Williams, Ross N. (1991a) {\it Adaptive Data
Compression}, Boston, MA, Kluwer Academic Publishers.",
}
@InProceedings{Williams:1991:EFZ,
author = "Ross N. Williams",
title = "An Extremely Fast {Ziv--Lempel} Data Compression
Algorithm",
crossref = "Storer:1991:DDC",
pages = "362--371",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213344",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213344",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Williams, Ross N. (1991b) ``An Extremely Fast
Ziv-Lempel Data Compression Algorithm,'' in {\it
Proceedings of the 1991 Data Compression Conference},
J. Storer, ed., Los Alamitos, CA, IEEE Computer Society
Press, pp. 362--371.",
}
@InProceedings{Witten:1991:MCF,
author = "I. H. Witten and T. C. Bell and C. G. Nevill",
title = "Models for compression in full-text retrieval
systems",
crossref = "Storer:1991:DDC",
pages = "23--32",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213370",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213370",
acknowledgement = ack-nhfb,
}
@Article{Witten:1991:ZFP,
author = "Ian {H.} Witten and Timothy C. Bell",
title = "The Zero-Frequency Problem: Estimating the
Probabilities of Novel Events in Adaptive Text
Compression",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-37",
number = "4",
pages = "1085--1094",
year = "1991",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.87000",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Witten, Ian H.{} and Timothy C. Bell (1991) ``The
Zero-Frequency Problem: Estimating the Probabilities of
Novel Events in Adaptive Text Compression,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT-37}(4):1085--1094.",
}
@InProceedings{Wong:1991:MCV,
author = "C. W. Wong",
title = "Motion-compensated video image compression using
luminance and chrominance components for motion
estimation",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213321",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213321",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:1991:BTS,
author = "X. Wu and K. Zhang",
title = "A better tree-structured vector quantizer",
crossref = "Storer:1991:DDC",
pages = "392--401",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213341",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213341",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:1991:ICA,
author = "X. Wu and C. Yao",
title = "Image coding by adaptive tree-structured
segmentation",
crossref = "Storer:1991:DDC",
pages = "73--82",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213374",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213374",
acknowledgement = ack-nhfb,
}
@InProceedings{Wyner:1991:FDB,
author = "A. D. Wyner and J. Ziv",
title = "Fixed data base version of the {Lempel--Ziv} data
compression algorithm",
crossref = "Storer:1991:DDC",
pages = "202--207",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213361",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213361",
acknowledgement = ack-nhfb,
}
@Article{Yamamoto:1991:NAO,
author = "Hirosuke Yamamoto and Hiroshi Ochi",
title = "A New Asymptotically Optimal Code for the Positive
Integers",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "37",
number = "5",
pages = "1420--1429",
month = sep,
year = "1991",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.133261",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Yamamoto, Hirosuke and Hiroshi Ochi (1991) ``A New
Asymptotically Optimal Code for the Positive
Integers,'' {\it IEEE Transactions on Information
Theory}, {\bf37}(5):1420--1429, September.",
}
@Article{Yokoo:1991:IDH,
author = "Hidetoshi Yokoo",
title = "An Improvement of Dynamic {Huffman} Coding with a
Simple Repetition Finder",
journal = j-IEEE-TRANS-COMM,
volume = "39",
number = "1",
pages = "8--10",
month = jan,
year = "1991",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/26.68268",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Yokoo, Hidetoshi (1991) ``An Improvement of Dynamic
Huffman Coding with a Simple Repetition Finder,'' {\it
IEEE Transactions on Communications}, {\bf39}(1):8--10,
January.",
}
@InProceedings{Yovanof:1991:LCT,
author = "G. S. Yovanof and J. R. Sullivan",
title = "Lossless coding techniques for color graphical
images",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213322",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213322",
acknowledgement = ack-nhfb,
}
@InProceedings{Zipstein:1991:DCF,
author = "M. Zipstein",
title = "Data compression with factor automata",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213333",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213333",
acknowledgement = ack-nhfb,
}
@InProceedings{Zue:1991:IIV,
author = "K. Zue and J. M. Crissey",
title = "An iteratively interpolative vector quantization
algorithm for image data compression",
crossref = "Storer:1991:DDC",
pages = "139--148",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213381",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213381",
acknowledgement = ack-nhfb,
}
@InProceedings{Agostino:1992:PAO,
author = "S. {De Agostino} and J. A. Storer",
title = "Parallel algorithms for optimal compression using
dictionaries with the prefix property",
crossref = "Storer:1992:DCC",
pages = "52--61",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227476",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227476",
acknowledgement = ack-nhfb,
}
@Book{Akansu:1992:MSD,
author = "Ali Akansu and R. Haddad",
title = "Multiresolution Signal Decomposition",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "??",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Akansu, Ali, and R. Haddad (1992) {\it Multiresolution
Signal Decomposition}, San Diego, CA, Academic Press.",
}
@InProceedings{Ali:1992:UFT,
author = "M. Ali and C. Papadopoulos and T. Clarkson",
title = "The use of fractal theory in a video compression
system",
crossref = "Storer:1992:DCC",
pages = "259--268",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227455",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227455",
acknowledgement = ack-nhfb,
}
@InProceedings{Amir:1992:ETD,
author = "A. Amir and C. Benson",
title = "Efficient two-dimensional compressed matching",
crossref = "Storer:1992:DCC",
pages = "279--288",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227453",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227453",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1992:CCG,
author = "Anonymous",
title = "Can Compression Get You Out of a Squeeze?",
journal = j-DATAMATION,
volume = "38",
number = "20",
pages = "65--??",
day = "01",
month = oct,
year = "1992",
CODEN = "DTMNAT",
ISSN = "0011-6963",
bibdate = "Sat Jan 27 07:35:21 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Data compression doesn't just trim communications
costs; it also can boost efficiency of inter-LAN and
dial-in applications.",
acknowledgement = ack-nhfb,
fjournal = "Datamation",
}
@Article{Anonymous:1992:DYDb,
author = "Anonymous",
title = "Double Your Drives With Data Compression",
journal = j-DATAMATION,
volume = "38",
number = "24",
pages = "49--??",
day = "01",
month = dec,
year = "1992",
CODEN = "DTMNAT",
ISSN = "0011-6963",
bibdate = "Sat Jan 27 07:35:21 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Trying to cram too much data onto relatively small
hard drives? Try these software compression products
before turning to hardware upgrades.",
acknowledgement = ack-nhfb,
fjournal = "Datamation",
}
@Article{Anonymous:1992:FDC,
author = "Anonymous",
title = "{On-the-Fly} Disk Compression: Diet Disk compression
utility, automated {Apple} Menus, and organizing
{Usenet} news",
journal = j-BYTE,
volume = "17",
number = "6",
pages = "357--??",
month = jun,
year = "1992",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Tue Jan 2 10:01:41 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "BYTE Magazine",
}
@Article{Antonini:1992:ICU,
author = "Marc Antonini and Michel Barlaud and Pierre Mathieu
and Ingrid Daubechies",
title = "Image coding using wavelet transform",
journal = j-IEEE-TRANS-IMAGE-PROCESS,
volume = "1",
number = "2",
pages = "205--220",
month = apr,
year = "1992",
CODEN = "IIPRE4",
DOI = "https://doi.org/10.1109/83.136597",
ISSN = "1057-7149 (print), 1941-0042 (electronic)",
ISSN-L = "1057-7149",
bibdate = "Wed Mar 7 10:19:22 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/abstract/document/136597/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Image Processing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=83",
keywords = "biorthogonal subclasses; Bit rate; data compression;
encoding; Frequency domain analysis; Humans; image
coding; Image coding; image compression;
multiresolution codebook; Noise shaping; noise shaping
bit allocation; picture processing; Pixel; progressive
transmission; Psychology; psychovisual features;
pyramidal algorithm architecture; Rate distortion
theory; Shannon's rate distortion theory; vector
quantisation; wavelet coefficients; Wavelet
coefficients; wavelet transform; Wavelet transforms",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
unique-id = "ISI:000202960500007",
}
@Book{Bass:1992:EP,
author = "Thomas A. Bass",
title = "Eudaemonic Pie",
publisher = pub-PENGUIN,
address = pub-PENGUIN:adr,
pages = "??",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Bass, Thomas A. (1992) {\it Eudaemonic Pie}, New York,
Penguin Books.",
}
@Article{Bergen:1992:DSF,
author = "Helen A. Bergen and James M. Hogan",
title = "Data security in a fixed-model arithmetic coding
compression algorithm",
journal = j-COMPUT-SECUR,
volume = "11",
number = "5",
pages = "445--461",
month = sep,
year = "1992",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:53 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/016740489290011F",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Bookstein:1992:MBC,
author = "A. Bookstein and S. T. Klein and T. Raita",
title = "Model based concordance compression",
crossref = "Storer:1992:DCC",
pages = "82--91",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227473",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227473",
acknowledgement = ack-nhfb,
}
@InProceedings{Buhmann:1992:COV,
author = "J. Buhmann and H. Kuhnel",
title = "Complexity optimized vector quantization: a neural
network approach",
crossref = "Storer:1992:DCC",
pages = "12--21",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227480",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227480",
acknowledgement = ack-nhfb,
}
@Article{Bunton:1992:PDM,
author = "Suzanne Bunton and Gaetano Borriello",
title = "Practical dictionary management for hardware data
compression",
journal = j-CACM,
volume = "35",
number = "1",
pages = "95--104",
month = jan,
year = "1992",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/129617.129622",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/129622.html",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; design; performance; theory",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf B.6.1}: Hardware,
LOGIC DESIGN, Design Styles, Memory control and access.
{\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and
Design Styles, Algorithms implemented in hardware. {\bf
E.1}: Data, DATA STRUCTURES, Trees.",
}
@TechReport{Burrows:1992:LDC,
author = "Michael Burrows and others",
title = "On-line Data Compression in a Log-Structured File
System",
institution = "Digital Systems Research Center",
address = "Palo Alto, CA, USA",
pages = "??",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Burrows, Michael, et al. (1992) {\it On-line Data
Compression in a Log-Structured File System}, Digital,
Systems Research Center, Palo Alto, CA.",
}
@Article{Capocelli:1992:CSS,
author = "R. Capocelli and A. {De Santis}",
title = "On The Construction of Statistically Synchronizable
Codes",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "38",
number = "2",
pages = "407--414",
month = mar,
year = "1992",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.119696",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Capocelli, R. and A. De Santis (1992) ``On The
Construction of Statistically Synchronizable Codes,''
{\it IEEE Transactions on Information Theory},
{\bf38}(2):407--414, March.",
}
@InProceedings{Carpentieri:1992:SMP,
author = "B. Carpentieri and J. A. Storer",
title = "A split-merge parallel block-matching algorithm for
video displacement estimation",
crossref = "Storer:1992:DCC",
pages = "239--248",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227457",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227457",
acknowledgement = ack-nhfb,
}
@Article{Chang:1992:CDC,
author = "Kuang-Yao Chang and Gregory T. Yang",
title = "{CCIGS}: a Data Compression System for {Chinese} Fonts
and Binary Images Using Classification Techniques",
journal = j-SPE,
volume = "22",
number = "12",
pages = "1027--1047",
month = dec,
year = "1992",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.4380221202",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Sat May 31 13:36:16 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@InProceedings{Chen:1992:AHS,
author = "O. T.-C. Chen and Z. Zhang and B. J. Sheu",
title = "An adaptive high-speed lossy data compression",
crossref = "Storer:1992:DCC",
pages = "349--358",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227446",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227446",
acknowledgement = ack-nhfb,
}
@Misc{Chu:1992:LDC,
author = "K. C. Chu",
title = "Lossless Data Compression Circuit and Method",
howpublished = "U.S. Patent No. 5,150,430",
month = sep,
year = "1992",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}
@Article{Cody:1992:FWT,
author = "Mac A. Cody",
title = "The fast wavelet transform",
journal = j-DDJ,
volume = "17",
number = "4",
pages = "16--18, 20, 24, 26, 28, 100--101",
month = apr,
year = "1992",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 10 10:06:23 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Sunair Electron. Inc., Fort Lauderdale, FL, USA",
classification = "C1130 (Integral transforms); C4190 (Other numerical
methods); C5140 (Firmware); C5260B (Computer vision and
picture processing)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Aware Inc; Fast wavelet transform; Fingerprint
analysis; Firmware; Fourier transform; Image
compression",
thesaurus = "C listings; Computerised pattern recognition; Data
compression; Firmware; Transforms",
}
@Article{DeVore:1992:ICT,
author = "R. DeVore and others",
title = "Image Compression Through Wavelet Transform Coding",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "38",
number = "2",
pages = "719--746",
month = mar,
year = "1992",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.119733",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "DeVore, R., et al. (1992) ``Image Compression Through
Wavelet Transform Coding,'' {\it IEEE Transactions on
Information Theory}, {\bf38}(2):719--746, March.",
}
@Article{Dickman:1992:PCS,
author = "Chris Dickman",
title = "The {President} and {CEO} of {Storm Technology}
discusses file compression issues",
journal = j-ELECT-COMPOSITION-IMAGING,
volume = "6",
number = "??",
pages = "52--??",
month = mar,
year = "1992",
ISSN = "0838-9535",
bibdate = "Mon May 20 11:04:41 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Electronic Composition and Imaging",
}
@InProceedings{Dionysian:1992:VPR,
author = "R. Dionysian and M. D. Ercegovac",
title = "Variable precision representation for efficient {VQ}
codebook storage",
crossref = "Storer:1992:DCC",
pages = "319--328",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227449",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227449",
acknowledgement = ack-nhfb,
}
@InProceedings{Epstein:1992:MKW,
author = "B. R. Epstein and R. Hingorani and J. M. Shapiro and
M. Czigler",
title = "Multispectral {KLT}-wavelet data compression for
{Landsat} thematic mapper images",
crossref = "Storer:1992:DCC",
pages = "200--208",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227461",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227461",
acknowledgement = ack-nhfb,
}
@InProceedings{Gammerman:1992:EUM,
author = "A. Gammerman and A. Bellotti",
title = "Experiments using minimal-length encoding to solve
machine learning problems",
crossref = "Storer:1992:DCC",
pages = "359--367",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227445",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227445",
acknowledgement = ack-nhfb,
}
@Book{Gersho:1992:VQS,
author = "Allen Gersho and Robert M. Gray",
title = "Vector Quantization and Signal Compression",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "??",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Gersho, Allen, and Robert M. Gray (1992) {\it Vector
Quantization and Signal Compression}, Boston, MA,
Kluwer Academic Publishers.",
}
@Article{Gillman:1992:DHT,
author = "P. Gillman",
title = "Data handling and text compression",
journal = j-J-INFO-SCI-PRINCIPLES-PRACTICE,
volume = "18",
number = "2",
pages = "105--110",
month = "????",
year = "1992",
CODEN = "JISCDI",
DOI = "https://doi.org/10.1177/016555159201800204",
ISSN = "0165-5515 (print), 1741-6485 (electronic)",
ISSN-L = "0165-5515",
bibdate = "Wed Aug 31 00:52:53 MDT 1994",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sgml.bib",
abstract = "Data compression has a function in text storage and
data handling, but not at the level of compressing data
files. The reason is that the decompression of such
files adds a time delay to the retrieval process, and
users can see this delay as a drawback of the system
concerned. Compression techniques can with benefit be
applied to index files. A more relevant data handling
problem is that posed by the need, in most systems, to
store two versions of imported text. The first is the
native version, as it might have come from a word
processor to text editor. The second is the ASCII
version which is what is actually imported. Inverted
file indexes form yet another version. The problem
arises out of the need for dynamic indexing and
re-indexing of revisable documents in very large
database applications such as are found in office
automation systems. Four mainstream text-management
packages are used to show how this problem is handled,
and how generic document architectures such as OCA/CDA
and SGML might help.",
acknowledgement = ack-nhfb,
affiliation = "Inf. Partnership, London, UK",
classification = "C6120 (File organisation); C6130 (Data handling
techniques); C7240 (Information analysis and indexing);
C7250 (Information storage and retrieval)",
fjournal = "Journal of Information Science, Principles and
Practice",
keywords = "ASCII version; Data compression; Data files; Data
handling; Dynamic indexing; Imported text; Inverted
file indexes; Native version; OCA/CDA; Re-indexing;
Revisable documents; SGML; Text compression; Text
storage; Text-management packages; Time delay; Very
large database applications",
pubcountry = "Netherlands",
thesaurus = "Data compression; Data handling; File organisation;
Indexing; Information storage",
}
@Article{Golin:1992:DIC,
author = "S. Golin",
title = "{DVI} Image Compression, Second Generation",
journal = j-PROC-SPIE,
volume = "1657",
pages = "106--113",
month = feb,
year = "1992",
CODEN = "PSISDG",
ISSN = "0277-786X (print), 1996-756X (electronic)",
ISSN-L = "0277-786X",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the SPIE --- The International Society
for Optical Engineering",
rawdata = "Golin, S. (1992) ``DVI Image Compression, Second
Generation,'' {\it Proceedings SPIE Conference, Image
Processing Algorithms}, {\bf1657}:106--113, February.",
xxjournal = "Proceedings SPIE Conference, Image Processing
Algorithms",
}
@Book{Gonzalez:1992:DIP,
author = "Rafael C. Gonzalez and Richard E. Woods",
title = "Digital Image Processing",
publisher = pub-AW,
address = pub-AW:adr,
pages = "??",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Gonzalez, Rafael C., and Richard E. Woods (1992) {\it
Digital Image Processing}, Reading, MA,
Addison-Wesley.",
}
@InProceedings{Haddadin:1992:SVQ,
author = "O. S. Haddadin and V. J. Mathews and T. G. {Stockham,
Jr.}",
title = "Subband vector quantization of images using hexagonal
filter banks",
crossref = "Storer:1992:DCC",
pages = "2--11",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227481",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227481",
acknowledgement = ack-nhfb,
}
@InProceedings{Hopper:1992:CGS,
author = "T. Hopper and F. Preston",
title = "Compression of grey-scale fingerprint images",
crossref = "Storer:1992:DCC",
pages = "309--318",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227450",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227450",
acknowledgement = ack-nhfb,
}
@InProceedings{Horspool:1992:CWB,
author = "R. Nigel Horspool and Gordon V. Cormack",
title = "Constructing Word-Based Text Compression Algorithms",
crossref = "Storer:1992:DCC",
pages = "62--71",
month = apr,
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227475",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227475",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Horspool, N. R., and G. V. Cormack (1992)
``Constructing Word-Based Text Compression
Algorithms,'' {\it Proceedings of the 1992 Data
Compression Conference}, J. Storer, ed., Los Alamitos,
CA, IEEE Computer Society Press, PP. 62--71, April.",
xxauthor = "N. R. Horspool and G. V. Cormack",
}
@InProceedings{Howard:1992:EMH,
author = "Paul G. Howard and J. S. Vitter",
title = "Error Modeling for Hierarchical Lossless Image
Compression",
crossref = "Storer:1992:DCC",
pages = "269--278",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227454",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227454",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Howard, Paul G., and J. S. Vitter (1992b) ``Error
Modeling for Hierarchical Lossless Image Compression,''
{\it Proceedings of the 1992 Data Compression
Conference}, J. Storer, ed., Los Alamitos, CA, IEEE
Computer Society Press, pp. 269--278.",
}
@Article{Howard:1992:NML,
author = "Paul G. Howard and J. S. Vitter",
title = "New Methods for Lossless Image Compression Using
Arithmetic Coding",
journal = j-INFO-PROC-MAN,
volume = "28",
number = "6",
pages = "765--779",
year = "1992",
CODEN = "IPMADK",
DOI = "https://doi.org/10.1016/0306-4573(92)90067-a",
ISSN = "0306-4573 (print), 1873-5371 (electronic)",
ISSN-L = "0306-4573",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
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):765--779.",
}
@InProceedings{Howard:1992:PIA,
author = "Paul G. Howard and J. S. Vitter",
editor = "James A. Storer",
booktitle = "Image and Text Compression",
title = "Practical Implementations of Arithmetic Coding",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "85--112",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cs.duke.edu/~jsv/Papers/catalog/node85.html",
acknowledgement = ack-ds,
rawdata = "Howard, Paul G., and J. S. Vitter (1992c) ``Practical
Implementations of Arithmetic Coding,'' in {\it Image
and Text Compression}, J. A. Storer, ed., Norwell, MA,
Kluwer Academic Publishers, PP. 85--112. Also available
from URL\hfil\break
|http://www.cs.duke.edu/~jsv/Papers/catalog/node85.html|.",
}
@InProceedings{Howard:1992:PLI,
author = "P. G. Howard and J. S. Vitter",
title = "Parallel lossless image compression using {Huffman}
and arithmetic coding",
crossref = "Storer:1992:DCC",
pages = "299--308",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227451",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227451",
acknowledgement = ack-nhfb,
}
@InProceedings{Jacobson:1992:RAH,
author = "G. Jacobson",
title = "Random access in {Huffman}-coded files",
crossref = "Storer:1992:DCC",
pages = "368--377",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227444",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227444",
acknowledgement = ack-nhfb,
}
@Article{Jurgen:1992:TCE,
author = "R. K. Jurgen",
title = "Technology 1992 --- Consumer electronics",
journal = j-IEEE-SPECTRUM,
volume = "29",
number = "1",
pages = "52--54",
month = jan,
year = "1992",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.109606",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu Jan 16 07:37:23 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "AD 1991; cable television; Cable TV; consumer
electronics; Consumer electronics; data compression;
digital audio radio; digital audio tape; digital
compact disc systems; Electronic equipment testing;
FCC; Hardware; HDTV; HDTV transmission systems; high
definition television; IEL; Instruments; mini disc
systems; System testing; TV broadcasting; TV cable
systems; US; video and audio discs",
}
@InProceedings{Khansari:1992:CIC,
author = "M. R. K. Khansari and I. Widjaja and A. Leon-Garcia",
title = "Convolutional interpolative coding algorithms",
crossref = "Storer:1992:DCC",
pages = "209--218",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227460",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227460",
acknowledgement = ack-nhfb,
}
@Article{Konstantinides:1992:MAI,
author = "Konstantinos Konstantinides and Vasudev Bhaskaran",
title = "Monolithic Architectures for Image Processing and
Compression",
journal = j-IEEE-CGA,
volume = "12",
number = "6",
pages = "75--86",
month = nov,
year = "1992",
CODEN = "ICGADZ",
DOI = "https://doi.org/10.1109/38.163627",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Sat Jan 25 06:42:48 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecga.bib",
abstract = "To meet the demands of image- intensive applications
like desktop publishing, medical imaging, and
multimedia, researchers are refining programmable ICs
for image processing.",
acknowledgement = ack-nhfb,
classification = "714.2; 722.4; 723.5; 741.3",
fjournal = "IEEE Computer Graphics and Applications",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
journalabr = "IEEE Comput Graphics Appl",
keywords = "Computer architecture; Computer vision; Image
compression; Monolithic integrated circuits;
Programmable integrated circuits",
}
@Article{Kruger:1992:BTC,
author = "Anton Kruger",
title = "Block truncation compression",
journal = j-DDJ,
volume = "17",
number = "4",
pages = "48, 50, 53--55, 104, 106",
month = apr,
year = "1992",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 10 10:06:23 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C5260B (Computer vision and picture processing);
C6130 (Data handling techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Block size; Block truncation compression; Disk space;
Image degradation; Local image statistics; Lossy data
compression algorithms; Monochrome image files",
thesaurus = "C listings; Computerised picture processing; Data
compression",
}
@InProceedings{Langdon:1992:JML,
author = "G. Langdon and A. Gulati and E. Seiler",
title = "On the {JPEG} model for lossless image compression",
crossref = "Storer:1992:DCC",
pages = "172--180",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227464",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227464",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:1992:IST,
author = "J. Lin and J. A. Storer",
title = "Improving search for tree-structured vector
quantization",
crossref = "Storer:1992:DCC",
pages = "339--348",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227447",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227447",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:1992:NOV,
author = "Jyh-Han Lin and J. S. Vitter",
title = "Nearly optimal vector quantization via linear
programming",
crossref = "Storer:1992:DCC",
pages = "22--31",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227479",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227479",
acknowledgement = ack-nhfb,
}
@PhdThesis{Lu:1992:DCS,
author = "Wei-Wei Lu",
title = "Data compression for space applications",
type = "{D.Phil.} thesis",
school = "University of Sussex",
address = "Brighton, UK",
pages = "158",
year = "1992",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304001463",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "C332496",
subject = "Computer science",
}
@InProceedings{Madisetti:1992:RTI,
author = "A. Madisetti and R. Jain and R. L. Baker",
title = "Real time implementation of pruned tree search vector
quantization",
crossref = "Storer:1992:DCC",
pages = "152--161",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227466",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227466",
acknowledgement = ack-nhfb,
}
@InProceedings{Manohar:1992:PVQ,
author = "M. Manohar and J. C. Tilton",
title = "Progressive vector quantization of multispectral image
data using a massively parallel {SIMD} machine",
crossref = "Storer:1992:DCC",
pages = "181--190",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227463",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227463",
acknowledgement = ack-nhfb,
}
@Book{McConnell:1992:FDF,
author = "Kenneth R. McConnell",
title = "{FAX}: Digital Facsimile Technology and Applications",
publisher = pub-ARTECH,
address = pub-ARTECH:adr,
pages = "??",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.mathworks.com/",
acknowledgement = ack-ds,
rawdata-1 = "Matlab (1999) |http://www.mathworks.com/|. McConnell,
Kenneth R. (1992) {\it FAX: Digital Facsimile
Technology and Applications}, Norwood, MA, Artech
House.",
rawdata-2 = "McConnell, Kenneth R. (1992) {\it FAX: Digital
Facsimile Technology and Applications}, Norwood, MA,
Artech House.",
}
@InProceedings{McMillan:1992:FMR,
author = "L. McMillan and L. Westover",
title = "A forward-mapping realization of the inverse discrete
cosine transform",
crossref = "Storer:1992:DCC",
pages = "219--228",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227459",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227459",
acknowledgement = ack-nhfb,
}
@InProceedings{Moffat:1992:CCF,
author = "A. Moffat and J. Zobel",
title = "Coding for compression in full-text retrieval
systems",
crossref = "Storer:1992:DCC",
pages = "72--81",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227474",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227474",
acknowledgement = ack-nhfb,
}
@Book{Nelson:1992:DCB,
author = "Mark Nelson",
title = "The data compression book: featuring fast, efficient
data compression techniques in {C}",
publisher = pub-MT,
address = pub-MT:adr,
pages = "527",
year = "1992",
ISBN = "1-55851-214-4, 1-55851-216-0 (Book disk set)",
ISBN-13 = "978-1-55851-214-6, 978-1-55851-216-0 (Book disk set)",
LCCN = "QA76.9.D33 N46 1992",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
acknowledgement = ack-nhfb,
remark = "System requirements: ``The code in this book has been
written to compile and run using several compilers and
environments. These include Microsoft C/C++, Borland
C++, Zortech C++, and interactive UNIX Sytem v3.2. The
disk contains all of the source code.''",
subject = "Data compression (Computer science)",
xxyear = "1991",
}
@Book{Pennebaker:1992:JSI,
author = "William B. Pennebaker and Joan L. Mitchell",
title = "{JPEG} Still Image Data Compression Standard",
publisher = pub-VAN-NOSTRAND-REINHOLD,
address = pub-VAN-NOSTRAND-REINHOLD:adr,
pages = "xviii + 638",
year = "1992",
ISBN = "0-442-01272-1",
ISBN-13 = "978-0-442-01272-4",
LCCN = "TA1632 .P45 1993",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
keywords = "Algorithms; Data compression (Telecommunication) ---
Standards; Image compression --- Standards; Image
processing --- Digital techniques --- Standards",
libnote = "Not in my library.",
rawdata = "Pennebaker, William B., and Joan L. Mitchell (1992)
{\it JPEG Still Image Data Compression Standard}, New
York, Van Nostrand Reinhold.",
shorttableofcontents = "Foreword \\
Acknowledgments \\
Trademarks \\
Introduction \\
Image Concepts and Vocabulary \\
Aspects of the Human Visual Systems \\
The Discrete Cosine Transform (DCT) \\
Image Compression Systems \\
JPEG Modes of Operation \\
JPEG Syntax and Data Organization \\
Entropy Coding Concepts \\
JPEG Binary Arithmetic Coding \\
JPEG Coding Models \\
JPEG Huffman Entropy Coding \\
Arithmetic Coding Statistical \\
More on Arithmetic Coding \\
Probability Estimation \\
Compression Performance \\
JPEG Enhancements \\
JPEG Applications and Vendors \\
Overview of CCITT, ISO, and IEC \\
History of JPEG \\
Other Image Compression Standards \\
Possible Future JPEG Directions \\
Appendix A \\
Appendix B \\
References \\
Index",
tableofcontents = "Foreword / xiii \\
Acknowledgments / xv \\
Trademarks / xvii \\
1: Introduction / 1 \\
1.1 Examples of JPEG image compression / 4 \\
1.2 Organization of the book / 4 \\
1.3 An architecture for image compression / 6 \\
1.4 JPEG baseline and extended systems / 6 \\
1.5 An evolving standard / 7 \\
1.6 An international collaboration / 7 \\
2: Image Concepts and Vocabulary / 9 \\
2.1 Digital images / 10 \\
2.2 Sampling / 10 \\
2.3 Two-dimensional arrays of samples / 12 \\
2.4 Digital image data types / 13 \\
2.5 Large amounts of data / 21 \\
3: Aspects of the Human Visual System / 23 \\
3.1 Luminance sampling / 23 \\
3.2 Sampie precision / 25 \\
3.3 Chrominance sampling / 25 \\
3.4 Linearity / 25 \\
4: The Discrete Cosine Transform (DCT) / 29 \\
4.1 Basic DCT concepts / 29 \\
4.2 Mathematical definition of the FDCT and IDCT / 39
\\
4.3 Fast DCTs / 41 \\
5: Image Compression Systems / 65 \\
5.1 Basic structure of image compression systems / 65
\\
5.2 Image compression models / 67 \\
5.3 JPEG entropy encoder and entropy decoder structures
/ 73 \\
5.4 Transcoding / 77 \\
5.5 JPEG lossless and lossy compression / 78 \\
5.6 Sequential and progressive coding / 79 \\
5.7 Hierarchical coding / 79 \\
5.8 Compression measures / 79 \\
6: JPEG Modes of Operation / 81 \\
6.1 Sequential DCT-based mode of operation / 81 \\
6.2 Progressive DCT-based mode of operation / 86 \\
6.3 Sequential lossless mode of operation / 92 \\
6.4 Hierarchical mode of operation / 93 \\
7: JPEG Syntax and Data Organization / 97 \\
7.1 Control procedures and compressed data structure /
97 \\
7.2 Interchange and abbreviated compressed data formats
/ 99 \\
7.3 Image data ordering / 99 \\
7.4 Marker definitions / 105 \\
7.5 Frame header / 110 \\
7.6 Scan header / 113 \\
7.7 Limit on the number of data units in an MCU / 116
\\
7.8 Marker segments for tables and parameters / 117 \\
7.9 Hierarchical progression marker segments / 120 \\
7.10 Examples of JPEG data streams / 122 \\
7.11 Backus--Naur Form / 127 \\
7.12 JPEG BNF / 130 \\
8: Entropy Coding Concepts / 135 \\
8.1 Entropy and Information / 135 \\
8.2 An example to illustrate entropy coding / 137 \\
8.3 Variable-length code words / 137 \\
8.4 Statistical modeling / 143 \\
8.5 Adaptive coding / 147 \\
9: JPEG Binary Arithmetic Coding / 149 \\
9.1 The QM-encoder / 151 \\
9.2 The QM-decoder / 162 \\
9.3 More about the QM-coder / 166 \\
10: JPEG Coding Models / 169 \\
10.1 JPEG sequential DCT-based coding models / 170 \\
10.2 Models for progressive DCT-based coding / 173 \\
10.3 Coding model for lossless coding / 182 \\
10.4 Models for hierarchical coding / 185 \\
11: JPEG Huffman Entropy Coding / 189 \\
11.1 Statistical models for the Huffman DCT-based
sequential mode / 190 \\
11.2 Statistical models for progressive DCT-based
coding / 194 \\
11.3 Statistical models for lossless coding and
hierarchical mode spatial corrections / 198 \\
11.4 Generation of Huffman tables / 198 \\
12: Arithmetic Coding Statistical Models / 203 \\
12.1 Overview of JPEG binary arithmetic-coding
procedures / 203 \\
12.2 Decision trees and notation / 204 \\
12.3 Statistical models for the DCT-based sequential
mode with arithmetic coding / 206 \\
12.4 Statistical models for progressive DCT-based
coding / 214 \\
12.5 Statistical models for lossless coding and
hierarchical-rnode spatial corrections / 216 \\
12.6 Arithmetic coding conditioning tables / 218 \\
13: More on Arithmetic Coding / 219 \\
13.1 Optimal procedures for hardware and software / 220
\\
13.2 Fast software encoder implementations / 225 \\
13.3 Fast software decoder implementations / 228 \\
13.4 Conditional exchange / 229 \\
13.5 QM-coder versus Q-coder / 229 \\
13.6 Resynchronization of decoders / 230 \\
13.7 Speedup mode / 231 \\
14: Probability Estimation / 233 \\
14.1 Bayesian estimation / 234 \\
14.2 Renormalization-driven estimation / 235 \\
14.3 Markov-chain modelling of the probability
estimation / 236 \\
14.4 Approximate model / 238 \\
14.5 Single-and mixed-context models / 240 \\
14.6 Single-context model / 241 \\
14.7 Mixed-context model / 243 \\
14.8 Application of the estimation models to the
QM-coder / 244 \\
14.9 Initial learning / 247 \\
14.10 Robustness of estimators versus refinement of
models / 249 \\
14.11 Other estimation tables / 249 \\
15: Compression Performance / 253 \\
15.1 Results for baseline sequential DCT / 254 \\
15.2 Results for sequential DCT with arithmetic coding
/ 255 \\
15.3 Results for sequential DCT with restart capability
/ 255 \\
15.4 Results for progressive DCT with arithmetic coding
/ 256 \\
15.5 Results for lossless mode with arithmetic coding /
257 \\
15.6 Summary of Results / 258 \\
16: JPEG Enhancements / 261 \\
16.1 Removing blocking artifacts with AC prediction /
261 \\
16.2 Low bitrate VQ enhanced decoding / 264 \\
16.3 An approximate form of adaptive quantization / 264
\\
16.4 Display-adjusted decoding / 266 \\
17: JPEG Applications and Vendors / 267 \\
17.1 Adobe Systems Incorporated / 269 \\
17.2 AT\&T Microelectronics / 270 \\
17.3 AutoGraph International ApS / 271 \\
17.4 AutoView / 272 \\
17.5 Bulletin board systems / 272 \\
17.6 California Department of Motor Vehicles / 273 \\
17.7 C-Cube Microsystems, Inc. / 273 \\
17.8 Data Link / 275 \\
17.9 Discovery Technologies, Inc. / 275 \\
17.10 DSP / 276 \\
17.11 Eastman Kodak Company / 276 \\
17.12 Handmade Software / 277 \\
17.13 IBM / 278 \\
17.14 Identix / 279 \\
17.15 IIT / 279 \\
17.16 Independent JPEG Group / 280 \\
17.17 ITR / 281 \\
17.18 Lewis Siwell, Inc. / 281 \\
17.19 LSI Logic / 282 \\
17.20 Moore Data Management Services / 283 \\
17.21 NBS Imaging / 283 \\
17.22 NTT Electronics Technology Ltd. / 284 \\
17.23 OPTIBASE / 284 \\
17.24 Optivision, Inc. / 284 \\
17.25 Philips Kommunikations Industrie / 285 \\
17.26 PRISM / 286 \\
17.27 Storm Technology / 286 \\
17.28 Telephoto Communications / 287 \\
17.29 Tribune Publishing Co. / 288 \\
17.30 VideoTelecom / 288 \\
17.31 Ximage / 289 \\
17.32 Xing / 289 \\
17.33 Zoran Corporation / 290 \\
17.34 3M / 291 \\
17.35 File formats / 292 \\
18: Overview of CCITT, ISO, and IEC / 295 \\
18.1 ISO / 296 \\
18.2 CCITT / 297 \\
18.3 IEC / 298 \\
18.4 Joint coordination / 299 \\
19: History of JPEG / 301 \\
19.1 Formation of JPEG / 301 \\
19.2 Original JPEG Goals / 302 \\
19.3 Selecting an approach / 302 \\
19.4 Functional requirements / 303 \\
19.5 Refining the ADCT technique / 306 \\
19.6 Technical specifications / 307 \\
19.7 ISO 10918 Part I / 309 \\
19.8 JPEG Part I DIS ballot results / 311 \\
19.9 CCITT Recommendation T.81 / 311 \\
19.10 ISO 10918 Part 20 / 311 \\
19.11 JPEG Goals Achieved / 313 \\
20: Other Image Compression Standards / 317 \\
20.1 CCITTG3 and G40 / 317 \\
20.2 H.2610 / 318 \\
20.3 JBIG / 318 \\
20.4 MPEG / 325 \\
21: Possible Future JPEG Directions / 331 \\
21.1 Adaptive quantization / 331 \\
21.2 Improvements to lossless coding / 332 \\
21.3 Other possible addenda / 333 \\
21.4 Backwards compatibility / 333 \\
Appendix A. ISO DIS 10918-1 Requirements and Guidelines
/ 335 \\
Appendix B. Draft ISO DIS 10918-2 Compliance Testing /
545 \\
References / 627 \\
Index / 632",
}
@Article{Phillips:1992:DCU,
author = "Dwayne Phillips",
title = "Data Compression Using {Huffman} Coding",
journal = j-CUJ,
volume = "10",
number = "2",
pages = "55--??",
month = feb,
year = "1992",
ISSN = "0898-9788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "C Users Journal",
}
@Article{Phillips:1992:LDC,
author = "Dwayne Phillips",
title = "{LZW} Data Compression",
journal = "{Circuit Cellar INK} --- The Computer Applications
Journal",
volume = "27",
pages = "36--48",
month = jun # "\slash " # jul,
year = "1992",
CODEN = "CCIEBN",
ISSN = "0896-8985",
ISSN-L = "0896-8985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Phillips, Dwayne (1992) ``LZW Data Compression,'' {\it
The Computer Application Journal}, Circuit Cellar Inc.,
{\bf27}:36--48, June/July.",
xxjournal = "The Computer Application Journal",
}
@MastersThesis{Ramlaoui:1992:DCR,
author = "Hussam Ibrahim Ramlaoui",
title = "Data compression review and implementation",
type = "{M.S.} thesis",
school = "California State University, Long Beach",
address = "Long Beach, CA, USA",
pages = "72",
year = "1992",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304033789",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "1349677",
subject = "Electrical engineering",
}
@Article{Ratcliff:1992:AC,
author = "John W. Ratcliff",
title = "Audio compression",
journal = j-DDJ,
volume = "17",
number = "7",
pages = "32, 37--39, 96, 98--100",
month = jul,
year = "1992",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 10 10:06:23 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "B6130 (Speech analysis and processing techniques);
B6140 (Signal processing and detection); B6450 (Audio
equipment and systems); C5260 (Digital signal
processing); C6130 (Data handling techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "ACOMP; Audio compression algorithm; Digitized sound;
Fidelity; Human voice; Music",
thesaurus = "Assembly language listings; Audio signals;
Computerised signal processing; Data compression;
Speech analysis and processing",
}
@InProceedings{Reed:1992:PBC,
author = "T. R. Reed and V. R. Algazi and G. E. Ford and I.
Hussain",
title = "Perceptually based coding of monochrome and color
still images",
crossref = "Storer:1992:DCC",
pages = "142--151",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227467",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227467",
acknowledgement = ack-nhfb,
}
@InProceedings{Reif:1992:OTI,
author = "J. H. Reif and A. Yoshida",
title = "Optical techniques for image compression",
crossref = "Storer:1992:DCC",
pages = "32--40",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227478",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227478",
acknowledgement = ack-nhfb,
}
@InProceedings{Rollins:1992:PHW,
author = "M. Rollins and F. Carden",
title = "Possible harmonic-wavelet hybrids in image
compression",
crossref = "Storer:1992:DCC",
pages = "191--199",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227462",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227462",
acknowledgement = ack-nhfb,
}
@Article{Ross:1992:SDC,
author = "Ed Ross",
title = "A Simple Data-Compression Technique",
journal = j-CUJ,
volume = "10",
number = "10",
pages = "113--??",
month = oct,
year = "1992",
ISSN = "0898-9788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "C Users Journal",
}
@InProceedings{Savari:1992:ACM,
author = "S. A. Savari and R. G. Gallager",
title = "Arithmetic coding for memoryless cost channels",
crossref = "Storer:1992:DCC",
pages = "92--101",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227472",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227472",
acknowledgement = ack-nhfb,
}
@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/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303987736",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertation-thesis-number = "9232221",
subject = "Electrical engineering; Computer science",
}
@Article{Sayood:1992:DLI,
author = "Khalid Sayood and K. Anderson",
title = "A Differential Lossless Image Compression Scheme",
journal = j-IEEE-TRANS-SIG-PROC,
volume = "40",
number = "1",
pages = "236--241",
month = jan,
year = "1992",
CODEN = "ITPRED",
DOI = "https://doi.org/10.1109/78.157204",
ISSN = "1053-587X (print), 1941-0476 (electronic)",
ISSN-L = "1053-587X",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Signal Processing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=78",
rawdata = "Sayood, Khalid and K. Anderson (1992) ``A Differential
Lossless Image Compression Scheme,'' {\it IEEE
Transactions on Signal Processing},
{\bf40}(1):236--241, January.",
}
@InProceedings{Sheinwald:1992:BAC,
author = "D. Sheinwald",
title = "On binary alphabetical codes",
crossref = "Storer:1992:DCC",
pages = "112--121",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227470",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227470",
acknowledgement = ack-nhfb,
}
@Misc{Simpson:1992:RPP,
author = "W. Simpson",
title = "{RFC 1331}: The Point-to-Point Protocol ({PPP}) for
the Transmission of Multi-protocol Datagrams over
Point-to-Point Links",
month = may,
year = "1992",
bibdate = "Thu Oct 16 09:34:09 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Obsoleted by RFC1548 \cite{Simpson:1993:RPP}.
Obsoletes RFC1171, RFC1172
\cite{Perkins:1990:RPPa,Perkins:1990:RPPb}. Status:
PROPOSED STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1171.txt;
ftp://ftp.internic.net/rfc/rfc1172.txt;
ftp://ftp.internic.net/rfc/rfc1331.txt;
ftp://ftp.internic.net/rfc/rfc1548.txt;
https://www.math.utah.edu/pub/rfc/rfc1171.txt;
https://www.math.utah.edu/pub/rfc/rfc1172.txt;
https://www.math.utah.edu/pub/rfc/rfc1331.txt;
https://www.math.utah.edu/pub/rfc/rfc1548.txt",
acknowledgement = ack-nhfb,
format = "TXT=129892 bytes",
obsoletedby = "Obsoleted by RFC1548 \cite{Simpson:1993:RPP}.",
obsoletes = "Obsoletes RFC1171, RFC1172
\cite{Perkins:1990:RPPa,Perkins:1990:RPPb}.",
online = "yes",
status = "PROPOSED STANDARD",
}
@InProceedings{Sproull:1992:CCG,
author = "R. F. Sproull and I. E. Sutherland",
title = "A comparison of codebook generation techniques for
vector quantization",
crossref = "Storer:1992:DCC",
pages = "122--131",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227469",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227469",
acknowledgement = ack-nhfb,
}
@InProceedings{Stauffer:1992:TCS,
author = "L. M. Stauffer and D. S. Hirschberg",
title = "Transpose coding on the systolic array",
crossref = "Storer:1992:DCC",
pages = "162--171",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227465",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227465",
acknowledgement = ack-nhfb,
}
@Article{Thomborson:1992:VSD,
author = "Clark Thomborson",
title = "The {V.42bis} Standard for Data-Compressing Modems",
journal = j-IEEE-MICRO,
volume = "12",
number = "5",
pages = "41--53",
month = sep # "\slash " # oct,
year = "1992",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/40.166712",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib; Science
Citation Index database (1980--2000)",
abstract = "Examining practical, algorithmic, and marketing
aspects of this standard uncovers no serious flaws in
its specification",
acknowledgement = ack-ds # " and " # ack-nhfb,
classcodes = "B6220W (Other stations); B6140 (Signal processing and
detection); C5630 (Networking equipment); C6130 (Data
handling techniques)",
corpsource = "Minnesota Univ., Duluth, MN, USA",
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
keywords = "Berkeley Unix Compress; CCITT V.42bis standard; data
compression; data-compressing; Lempel--Ziv--Welch
algorithm; modems; standards; text compression;
utility",
rawdata = "Thomborson, Clark, (1992) ``The V.42bis Standard for
Data-Compressing Modems,'' {\it IEEE Micro}, pp.
41--53, October.",
treatment = "P Practical; X Experimental",
}
@Article{Tjalkens:1992:UVF,
author = "T. Tjalkens and Frans M. Willems",
title = "A Universal Variable-to-Fixed Length Source Code Based
on {Lawrence}'s Algorithm",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "38",
number = "2",
pages = "247--253",
month = mar,
year = "1992",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.119684",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Tjalkens, T. and Frans M. Willems (1992) ``A Universal
Variable-to-Fixed Length Source Code Based on
Lawrence's Algorithm,'' {\it IEEE Transactions on
Information Theory}, {\bf38}(2):247--253, March.",
}
@InProceedings{Wang:1992:VRL,
author = "Y. Wang and J.-M. Wu",
title = "Vector run-length coding of bi-level images",
crossref = "Storer:1992:DCC",
pages = "289--298",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227452",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227452",
acknowledgement = ack-nhfb,
}
@Article{Wegener:1992:RDC,
author = "Al Wegener",
title = "Review of {{\em Data Compression}, 3rd edn. (Held, G;
1991)}",
journal = j-COMPUTER,
volume = "25",
number = "8",
pages = "110--111",
month = aug,
year = "1992",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Mar 17 10:11:23 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@InProceedings{Weinberger:1992:CDG,
author = "M. J. Weinberger and A. Lempel and J. Ziv",
title = "On the coding delay of a general coder",
crossref = "Storer:1992:DCC",
pages = "102--111",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227471",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227471",
acknowledgement = ack-nhfb,
}
@Article{Wickerhauser:1992:HRS,
author = "Mladen Victor Wickerhauser",
title = "High-Resolution Still Picture Compression",
journal = "Digital Signal Processing: a Review Journal",
volume = "2",
number = "4",
pages = "204--226",
month = oct,
year = "1992",
DOI = "https://doi.org/10.1016/1051-2004(92)90010-v",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/dsp.ps.Z",
}
@InProceedings{Witten:1992:TIC,
author = "Ian H. Witten and T. C. Bell and M.-E. E. Harrison and
M. L. James and A. Moffat",
title = "Textual Image Compression",
crossref = "Storer:1992:DCC",
pages = "42--51",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227477",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227477",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Witten, Ian H., T. C. Bell, M. E. Harrison, M. L.
James, and A. Moffat (1992) ``Textual Image
Compression,'' {\it Proceedings of the 1992 Data
Compression Conference}, J. Storer, ed., Los Alamitos,
CA, IEEE Computer Society Press, pp. 42--51.",
}
@Article{Wong:1992:CCT,
author = "P. W. Wong and J. Koplowitz",
title = "Chain Codes and Their Linear Reconstruction Filters",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-38",
number = "2",
pages = "268--280",
month = may,
year = "1992",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.119686",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Wong, P. W., and J. Koplowitz (1992) ``Chain Codes and
Their Linear Reconstruction Filters,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT-38}(2):268--280, May.",
}
@InProceedings{Wu:1992:LIC,
author = "X. Wu and Yonggang Fang",
title = "Lossless interframe compression of medical images",
crossref = "Storer:1992:DCC",
pages = "249--258",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227456",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227456",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:1992:VQD,
author = "Xiaolin Wu",
title = "Vector quantizer design by constrained global
optimization",
crossref = "Storer:1992:DCC",
pages = "132--141",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227468",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227468",
acknowledgement = ack-nhfb,
}
@Article{Yu:1992:DCH,
author = "Bin Yu and T. P. Speed",
title = "Data compression and histograms",
journal = j-PROBAB-THEORY-RELAT-FIELDS,
volume = "92",
number = "2",
pages = "195--229",
month = "????",
year = "1992",
CODEN = "PTRFEU",
DOI = "https://doi.org/10.1007/BF01194921",
ISSN = "0178-8051 (print), 1432-2064 (electronic)",
ISSN-L = "0178-8051",
bibdate = "Sun Apr 27 11:18:29 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/probab-theory-relat-fields.bib",
URL = "http://link.springer.com/article/10.1007/BF01194921",
acknowledgement = ack-nhfb,
fjournal = "Probability Theory and Related Fields",
journal-URL = "http://link.springer.com/journal/440",
}
@InProceedings{Zamir:1992:UCB,
author = "R. Zamir and M. Feder",
title = "Universal coding of band-limited sources by sampling
and dithered quantization",
crossref = "Storer:1992:DCC",
pages = "329--338",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227448",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227448",
acknowledgement = ack-nhfb,
}
@PhdThesis{Zandi:1992:ANB,
author = "Ahmad Zandi",
title = "Adaption to nonstationary binary sources for data
compression",
type = "{Ph.D.} thesis",
school = "University of California, Santa Cruz",
address = "Santa Cruz, CA, USA",
pages = "65",
year = "1992",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303987140",
acknowledgement = ack-nhfb,
advisor = "Glen G. {Langdon, Jr.}",
classification = "0984: Computer science",
dissertation-thesis-number = "9224688",
subject = "Computer science",
}
@InProceedings{Zhu:1992:IRH,
author = "Q.-F. Zhu and Y. Wang and L. Shaw",
title = "Image reconstruction for hybrid video coding systems",
crossref = "Storer:1992:DCC",
pages = "229--238",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227458",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227458",
acknowledgement = ack-nhfb,
}
@Article{Zipstein:1992:DCF,
author = "M. Zipstein",
title = "Data compression with factor automata",
journal = j-THEOR-COMP-SCI,
volume = "92",
number = "1",
pages = "213--221",
day = "06",
month = jan,
year = "1992",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/0304-3975(92)90144-5",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); C1260 (Information theory); C4220
(Automata theory)",
conflocation = "Paris, France; July 1990",
conftitle = "Combinatorial Pattern Matching School",
corpsource = "CERIL, Evry, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
keywords = "automata theory; data compression; data compression
algorithm; encoding; entropy; factor automata; text",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@PhdThesis{Abbas:1993:ANN,
author = "Hazem M. Abbas",
title = "Artificial neural networks models for image data
compression",
type = "{Ph.D.} thesis",
school = "Queen's University at Kingston",
address = "Kingston, ON, Canada",
pages = "162",
year = "1993",
ISBN = "0-315-80743-1",
ISBN-13 = "978-0-315-80743-3",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304058068",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "NN80743",
subject = "Electrical engineering",
}
@InProceedings{Abrahams:1993:CMC,
author = "J. Abrahams",
title = "Codes with monotonic codeword lengths",
crossref = "Storer:1993:DDC",
pages = "52--59",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253145",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253145",
acknowledgement = ack-nhfb,
}
@InProceedings{Andrews:1993:MRV,
author = "B. D. Andrews and M. Effros and P. A. Chou and R. M.
Gray",
title = "A mean-removed variation of weighted universal vector
quantization for image coding",
crossref = "Storer:1993:DDC",
pages = "302--309",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253119",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253119",
acknowledgement = ack-nhfb,
}
@InProceedings{Arya:1993:AFV,
author = "S. Arya and D. M. Mount",
title = "Algorithms for fast vector quantization",
crossref = "Storer:1993:DDC",
pages = "381--390",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253111",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253111",
acknowledgement = ack-nhfb,
}
@InProceedings{Barnes:1993:CVR,
author = "C. F. Barnes and E. J. Holder",
title = "Classified variable rate residual vector quantization
applied to image subband coding",
crossref = "Storer:1993:DDC",
pages = "272--281",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253122",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253122",
acknowledgement = ack-nhfb,
}
@PhdThesis{Becker:1993:IVC,
author = "Jeffrey Chaim Becker",
title = "Increasing {VLSI} Chip Address and Data {I/O} Pin
Bandwidth Through Compression",
type = "{Ph.D.} thesis",
school = "University of California, Davis",
address = "Davis, CA, USA",
pages = "104",
year = "1993",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304049364",
acknowledgement = ack-nhfb,
advisor = "Dai Jie Cheng",
classification = "0984: Computer science",
dissertation-thesis-number = "9415893",
subject = "Computer science",
}
@Article{Bell:1993:LMS,
author = "Timothy C. Bell and David Kulp",
title = "Longest-match String Searching for {Ziv--Lempel}
Compression",
journal = j-SPE,
volume = "23",
number = "7",
pages = "757--771",
month = jul,
year = "1993",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.4380230705",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Sat May 31 13:36:16 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@Article{Bell:1993:RDC,
author = "Timothy C. Bell and Alistair Moffat and Craig G.
Nevill-Manning and Ian H. Witten and Justin Zobel",
title = "Research: Data compression in full-text retrieval
systems",
journal = j-J-AM-SOC-INF-SCI,
volume = "44",
number = "9",
pages = "508--531",
month = oct,
year = "1993",
CODEN = "AISJB6",
DOI = "https://doi.org/10.1002/(SICI)1097-4571(199310)44:9<508::AID-ASI2>3.0.CO%3B2-A",
ISSN = "0002-8231 (print), 1097-4571 (electronic)",
ISSN-L = "0002-8231",
bibdate = "Fri Sep 11 09:03:57 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jasis.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Society for Information
Science",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2330-1643",
onlinedate = "4 Jan 1999",
}
@Misc{Benedetto:1993:NMA,
author = "J. Benedetto and A. Teolis",
title = "Nonlinear Method and Apparatus for Coding and Decoding
Acoustic Signals with Data Compression and Noise
Suppression Using Cochlear Filters, Wavelet Analysis,
and Irregular Sampling Reconstruction",
howpublished = "U.S. Patent pending",
year = "1993",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}
@Article{Bergen:1993:CPA,
author = "Helen A. Bergen and James M. Hogan",
title = "A chosen plaintext attack on an adaptive arithmetic
coding compression algorithm",
journal = j-COMPUT-SECUR,
volume = "12",
number = "2",
pages = "157--167",
month = mar,
year = "1993",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/016740489390099Q",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Bhaskaran:1993:OPL,
author = "V. Bhaskaran and B. K. Natarajan and K.
Konstantinides",
title = "Optimal piecewise-linear compression of images",
crossref = "Storer:1993:DDC",
pages = "168--177",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253133",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253133",
acknowledgement = ack-nhfb,
}
@Article{Blinn:1993:WDD,
author = "J. F. Blinn",
title = "{What}'s the Deal with the {DCT}",
journal = j-IEEE-CGA,
volume = "13",
number = "4",
pages = "78--83",
month = jul,
year = "1993",
CODEN = "ICGADZ",
DOI = "https://doi.org/10.1109/38.219457",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecga.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "IEEE Computer Graphics and Applications",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
rawdata = "Blinn, J. F. (1993) ``What's the Deal with the DCT,''
{\it IEEE Computer Graphics and Applications} pp.
78--83, July.",
remark = "The discrete cosine transform is the basis of most
image compression techniques today. Why is it better
than the discrete Fourier transform?",
}
@InProceedings{Bookstein:1993:CRF,
author = "A. Bookstein and S. T. Klein and T. Raita and I. K.
Ravichandra Rao and M. D. Patil",
title = "Can random fluctuation be exploited in data
compression?",
crossref = "Storer:1993:DDC",
pages = "70--78",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253143",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253143",
acknowledgement = ack-nhfb,
}
@InProceedings{Bookstein:1993:HCDa,
author = "Abraham Bookstein and S. T. Klein",
title = "Is {Huffman} Coding Dead?",
crossref = "Korfhage:1993:PSA",
volume = "50",
number = "4",
pages = "80--87",
year = "1993",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Also published in
\cite{Bookstein:1993:HCDb,Bookstein:1993:HCDc}.",
acknowledgement = ack-ds,
rawdata = "Bookstein, Abraham and S. T. Klein (1993) ``Is Huffman
Coding Dead?'' {\it Proceedings of the 16th Annual
International ACM SIGIR Conference on Research and
Development in Information Retrieval}, pp. 80--87. Also
published {\it Computing}, {\bf50}(4):279--296, 1993,
and {\it Proceedings of the Data Compression
Conference, 1993}, Snowbird, UT. p. 464.",
}
@InProceedings{Bookstein:1993:HCDb,
author = "Abraham Bookstein and S. T. Klein",
title = "Is {Huffman} Coding Dead?",
crossref = "Storer:1993:DDC",
pages = "464--??",
year = "1993",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Also published in
\cite{Bookstein:1993:HCDa,Bookstein:1993:HCDc}.",
acknowledgement = ack-ds,
rawdata = "Bookstein, Abraham and S. T. Klein (1993) ``Is Huffman
Coding Dead?'' {\it Proceedings of the 16th Annual
International ACM SIGIR Conference on Research and
Development in Information Retrieval}, pp. 80--87. Also
published {\it Computing}, {\bf50}(4):279--296, 1993,
and {\it Proceedings of the Data Compression
Conference, 1993}, Snowbird, UT. p. 464.",
}
@Article{Bookstein:1993:HCDc,
author = "A. Bookstein and S. T. Klein",
title = "Is {Huffman} coding dead",
journal = j-COMPUTING,
volume = "50",
number = "4",
pages = "279--296",
month = dec,
year = "1993",
CODEN = "CMPTA2",
DOI = "https://doi.org/10.1007/bf02243872",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
MRclass = "94A29",
MRnumber = "1 235 463",
bibdate = "Mon Oct 11 20:38:38 MDT 1999",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
https://www.math.utah.edu/pub/tex/bib/computing.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
MathSciNet database",
note = "Also published in
\cite{Bookstein:1993:HCDa,Bookstein:1993:HCDb}.",
acknowledgement = ack-nhfb,
fjournal = "Computing",
journal-URL = "http://link.springer.com/journal/607",
}
@InProceedings{Bradley:1993:FWS,
author = "Jonathan N. Bradley and Christopher M. Brislawn and
Tom Hopper",
booktitle = "{Proceedings of Visual Information Processing II,
Orlando, FL}",
title = "The {FBI} Wavelet/Scalar Quantization Standard for
Grayscale Fingerprint Image Compression",
volume = "1961",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "293--304",
month = apr,
year = "1993",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Bradley, Jonathan N., Christopher M. Brislawn, and Tom
Hopper (1993) ``The FBI Wavelet/Scalar Quantization
Standard for Grayscale Fingerprint Image Compression,''
{\it Proceedings of Visual Information Processing II},
Orlando, FL, SPIE vol.{} 1961, pp. 293--304, April.",
}
@InProceedings{Bradley:1993:WTV,
author = "J. N. Bradley and C. M. Brislawn",
title = "Wavelet transform-vector quantization compression of
supercomputer ocean models",
crossref = "Storer:1993:DDC",
pages = "224--233",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253127",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253127",
acknowledgement = ack-nhfb,
}
@InProceedings{Chan:1993:JCD,
author = "W.-Y. Chan and A. Gersho and S.-W. Soong",
title = "Joint codebook design for summation product-code
vector quantizers",
crossref = "Storer:1993:DDC",
pages = "42--51",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253146",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253146",
acknowledgement = ack-nhfb,
}
@Article{Chang:1993:NLA,
author = "Henry Ker-Chang Chang and Shing Hong Chen",
title = "A new locally adaptive data compression scheme using
multilist structure",
journal = j-COMP-J,
volume = "36",
number = "6",
pages = "570--578",
month = dec,
year = "1993",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/36.6.570",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:38 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/36/6.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_36/Issue_06/Vol36_06.index.html",
URL = "http://comjnl.oxfordjournals.org/content/36/6/570.full.pdf+html;
http://www3.oup.co.uk/computer_journal/Volume_36/Issue_06/Vol36_06.body.html#AbstractChang",
acknowledgement = ack-nhfb,
affiliation = "Graduate Sch. of Resources Manage., Nat. Defense
Manage. Coll., Taipei, Taiwan",
author-1-adr = "Graduate School of Resources Management, National
Defense Management College, PO Box 90046-17, Chung-Ho,
Taipei, Taiwan, ROC",
author-2-adr = "Graduate School of Resources Management, National
Defense Management College, PO Box 90046-17, Chung-Ho,
Taipei, Taiwan, ROC",
classcodes = "B6140 (Signal processing and detection)",
classification = "B6140 (Signal processing and detection)",
corpsource = "Graduate Sch. of Resources Manage., Nat. Defense
Manage. Coll., Taipei, Taiwan",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "data compression; encoding; G1; G1 prefix code;
Locally adaptive data compression scheme; locally
adaptive data compression scheme; multilist; Multilist
structure; prefix code; Prefix coding methods; prefix
coding methods; structure; Transmitted code word;
transmitted code word",
thesaurus = "Data compression; Encoding",
treatment = "T Theoretical or Mathematical",
}
@Article{Chang:1993:RCO,
author = "Chin-Chen Chang and Huey-Cheue Kowng and Tzong-Chen
Wu",
title = "A refinement of a compression-oriented addressing
scheme",
journal = j-BIT,
volume = "33",
number = "4",
pages = "529--535",
month = dec,
year = "1993",
CODEN = "BITTEL, NBITAB",
DOI = "https://doi.org/10.1007/BF01990533",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
bibdate = "Wed Jan 4 18:52:23 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=33&issue=4;
https://www.math.utah.edu/pub/tex/bib/bit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://www.mai.liu.se/BIT/contents/bit33.html;
http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=33&issue=4&spage=529",
abstract = "Chang and Wu have proposed a letter-oriented perfect
hashing scheme based on sparse matrix compression. We
present a method which is a refinement of the Chang-Wu
scheme. By experimental evaluation, we show that the
hashing of our refinement has more efficient storage
utilization than Chang-Wu's method. Our refinement is
valuable in practical implementations of hashing for
large sets of keys.",
acknowledgement = ack-nhfb,
fjournal = "BIT (Nordisk tidskrift for informationsbehandling)",
journal-URL = "http://link.springer.com/journal/10543",
keywords = "perfect hashing; row displacement method; sparse
matrix compression",
}
@PhdThesis{Chang:1993:SPM,
author = "Daniel Kuo-Yee Chang",
title = "String pattern matching and lossless data
compression",
type = "{Ph.D.} thesis",
school = "City University of New York",
address = "New York, NY, USA",
pages = "110",
year = "1993",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://search.proquest.com/docview/304028781",
acknowledgement = ack-nhfb,
advisor = "Charles Giardina",
classification = "0984: Computer science",
dissertation-thesis-number = "9325077",
subject = "Computer science",
}
@InCollection{Coifman:1993:SPC,
author = "Ronald R. Coifman and Yves Meyer and Stephen R. Quake
and Mladen Victor Wickerhauser",
title = "Signal Processing and Compression with Wavelet
Packets",
crossref = "Meyer:1993:PWA",
pages = "77--93",
year = "1993",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://math.yale.edu/pub/wavelets/cmqw.tex",
}
@
