0<-;+8(7%6"2.,*(%$#! ~{ y xvspnlkheb`^[WTQONLJ߅H݅FڅEDׅBօ?Յ<҅;Ѕ9΅6ͅ3˅0ȅ-*&" }{yurpomkif~e{by`w^u\rZqXoVnSlQkOiMhJgGdDbC`B^@\>[;Y8X6U3T1Q.P+M(K'J$H"FA?><;:8 7620/.|,y*w)t's&r%o#l!j gfc`][YWTQ NK IGDA><9631/,)&# ߃ނ܂}ڂzւwՂuӂrЂpςn̂lʂjȂhƂeca_\ZXUSQOLIGFDBA@>=<:86543|1y/w.u,r*p)o(l&j$g#c!`^\YWTQMKJH F C@=94}3{.y+v*s'q&o$n"mkigeca`^ \ [ZYVTSROMKJIGDBA?>=;݁9ہ75ԁ3ҁ0Ё.ρ,́*ȁ(&" }{yvtrpnlj~h{fycwau_q^m\jYiWgVeUaT_R\P[NUMQIPGNDLBH@F?D=C;B9?7=4<2918/7,4)2'0&.$-!+ &$! ATQSst\D @Article{Sayood:1992:DLI, author = "Khalid Sayood and K. Anderson", title = "A Differential Lossless Image C @Misc{Simpson:1993:RPH, author = "W. Simpson", title = "{RFC 1549}: {PPP} in {HDLC} Framing", month = dec, year = "1993", bibdate = "Thu Oct 16 09:34:09 MDT 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Obsoleted by RFC1662, STD0051 \cite{Simpson:1994:RPH,Simpson:1994:SPP}. Status: DRAFT STANDARD.", URL = "ftp://ftp.internic.net/rfc/rfc15,Y @InProceedings{Ranganathan:1991:SAL, author = "N. Ranganathan and S. Henriques", title = "A systolic architecture for {LZ} based decompressionuk @InProceedings{Howard:1993:FEL, author = "Paul G. Howard and J. S. Vitter", title = "Fast and Efficient Lossless Image Compression", crossref = "Storer:1993:DDC", pages = "351--360", year = "1993", DOI = "https://doi.org/10.1109/DCC.1993.253114", bibdate = "Tue Feb 5 14:06:26 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253114", acknowledgement = ack-ds # " and " # ack-nhfb, rawdata = "Howard, Paul G., and J. S. Vitter, (1993) ``Fast and Efficient Lossless Image Compression,'' in {\it Proceedings of the 1993 Data Compression Conference}, J. Storer, ed., Los Alamitos, CA, IEEE Computer Society Press, pp. 351--360.", }نfO @Book{Wright:1939:GSW, author = "Ernest Vincent Wright", title = "{Gadsby}; a story of over 50,000 words without using the letter ``{E}''", publisher = "Wetzel Publishing Co., Inc.", address = "Los Angeles, CA, USA", pages = "267", year = "1939", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/p[,Y @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 = "http://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.", }=Z @Article{Shinya:1998:PMS, author = "Mikio Shinya and Takeaki Mori and Noriyoshi Osumi", title = "Periodic Motion Synthesis and {Fourier} Compression", journal = j-J-VIS-COMP-ANIMATION, volume = "9", number = "2", pages = "95--107", month = apr # "--" # jun, year = "1998", CODEN = "JVCAEO", ISSN = "1049-8907", ISSN-L = "1049-8907", bibdate = "Thu Jul 29 07:22:52 MDT 1999", bibsource = "http://www.interscience.wiley.com/jpages/1049-8907; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://www3.interscience.wiley.com/cgi-bin/abstract?ID=5508; http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=5508&PLACEBO=IE.pdf", acknowledgement = ack-nhfb, fjournal = "Journal of Visualization and Computer Animation", }= "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", } d idX 3)a!57E};7iarticledatacompression.bibPeano:1890:CQRG. PeanoSur une Courbe Qui Remplit Toute une Aire plane. (French) [On a Curve that Completely Fills a Planar Area]j-MATH-ANN36157--1601890MAANA30025-5831 (print), 1432-1807 (electronic) OR 00255831 (print), 14321807 (electronic)0025-5831 OR 00255831Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTMathematische AnnalenFrenchack-dsG. PeanoSur une Courbe Qui Remplit Toute une Aire plane. ({French}) [{On} a Curve that Completely Fills a Planar Area] @Article{Peano:1890:CQR, author = "G. Peano", title = "Sur une Courbe Qui Remplit Toute une Aire plane. ({French}) [{On} a Curve that Completely Fills a Planar Area]", journal = 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 = "http://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", }W 31=++E};=+!bookdatacompression.bibdellaPorta:1558:MNGiambattista della PortaMagia NaturalisNaples[, Italy]1558Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTFirst edition, four volumes 1558, second edition, 20 volumes 1589. Translated by Thomas Young and Samuel Speed, booktitle Natural Magick by John Baptista Porta, a Neopolitane, London 1658ack-dsGiambattista della PortaFirst edition, four volumes 1558, second edition, 20 volumes 1589. Translated by Thomas Young and Samuel Speed, \booktitle{Natural Magick by John Baptista Porta, a Neopolitane}, London 1658Magia Naturalis @Book{dellaPorta:1558:MN, author = "Giambattista della Porta", title = "Magia Naturalis", publisher = "????", address = "Naples[, Italy]", pages = "??", year = "1558", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "First edition, four volumes 1558, second edition, 20 volumes 1589. Translated by Thomas Young and Samuel Speed, \booktitle{Natural Magick by John Baptista Porta, a Neopolitane}, London 1658", acknowledgement = 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.", } uX 3'[!57E};7g )articledatacompression.bibHaar:1910:TOFA. HaarZur Theorie der Orthogonalen Funktionensysteme. (German) [On the theory of orthogonal function systems]j-MATH-ANN69331--3711910MAANA30025-5831 (print), 1432-1807 (electronic) OR 00255831 (print), 14321807 (electronic)0025-5831 OR 00255831Sat Jan 26 12:46:12 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:12 MSTMathematische AnnalenGermanack-dsA. Haar{Zur Theorie der Orthogonalen Funktionensysteme}. ({German}) [{On} the theory of orthogonal function systems] @Article{Haar:1910:TOF, author = "A. Haar", title = "{Zur Theorie der Orthogonalen Funktionensysteme}. ({German}) [{On} the theory of orthogonal function systems]", journal = 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 = "http://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.", }XX 3-!y!57E};7!marticledatacompression.bibHilbert:1891:SALD. HilbertUber stetige Abbildung einer Linie auf ein Flachenstuck. (German) [On a continuous map of a line on a surface element]j-MATH-ANN38459--4601891MAANA30025-5831 (print), 1432-1807 (electronic) OR 00255831 (print), 14321807 (electronic)0025-5831 OR 00255831Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTMathematische AnnalenGermanack-dsD. Hilbert{{\"U}ber stetige Abbildung einer Linie auf ein Fl{\"a}chenst{\"u}ck}. ({German}) [{On} a continuous map of a line on a surface element] @Article{Hilbert:1891:SAL, author = "D. Hilbert", title = "{{\"U}ber stetige Abbildung einer Linie auf ein Fl{\"a}chenst{\"u}ck}. ({German}) [{On} a continuous map of a line on a surface element]", journal = 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 = "http://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.", } D @Article{Abbas:2014:FDC, author = "Ahmed Mohammed Abbas and Azuraliza Abu Bakar and Mohd Zakree Ahmad", title = "Fast dynamic clustering {SOAP} messages based compression and aggregation model for enhanced performance of {Web} services", journal = j-J-NETW-COMPUT-APPL, volume = "41", number = "??", pages = "80--88", month = may, year = "2014", CODEN = "J K @Article{Abel:2005:UTP, author = "J. Abel and W. Teahan", title = "Universal text preprocessing for data compression", journal = j-IEEE-TRANS-COMPUT, volume = "54", number = "5", pages = "497--507", month = may, year = "2005", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2005.85", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Jul 4 16:17:16 MDT 2011", bibsource = "http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1407841", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", }ؐm[ @Article{Abel:2007:IFC, author = "J{\"u}rgen Abel", title = "Incremental frequency count --- a post {BWT}-stage for the {Burrows--Wheeler} compression algorithm", journal = j-SPE, volume = "37", number = "3", pages = "247--265", month = mar, year = "2007", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.763", ISSN = "0038-0644 (print), 1097-024X (electronic)", eK @Article{Abel:2010:PBS, author = "J{\"u}rgen Abel", title = "Post {BWT} stages of the {Burrows--Wheeler} compression algorithm", journal = j-SPE, volume = "40", number = "9", pages = "751--777", month = aug, year = "2010", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.982", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bib @Article{Abu-Mostafa:2000:MCL, author = "Y. S. Abu-Mostafa and R. J. McEliece", title = "Maximal codeword lengths in {Huffman} codes", journal = j-COMPUT-MATH-APPL, volume = "39", number = "11", pages = "129--134", month = jun, year = "2000", CODEN = "CMAPDK", ISSN = "0898-1221 (print), 1873-7668 (electronic)", ISSN-L = "0898-1221", bibdate = "Wed Mar 1 21:49:05 MST 2017", bibsource = "http://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://www.sciencedirect.com/science/article/pii/S089812210000119X", acknowledgement = ack-nhfb, fjournal = "Computers and Mathematics with Applications", journal-URL = "http://www.sciencedirect.com/science/journal/08981221", }b @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", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68P25", MRnumber = "993 620", bx [ l2e @Article{Anonymous:1992:FDC, author = "Anonymous", tiE @Article{Aleh:19 @Article' @Article{Adiego:2007:LZC, author = "Joaqu{\'\i}n Adiego and Gonzalo Navarro and Pablo de la Fuente", title = "{Lempel--Ziv} compression of highly structured documents", journal = j-J-AM-SOC-INF-SCI-TECHNOL, volume = "58", number = "4", pages = "461--478", day = "15", month = feb, year = "2007", CODEN = "JASIEF", DOI = "https://doi.org/10.1002/asi.20i]; @Article{Agarwal:2006:AGA, author = "R. C. Agarwal and K. Gupta and S. Jain and S. Amalapurapu", title = "An approximation to the greedy algorithm for differential compression", journal = j-IBM-JRD, volume = "50", number = "1", pages = "149--166", month = jan, year = "2006", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = @Article{Ageenko:1999:FAM, author = "Eugene I. Ageenko and Pasi Fr{\"a}nti", title = "Forward-adaptive method for context-based compression of large binary images", journal = j-SPE, volume = "29", number = "11", pages = "943--952", month = sep, year = "1999", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "SaF"E @Article{Ajtai:2002:CEU, author = "Miklos Ajtai and Randal Burns and Ronald Fagin and Darrell D. E. Long and Larry Stockmeyer", title = "Compactly encoding unstructured inputs with differential compression", journal = j-J-ACM, volume = "49", number = "3", pages = "318--367", month = may, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 10 17:35:44 MDT 2002", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", }G @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 = R#G @Article{Ahlswede:1997:UCI, author = "Rudolf Ahlswede and Te Sun Han and Kingo Kobayashi", title = "Universal Coding of Integers and Unbounded Search Trees", journal = j-IEEE-TRANS-INF-THEORY, volume = "43", number = "2", pages = "669--682", year = "1997", CODEN = "IETTAW", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, fjournal = "IEEE Transactions on Information Theory", rawdata = "Ahlswede, Rudolf, Te Sun Han, and Kingo Kobayashi (1997) ``Universal Coding of Integers and Unbounded Search Trees,'' {\it IEEE Transactions on Information Theory}, {\bf43}(2):669--682.", }w V V3W 33'aQE};Y/]iarticledatacompression.bibSierpinski:1912:CQRW. SierpinskiSur une Courbe Qui Remplit Toute une Aire plane. (French) [On a Curve that Completely Fills a Planar Area]Bull. Acad. Sci. Cracovie, Serie A462--4781912Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTReprinted in cite Sierpinski:1990:NCQ.Frenchack-dsW. Sierpi{\'n}skiReprinted in \cite{Sierpinski:1990:NCQ}.Sur une Courbe Qui Remplit Toute une Aire plane. ({French}) [{On} a Curve that Completely Fills a Planar Area] @Article{Sierpinski:1912:CQR, author = "W. Sierpi{\'n}ski", title = "Sur une Courbe Qui Remplit Toute une Aire plane. ({French}) [{On} a Curve that Completely Fills a Planar Area]", journal = "Bull. Acad. Sci. Cracovie, Serie A", pages = "462--478", year = "1912", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Reprinted in \cite{Sierpinski:1990:NCQ}.", acknowledgement = 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", }qX 3'[!57E};7g articledatacompression.bibHaar:1912:TOFA. HaarZur Theorie der Orthogonalen Funktionensysteme. (German) [On the theory of orthogonal function systems]j-MATH-ANN7138--531912MAANA30025-5831 (print), 1432-1807 (electronic) OR 00255831 (print), 14321807 (electronic)0025-5831 OR 00255831Sat Jan 26 12:46:12 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:12 MSTMathematische AnnalenGermanack-dsA. Haar{Zur Theorie der Orthogonalen Funktionensysteme}. ({German}) [{On} the theory of orthogonal function systems] @Article{Haar:1912:TOF, author = "A. Haar", title = "{Zur Theorie der Orthogonalen Funktionensysteme}. ({German}) [{On} the theory of orthogonal function systems]", journal = 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 = "http://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.", } "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", } UW 31%5!E};%Ygarticledatacompression.bibOsterberg:1935:TLRG. OsterbergTopography of the Layer of Rods and Cones in the Human RetinaActa Ophthalmologica(suppl. 6)1--1031935Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsG. OsterbergTopography of the Layer of Rods and Cones in the Human Retina @Article{Osterberg:1935:TLR, author = "G. Osterberg", title = "Topography of the Layer of Rods and Cones in the Human Retina", journal = "Acta Ophthalmologica", volume = "(suppl. 6)", number = "??", pages = "1--103", month = "????", year = "1935", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }W 3-'kA7E};O 'karticledatacompression.bibNyquist:1928:CTTHarry NyquistCertain Topics in Telegraph Transmission Theoryj-TRANS-AMER-INST-ELEC-ENG47617--6441928TAEEA50096-3860 OR 00963860Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSThttp://www.xiph.org/ogg/flac.htmlTransactions of the American Institute of Electrical Engineersack-dshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6413714Harry NyquistCertain Topics in Telegraph Transmission Theory @Article{Nyquist:1928:CTT, author = "Harry Nyquist", title = "Certain Topics in Telegraph Transmission Theory", journal = 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 = "http://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|.", } @ U3)_?)7E};__?e articledatacompression.bibHecht:1942:EQVS. Hecht and S. Schlaer and M. H. PirenneEnergy, Quanta and Visionj-J-OPT-SOC-AM38196--2081942JOSAAH0030-3941 OR 00303941Sat Jan 26 12:46:12 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:12 MSTJournal of the Optical Society of Americaack-dsS. Hecht and S. Schlaer and M. H. PirenneEnergy, Quanta and Vision @Article{Hecht:1942:EQV, author = "S. Hecht and S. Schlaer and M. H. Pirenne", title = "Energy, Quanta and Vision", journal = 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 = "http://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.", }w X 3+7C5E_;}E7}Obookdatacompression.bibWright:1939:GSWErnest Vincent WrightGadsby; a story of over 50,000 words without using the letter ``E''Wetzel Publishing Co., Inc.Los Angeles, CA, USA2671939Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/master.bib2013.01.26 12:46:16 MSTReprinted by University Microfilms, Ann Arbor, MI, 1991.http://gadsby.hypermart.net/ack-dsErnest Vincent WrightReprinted by University Microfilms, Ann Arbor, MI, 1991.{Gadsby}; a story of over 50,000 words without using the letter ``{E}'' @Book{Wright:1939:GSW, author = "Ernest Vincent Wright", title = "{Gadsby}; a story of over 50,000 words without using the letter ``{E}''", publisher = "Wetzel Publishing Co., Inc.", address = "Los Angeles, CA, USA", pages = "267", year = "1939", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/master.bib", note = "Reprinted by University Microfilms, Ann Arbor, MI, 1991.", URL = "http://gadsby.hypermart.net/", acknowledgement = ack-ds # " and " # ack-nhfb, rawdata = "Wright, E. V. (1939) {\it Gadsby}, Los Angeles, Wetzel. Reprinted by University Microfilms, Ann Arbor, MI, 1991.", } O O.X 3/# '_7E};K3#1articledatacompression.bibLevinson:1947:WREN. LevinsonThe Weiner RMS Error Criterion in Filter Design and Predictionj-J-MATH-PHYS25261--2781947JMAPAQ0022-2488 (print), 1089-7658 (electronic), 1527-2427 OR 00222488 (print), 10897658 (electronic), 152724270022-2488 OR 00222488Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTJournal of Mathematical Physicsack-dshttp://jmp.aip.org/N. LevinsonThe {Weiner} {RMS} Error Criterion in Filter Design and Prediction @Article{Levinson:1947:WRE, author = "N. Levinson", title = "The {Weiner} {RMS} Error Criterion in Filter Design and Prediction", journal = 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 = "http://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.", } 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; http://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib; http://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib; http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib; http://www.math.utah.edu/pub/tex/bib/bstj1940.bib; http://www.math.utah.edu/pub/tex/bib/cryptography.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/mathcw.bib", note = "Reprinted in \cite{Slepian:1974:KPD}. From the first page: ``If the base $2$ is used the resulting units may be called binary digits, or more briefly, {\em bits}, a word suggested by J. W. Tukey.''. This is the first known printed instance of the word `bit' with the meaning of binary digit.", URL = "http://bstj.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,", } T e}. @Article{Albers:1996:ACA, author = "S. Albers and M. Mitzenmacher", title = "Average Case Analyses of List Update Algorithms, with Applications to Data Compression", journal = j-LECT-NOTES-COMP-SCI, volume = "1099", pages = "514--??", year = "1996", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat Dec 21 09:47:26 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", }׆M @Article{Alameldeen:2004:ACC, author = "Alaa R. Alameldeen and David A. Wood", title = "Adaptive Cache Compression for High-Performance Processors", journal = j-COMP-ARCH-NEWS, volume = "32", number = "2", pages = "212--212", month = mar, year = "2004", CODEN = "CANED2", ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)", ISSN-L = "0163-5964", bibdate = "Fri May 12 09:40:45 MDT 2006", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/sigarch.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", }]fM @Article{Al-Shammary:2012:RAS, author = "Dhiah Al-Shammary and Ibrahim Khalil", title = "Redundancy-aware {SOAP} messages compression and aggregation for enhanced performance", journal = j-J-NETW-COMPUT-APPL, volume = "35", number = "1", pages = "365--381", month = jan, year = "2012", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:44:09 MST 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib", URL = "http://www.sciencedirect.com/science/article/pii/S108480451100172X", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", }X1 @Article{Al-Hafeedh:2012:CIB, author = "Anisa Al-Hafeedh and Maxime Crochemore and Lucian Ilie and Evguenia Kopylova and W. F. Smyth and German Tischler and Munina Yusufu", title = "A comparison of index-based {Lempel--Ziv LZ77} factorization algorithms", journal = j-COMP-SURV, volume = "45", number = "1", pages = "5:1--5:??", month = nov, year = "2012", CODEN T*U @Article{Al-Bahadili:2008:NLD, author = "Hussein Al-Bahadili", title = "A novel lossless data compression scheme based on the error correcting {Hamming} codes", journal = j-COMPUT-MATH-APPL, volume = "56", number = "1", pages = "143--150", month = jul, year = "2008", CODEN = "CMAPDK", ISSN = "0898-1221 (print), 1873-7668 (electronic)", ISSN-L = "0898-1221", bibdate = "Wed Mar 1 21:50:12 MST 2017", bibsource = "http://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0898122107008334", acknowledgement = ack-nhfb, fjournal = "Computers and Mathematics with Applications", journal-URL = "http://www.sciencedirect.com/science/journal/08981221", } ##ZZ 3//Y17/!CG;IO/SY#-articledatacompression.bibShannon:1948:MTCaClaude E. ShannonA Mathematical Theory of Communicationj-BELL-SYST-TECH-J273379--423jul71948BSTJAN0005-8580 OR 0005858060.0X0026286 (10,133e)J. L. DoobTue Nov 9 11:15:54 MST 2010http://bstj.bell-labs.com/oldfiles/year.1948/BSTJ.1948.2703.html; http://www.alcatel-lucent.com/bstj/vol27-1948/bstj-vol27-issue03.html; http://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib; http://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib; http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib; http://www.math.utah.edu/pub/tex/bib/bstj1940.bib; http://www.math.utah.edu/pub/tex/bib/cryptography.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/mathcw.bib2010.11.09 11:15:54 MSTReprinted in cite Slepian:1974:KPD. From the first page: ``If the base $2$ is used the resulting units may be called binary digits, or more briefly, em bits, a word suggested by J. W. Tukey.''. This is the first known printed instance of the word `bit' with the meaning of binary digit.http://bstj.bell-labs.com/BSTJ/images/Vol27/bstj27-3-379.pdf; http://www.alcatel-lucent.com/bstj/vol27-1948/articles/bstj27-3-379.pdfThe Bell System Technical Journalack-dsClaude Elwood Shannon (April 30, 1916--February 24, 2001)http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/Claude E. ShannonReprinted in \cite{Slepian:1974:KPD}. From the first page: ``If the base $2$ is used the resulting units may be called binary digits, or more briefly, {\em bits}, a word suggested by J. W. Tukey.''. This is the first known printed instance of the word `bit' with the meaning of binary digit.A Mathematical Theory of Communication @Article{Shannon:1948:MTCa, author = "Claude E. Shannon", title = "A Mathematical Theory of Communication", journal = 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; http://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib; http://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib; http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib; http://www.math.utah.edu/pub/tex/bib/bstj1940.bib; http://www.math.utah.edu/pub/tex/bib/cryptography.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/mathcw.bib", note = "Reprinted in \cite{Slepian:1974:KPD}. From the first page: ``If the base $2$ is used the resulting units may be called binary digits, or more briefly, {\em bits}, a word suggested by J. W. Tukey.''. This is the first known printed instance of the word `bit' with the meaning of binary digit.", URL = "http://bstj.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,", }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; http://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib; http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib; http://www.math.utah.edu/pub/tex/bib/bstj1940.bib; http://www.math.utah.edu/pub/tex/bib/cryptography.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/mathcw.bib", note = "Reprinted in \cite{Slepian:1974:KPD}", URL = "http://bstj.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,", } X 3//q17/!CG;QO/Uqq"articledatacompression.bibShannon:1948:MTCbClaude E. ShannonA Mathematical Theory of Communication (continued)j-BELL-SYST-TECH-J274623--656oct101948BSTJAN0005-8580 OR 0005858060.0X0026286 (10,133e)J. L. DoobTue Nov 9 11:15:54 MST 2010http://bstj.bell-labs.com/oldfiles/year.1948/BSTJ.1948.2704.html; http://www.alcatel-lucent.com/bstj/vol27-1948/bstj-vol27-issue04.html; http://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib; http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib; http://www.math.utah.edu/pub/tex/bib/bstj1940.bib; http://www.math.utah.edu/pub/tex/bib/cryptography.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/mathcw.bib2010.11.09 11:15:54 MSTReprinted in cite Slepian:1974:KPDhttp://bstj.bell-labs.com/BSTJ/images/Vol27/bstj27-4-623.pdf; http://www.alcatel-lucent.com/bstj/vol27-1948/articles/bstj27-4-623.pdfThe Bell System Technical Journalack-dsClaude Elwood Shannon (April 30, 1916--February 24, 2001)http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/Claude E. ShannonReprinted in \cite{Slepian:1974:KPD}A Mathematical Theory of Communication (continued) @Article{Shannon:1948:MTCb, author = "Claude E. Shannon", title = "A Mathematical Theory of Communication (continued)", journal = 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; http://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib; http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib; http://www.math.utah.edu/pub/tex/bib/bstj1940.bib; http://www.math.utah.edu/pub/tex/bib/cryptography.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/mathcw.bib", note = "Reprinted in \cite{Slepian:1974:KPD}", URL = "http://bstj.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,", } dW '3)#+_1E};#mastersthesisdatacompression.bibKraft:1949:DQGL. G. KraftA Device for Quantizing, Grouping, and Coding Amplitude Modulated PulsesMaster's ThesisDepartment of Electrical Engineering, MITCambridge, MA, USA1949Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsL. G. KraftA Device for Quantizing, Grouping, and Coding Amplitude Modulated Pulses @MastersThesis{Kraft:1949:DQG, author = "L. G. Kraft", title = "A Device for Quantizing, Grouping, and Coding Amplitude Modulated Pulses", type = "{Master}'s Thesis", school = "Department of Electrical Engineering, MIT", address = "Cambridge, MA, USA", pages = "??", year = "1949", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = 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.", }U !3%!K-]1E};!Ktechreportdatacompression.bibFano:1949:TIR. M. FanoThe Transmission of InformationTechnical Report65Research Laboratory for Electronics, MITCambridge, MA, USA1949Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsR. M. FanoThe Transmission of Information @TechReport{Fano:1949:TI, author = "R. M. Fano", title = "The Transmission of Information", type = "Technical Report", number = "65", institution = "Research Laboratory for Electronics, MIT", address = "Cambridge, MA, USA", pages = "??", year = "1949", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, rawdata = "Fano, R. M. (1949) ``The Transmission of Information,'' Research Laboratory for Electronics, MIT, Tech Rep. No. 65.", }.3001.html; http://www.alcatel-lucent.com/bstj/vol30-1951/bstj-vol30-issue01.html; http://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib; http://www.math.utah.edu/pub/tex/bib/bstj1950.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Reprinted in \cite{Slepian:1974:KPD}.", URL = "http://bstj.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", } uuZ 3-/_17E;S!O!/WcAarticledatacompression.bibShannon:1951:PEPClaude E. ShannonPrediction and Entropy of Printed Englishj-BELL-SYST-TECH-J30150--64jan11951BSTJAN0005-8580 OR 00058580Sat Jan 26 12:46:16 MST 2013http://bstj.bell-labs.com/oldfiles/year.1951/BSTJ.1951.3001.html; http://www.alcatel-lucent.com/bstj/vol30-1951/bstj-vol30-issue01.html; http://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib; http://www.math.utah.edu/pub/tex/bib/bstj1950.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTReprinted in cite Slepian:1974:KPD.http://bstj.bell-labs.com/BSTJ/images/Vol30/bstj30-1-50.pdf; http://www.alcatel-lucent.com/bstj/vol30-1951/articles/bstj30-1-50.pdfA new method of estimating the entropy and redundancy of a language is described. This method exploits the knowledge of the language statistics possessed by those who speak the language, and depends on experimental results in prediction of the next letter when the preceding text is known. Results of experiments in prediction are given, and some properties of an ideal predictor are developed.The Bell System Technical Journalack-dsClaude Elwood Shannon (April 30, 1916--February 24, 2001)http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/A new method of estimating the entropy and redundancy of a language is described. This method exploits the knowledge of the language statistics possessed by those who speak the language, and depends on experimental results in prediction of the next letter when the preceding text is known. Results of experiments in prediction are given, and some properties of an ideal predictor are developed.Claude E. ShannonReprinted in \cite{Slepian:1974:KPD}.Prediction and Entropy of Printed {English} @Article{Shannon:1951:PEP, author = "Claude E. Shannon", title = "Prediction and Entropy of Printed {English}", journal = j-BELL-SYST-TECH-J, volume = "30", number = "1", pages = "50--64", month = jan, year = "1951", CODEN = "BSTJAN", 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; http://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib; http://www.math.utah.edu/pub/tex/bib/bstj1950.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Reprinted in \cite{Slepian:1974:KPD}.", URL = "http://bstj.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", } >V 3-!e97E};Y!earticledatacompression.bibChomsky:1956:TMDN. ChomskyThree Models for the Description of Languagej-IRE-TRANS-INF-THEORY23113--1241956IRITAY0096-1000 OR 00961000Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIRE Transactions on Information Theoryack-dshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4547527N. ChomskyThree Models for the Description of Language @Article{Chomsky:1956:TMD, author = "N. Chomsky", title = "Three Models for the Description of Language", journal = j-IRE-TRANS-INF-THEORY, volume = "2", number = "3", pages = "113--124", year = "1956", CODEN = "IRITAY", ISSN = "0096-1000", ISSN-L = "", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }U 3'!=E};K!K=)miscdatacompression.bibGray:1953:PCCFrank GrayPulse Code Communication17mar31953Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTUnited States Patent 2,632,058.ack-dsFrank GrayUnited States Patent 2,632,058.Pulse Code Communication @Misc{Gray:1953:PCC, author = "Frank Gray", title = "Pulse Code Communication", pages = "??", day = "17", month = mar, year = "1953", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "United States Patent 2,632,058.", acknowledgement = ack-ds, rawdata = "Gray, Frank (1953) ``Pulse Code Communication,'' United States Patent 2,632,058, March 17.", }~V 3-'!!7E};k'Iarticledatacompression.bibHuffman:1952:MCMDavid HuffmanA Method for the Construction of Minimum Redundancy Codesj-PROC-IRE4091098--11011952PIREAE0096-8390 OR 00968390Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTProceedings of the Institute of Radio Engineersack-dshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10933David HuffmanA Method for the Construction of Minimum Redundancy Codes @Article{Huffman:1952:MCM, author = "David Huffman", title = "A Method for the Construction of Minimum Redundancy Codes", journal = j-PROC-IRE, volume = "40", number = "9", pages = "1098--1101", year = "1952", CODEN = "PIREAE", ISSN = "0096-8390", ISSN-L = "", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", } T ev%K @Article{Crocker:1995:PPN, author = "Lee Daniel Crocker", title = "{PNG}: The {Portable Network Graphic} Format", journal = j-DDJ, volume = "20", number = "7", pages = "36, 38, 40, 42, 44", month = jul, year = "1995", CODEN = "DDJOEB", ISSN = "1044-789X", ISSN-L = "", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "Compendex database; http://www.ddj.cUP! @Article{Crochemore:2014:NGP, author = "Maxime Crochemore and Alessio Langiu and Filippo Mignosi", title = "Note on the greedy parsing optimality for dictionary-based text compression", journal = j-THEOR-COMP-SCI, volume = "525", number = "??", pages = "55--59", day = "13", month = mar, year = "2014", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Mar 8 16:44:06 MST 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/tcs2010.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0304397514000309", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } "3 @Article{Crochemore:2000:DCU, author = "Maxime Crochemore and Filippo Mignosi and Antonio Restivo and Sergio Salemi", title = "Data Compression Using Antidictionaries", journal = j-PROC-IEEE, volume = "88", number = "11", pages = "1756--1768", year = "2000", CODEN = "IEEPAD", ISSN = "0018-9219 (print), 1558-2256 (electronic)", ISSN-L = "0018-9219", bibdate = "Sat Jan 26 1ԋN @Article{Crochemore:1996:PMT, author = "Maxime Crochemore and Thierry Lecroq", title = "Pattern-matching and text-compression algorithms", journal = j-COMP-SURV, volume = "28", number = "1", pages = "39--41", month = mar, year = "1996", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/234313.234331", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", ؖS' @Article{Cressman:1994:ADC, author = "David C. Cressman", title = "Analysis of Data Compression in the {DLT2000} Tape Drive", journal = j-DEC-TECH-J, volume = "6", number = "2", pages = "62--71", month = "Spring", year = "1994", CODEN = "DTJOEL", ISSN = "0898-901X", bibdate = "Thu Mar 20 18:15:43 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompr*U @Article{Craft:1998:FHD, author = "D. J. Craft", title = "A fast hardware data compression algorithm and some algorithmic extensions", journal = j-IBM-JRD, volume = "42", number = "6", pages = "733--745", month = "????", year = "1998", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Mon Feb 12 08:11:29 2001", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; http://www.research.ibm.com/journal/", URL = "http://www.almaden.ibm.com/journal/rd/426/craft.html", acknowledgement = ack-nhfb, fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", }1 u)Z 3+);57E;);Uarticledatacompression.bibGivens:1958:CPUWallace GivensComputation of Plane Unitary Rotations Transforming a General Matrix to Triangular Formj-J-SIAM6126--50mar31958JSIMAV0368-4245 (print), 1095-712X (electronic) OR 03684245 (print), 1095712X (electronic)0368-4245 OR 03684245Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/siam.bib; JSTOR database2013.01.26 12:46:16 MSTJournal of the Society for Industrial and Applied Mathematicsack-dsWallace GivensComputation of Plane Unitary Rotations Transforming a General Matrix to Triangular Form @Article{Givens:1958:CPU, author = "Wallace Givens", title = "Computation of Plane Unitary Rotations Transforming a General Matrix to Triangular Form", journal = j-J-SIAM, volume = "6", number = "1", pages = "26--50", month = mar, year = "1958", CODEN = "JSIMAV", ISSN = "0368-4245 (print), 1095-712X (electronic)", ISSN-L = "0368-4245", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://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.", }V 3//q;57E};[/q+articledatacompression.bibMcMillan:1956:TIIBrockway McMillanTwo Inequalities Implied by Unique Decipherabilityj-IEEE-TRANS-INF-THEORY24115--116dec121956IETTAW0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsBrockway McMillanTwo Inequalities Implied by Unique Decipherability @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", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://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.", } MfM @Article{Ferguson:1984:SSH, author = "T. J. Ferguson and J. H. Rabinowitz", title = "Self-Synchronizing {Huffman} @Article{Duvanenko:1988:ICC, author = "Victor J. Duvanenko^= @Article{Ebrahimi:2016:JPT, author = "Touradj Ebrahimi and Siegfried Foessel and Fernando Pereira and Peter Schelkens", title = "{JPEG Pleno}: Toward an Efficient Representation of Visual Reality", journal = j-IEEE-MULTIMEDIA, volume = "23", number = "4", pages = "14--20", month = oct # "\slash " # dec, year = "2016", CODEN = "IEMUE4", ISSN = "1070-986X (print), 1941*U @Article{Dutta:2017:EFC, author = "Tanima Dutta and Hari Prabhat Gupta", title = "An Efficient Framework for Compressed Domain Watermarking in {$P$} Frames of High-Efficiency Video Coding ({HEVC})-Encoded Video", journal = j-TOMCCAP, volume = "13", number = "1", pages = "12:1--12:??", month = jan, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3zu @Article{Ebrahim:2016:MIB, author = "Mansoor Ebrahim and Wai Chong Chia", title = "Multiview Image Block Compressive Sensing with Joint Multiphase Decoding for Visual Sensor Network", journal = j-TOMCCAP, volume = "12", number = "2", pages = "30:1--30:??", month = mar, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2818712", ISSN = "1551-6857 (print), @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; http://www.math.utah.edu/Xsi @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 = "", ISSN = "0373-1138", ISSN-L = "", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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", }1c @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", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Feb 04 16:48:13 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib", note = "See \cite{Peterson:1980:CPD,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } zsX3-GM173%Eu;+OG+MA#articledatacompression.bibGilbert:1959:VLBE. N. Gilbert and E. F. MooreVariable Length Binary Encodingsj-BELL-SYST-TECH-J384933--967jul71959BSTJAN0005-8580 OR 0005858094.000108413 (21 \#7129)S. W. GolombSat Jan 26 12:46:16 MST 2013http://bstj.bell-labs.com/oldfiles/year.1959/BSTJ.1959.3804.html; http://www.alcatel-lucent.com/bstj/vol38-1959/bstj-vol38-issue04.html; http://www.math.utah.edu/pub/tex/bib/bstj1950.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTMonograph 3515.http://bstj.bell-labs.com/BSTJ/images/Vol38/bstj38-4-933.pdf; http://www.alcatel-lucent.com/bstj/vol38-1959/articles/bstj38-4-933.pdfThe Bell System Technical Journalack-dshttp://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/E. N. Gilbert and E. F. MooreMonograph 3515.Variable Length Binary Encodings @Article{Gilbert:1959:VLB, author = "E. N. Gilbert and E. F. Moore", title = "Variable Length Binary Encodings", journal = j-BELL-SYST-TECH-J, volume = "38", number = "4", pages = "933--967", month = jul, year = "1959", CODEN = "BSTJAN", 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; http://www.math.utah.edu/pub/tex/bib/bstj1950.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Monograph 3515.", URL = "http://bstj.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.", }V 3){;57E};[{7articledatacompression.bibCapon:1959:PMRJ. CaponA Probabilistic Model for Run-length Coding of Picturesj-IEEE-TRANS-INF-THEORY54157--163dec121959IETTAW0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsJ. CaponA Probabilistic Model for Run-length Coding of Pictures @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", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }at 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; http://www.math.utah.edu/pub/tex/bib/bstj1950.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Monograph 3515.", URL = "http://bstj.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.", } V 3%O97E};YOSarticledatacompression.bibMax:1960:QMDJoel MaxQuantizing for minimum distortionj-IRE-TRANS-INF-THEORYIT-67--12mar31960IRITAY0096-1000 OR 00961000Sat Jan 26 12:46:12 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:12 MSTIRE Transactions on Information Theoryack-dshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4547527Joel MaxQuantizing for minimum distortion @Article{Max:1960:QMD, author = "Joel Max", title = "Quantizing for minimum distortion", journal = j-IRE-TRANS-INF-THEORY, volume = "IT-6", pages = "7--12", month = mar, year = "1960", CODEN = "IRITAY", ISSN = "0096-1000", ISSN-L = "", bibdate = "Sat Jan 26 12:46:12 MST 2013", bibsource = "http://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.", }PV 3+O97E};UOiparticledatacompression.bibDurbin:1960:FTSJ. DurbinThe Fitting of Time-Series Modelsj-REV-INST-INT-STATIST28233--34419600373-1138 OR 03731138Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTRevue de l'Institut international de statistique = Review of the International Statistical Instituteack-dsJ. DurbinThe Fitting of Time-Series Models @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 = "", ISSN = "0373-1138", ISSN-L = "", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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", } )S @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 = ŅlY @Article{Isenburg:2001:TSC, author = "Martin Isenburg", title = "Triangle Strip Compression", journal = j-CGF, volume = "20", number = "2", pages = "??--??", month = jun, year = "2001", CODEN = "CGFODY", ISSN = "0167-7055 (print), 1467-8659 (electronic)", ISSN-L = "0167-7055", bibdate = "Thu Feb 21 09:14:37 2002", bibsource = "http://www.blackwellpublishing.com/journal.asp?ref=0167-7055; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "Com{\-}pu{\-}ter Graphics Forum", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/", }S' @Article{Inoue:2011:TCD, author = "Hiroaki Inoue and Junya Yamada and Hideyuki Yoneda and Katsumi Togawa and Masato Motomura and Koichiro Furuta", title = "Test compression for dynamically reconfigurable processors", journal = j-TRETS, volume = "4", number = "4", pages = "40:1--40:??", month = dec, year = "2011", CODEN = "????", DOI = "https:/ 3 @Article{Imaizumi:2012:KDS, author = "Shoko Imaizumi and Masaaki Fujiyoshi and Hitoshi Kiya", title = "A Key Derivation Scheme for Hierarchical Access Control to {JPEG} 2000 Coded Images", journal = j-LECT-NOTES-COMP-SCI, volume = "7088", pages = "180--191", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-25346-1_17", ISSN = "0302-9743 (prin ~0a @Article{Ilie:2006:SCS, author = "Lucian Ilie and Cristian Popescu", title = "The Shortest Common Superstring Problem and Viral Genome Compression", journal = j-FUND-INFO, volume = "73", number = "1--2", pages = "153--164", month = oct, year = "2006", CODEN = "FUMAAJ", ISSN = "0169-2968 (print), 1875-8681 (electronic)", ISSN-L = "0169-2968", bibdate = "Sat Mar 5 17:04:36 MST 2016", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib", acknowledgement = ack-nhfb, fjournal = "Fundamenta Informaticae", journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae", } Æ) @Article{Ignatchenko:1998:AOD, author = "Sergey Ignatchenko", title = "An Algorithm for Online Data Compression", journal = j-CCCUJ, volume = "16", number = "10", pages = "63--??", month = oct, year = "1998", CODEN = "CCUJEX", ISSN = "1075-2838", bibdate = "Tue May 14 18:09:17 MDT 2002", bibsource = "http://www.cuj.com/articles/1998/9810/9810toc.htm?topic=articles; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", abstract = "Compressing data on the fly involves different tradeoffs than when you have all the time and space in the world.", acknowledgement = ack-nhfb, fjournal = "C/C++ Users Journal", }W 26 12:46:16 MST 2013", bibsource = "http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219197", acknowledgement = 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.", } U 3-1a/E};1a'bookdatacompression.bibKendall:1961:CGDMaurice G. KendallA Course in the Geometry of $n$-DimensionsHafnerNew York, NY, USA1961Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsMaurice G. KendallA Course in the Geometry of $n$-Dimensions @Book{Kendall:1961:CGD, author = "Maurice G. Kendall", title = "A Course in the Geometry of $n$-Dimensions", publisher = "Hafner", address = "New York, NY, USA", pages = "??", year = "1961", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, rawdata = "Kendall, Maurice G. (1961) {\it A Course in the Geometry of n-Dimensions}, New York, Hafner.", }jW 3'!#E};;!articledatacompression.bibKarp:1961:MRCR. S. KarpMinimum-Redundancy Coding for the Discrete Noiseless Channelj-TRANS-IRE727--381961Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTTransactions of the IREack-dsR. S. KarpMinimum-Redundancy Coding for the Discrete Noiseless Channel @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 = "", ISSN = "", ISSN-L = "", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }W 3-+w;]7E+;]+w? articledatacompression.bibFreeman:1961:EAGHerbert FreemanOn the Encoding of Arbitrary Geometric Configurationsj-IRE-TRANS-ELEC-COMPUTEC-102260--268jun61961IRELAOhttps://doi.org/10.1109/TEC.1961.52191970367-9950 OR 03679950Sat Jan 26 12:46:16 MST 2013http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib2013.01.26 12:46:16 MSThttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219197IRE Transactions on Electronic Computersack-dsHerbert FreemanOn the Encoding of Arbitrary Geometric Configurations @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 = "http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219197", acknowledgement = 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.", } 2013", bibsource = "fsz3950.oclc.org:210/WorldCat; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib", note = "Translation by Halina Moss. Reprinted in \cite{Vorobev:1983:FN}.", series = "Popular lectures in mathematics series", acknowledgement = 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", } M5V 3/1A%W5C7;e91A phdthesisdatacompression.bibDavisson:1964:TDCLee David DavissonTheory of Data CompressionPh.D. thesisUniversity of California, Los AngelesLos Angeles, CA, USA461964Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302143966Electrical engineeringack-nhfbLee David DavissonTheory of Data Compression @PhdThesis{Davisson:1964:TDC, author = "Lee David Davisson", title = "Theory of Data Compression", type = "{Ph.D.} thesis", school = "University of California, Los Angeles", address = "Los Angeles, CA, USA", pages = "46", year = "1964", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302143966", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "6502683", subject = "Electrical engineering", }XU 3/#G+3E};#Gubookdatacompression.bibAbramson:1963:ITCN. AbramsonInformation Theory and Codingpub-MCGRAW-HILLpub-MCGRAW-HILL:adr1963Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsN. AbramsonInformation Theory and Coding @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 = "http://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.", }UX %3+15//)!CQ-E!; Y135 3MJincollectiondatacompression.bibVorobev:1961:FNNikolai N. VorobevIan Naismith SneddonFibonacci NumbersFibonacci Numbers2Pergamon PressOxford, UKviii + 6619610-932750-03-6 OR 0932750036978-0-932750-03-7 OR 9780932750037QA241 .V613 1961Mon Jan 28 18:47:14 MST 2013fsz3950.oclc.org:210/WorldCat; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib2013.01.28 18:47:14 MSTTranslation by Halina Moss. Reprinted in cite Vorobev:1983:FN.Popular lectures in mathematics seriesack-dsNikolai N. Vorobev{Fibonacci} NumbersIan Naismith SneddonTranslation by Halina Moss. Reprinted in \cite{Vorobev:1983:FN}.{Fibonacci} Numbers @InCollection{Vorobev:1961:FN, author = "Nikolai N. Vorobev", editor = "Ian Naismith Sneddon", booktitle = "{Fibonacci} Numbers", title = "{Fibonacci} Numbers", volume = "2", publisher = "Pergamon Press", address = "Oxford, UK", pages = "viii + 66", year = "1961", ISBN = "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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib", note = "Translation by Halina Moss. Reprinted in \cite{Vorobev:1983:FN}.", series = "Popular lectures in mathematics series", acknowledgement = 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", } "Wed Jan 25 08:05:37 MST 2012", bibsource = "http://www.jstor.org/journals/01621459.html; http://www.jstor.org/stable/i314190; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib", note = "See corrigenda \cite{Eisenberger:1967:CSS}.", URL = "http://www.jstor.org/stable/2283140", acknowledgement = ack-nhfb, fjournal = "Journal of the American Statistical Association", journal-URL = "http://www.tandfonline.com/loi/uasa20", } @Article{Bell:1994:RBG, author = "Timothy C. Bell and Ian H. Witten", title = "The Relationship between Greedy Parsing and Symbolwise Text Compression", journal = j-J-ACM, volume = "41", number = "4", pages = "708--724", month = jul, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23ӈ+W @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/(Ss$I @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", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://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", }Yys @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", MR} @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 = z!C @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", ISSN = "0090-6778 (print), 1558-0857 (electronic)", ISSN-L = "0090-6778", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", } Ua E @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)+W @Article{Al-Bahadili:2008:ACW, author = "Hussein Al-Bahadili and Shakir M. Hussain", title = "An adaptive character wordlength algorithm for data compression", journal = j-COMPUT-MATH-APPL, volume = "55", number = "6", pages = "1250--1256", month = mar, year = "2008", CODEN = "CMAPDK", ISSN = "0898-1221 (print), 1873-7668 (electronic)", ISSN-L = "0898-1221", bibdate = "Wed Mar 1 21:50:10 MST 2017", bibsource = "http://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0898122107005925", acknowledgement = ack-nhfb, fjournal = "Computers and Mathematics with Applications", journal-URL = "http://www.sciencedirect.com/science/journal/08981221", } O @Article{Acharya:1996:LVL, author = "Tinku Acharya and Joseph F. J{\'a}J{\'a}", title = "An On-Line Variable Length Binary Encoding of Text", journal = j-INFO-SCI, volume = "94", pages = "1--22", year = "1996", CODEN = "ISIJBC", ISSN = "0020-0255 (print), 1872-6291 (electronic)", ISSN-L = "0020-0255", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, fjournal = "Information Sciences", rawdata = "Acharya, Tinku and Joseph F. J\'aJ\'a (1996) ``An On-Line Variable Length Binary Encoding of Text,'' {\it Information and Computer Science}, {\bf94}:1--22.", xxjournal = "Information and Computer Science", }dzu @Article{Anonymous:1995:WCM, author = "Anonymous", title = "Wavelets Challenge {MPEG}@ @Article{Albers:1998:ACA, author = "Susanne Albers and Michael Mitzenmacher", title = "Average Case Analyses of List Update Algorithms, with Applications to Data Compression", journal = j-ALGORITHMICA, volume = "21", number = "3", pages = "312--329", month = jul, year = "1998", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", f7o @Article{Anagnostopoulos:2014:APC, author = "Christos Anagnostopoulos and Stathes Hadjiefthymiades", title = "Advanced Principal Component-Based Compression Schemes for Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "1", pages = "7:1--7:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2629330", ISSN = @ @Article{Albers:1998:ACA, author = "Susanne Albers and Michael Mitzenmacher", title = "Average Case Analyses of List Update Algorithms, with Applications to Data Compression", journal = j-ALGORITHMICA, volume = "21", number = "3", pages = "312--329", month = jul, year = "1998", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", ' @(Q @Article{Babu:2001:SMBb, author = "Shivnath Babu and Minos Garofalakis and Rajeev Rastogi", title = "{SPARTAN}: a model-based semantic compression system for massive data tables", journal = j-SIGMOD, volume = "30", number = "2", pages = "283--294", month = jun, year = "2001", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", ISSN-L = "0163-5808", bibdate = "Mon Jan 12 08:46:06 MST 2004", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/sigmod.bib", acknowledgement = ack-nhfb, fjournal = "SIGMOD Record (ACM Special Interest Group on Management of Data)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J689", } ^m[ @Article{Balster:2011:PCR, author = "Eric J. Balster and Benjamin T. Fortener and William F. Turri", title = "Post-Compression Rate-Distortion Development for Embedded Block Coding with Optimal Truncation in {JPEG2000} Imagery", journal = j-INT-J-IMAGE-GRAPHICS, volume = "11", number = "4", pages = "611--627", month = oct, year = "2011", CODEN = "????", @Article{Bakulina:2007:AZL, author = "M. P. Bakulina", title = "Application of {Zipf}'s law for text compression", journal = "Diskretn. Anal. Issled. Oper. Ser. 2", volume = "14", number = "2", pages = "3--13", year = "2007", CODEN = "????", ISSN = "1560-9901", MRclass = "94A15", MRnumber = "2542308 (2010i:94076)", MRreviewer = "I. Vajda", bibdate = "Sat Nov 12 09:13:23 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/benfords-law.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "Diskretny{\u\i} Analiz i Issledovanie Operatsi{\u\i}. Seriya 2", } "P! @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", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }Szu @Article{Anonymous:1995:WCM, author = "Anonymous", title = "Wavelets Challenge {MPEG}, Fractals --- Developers claim {300-to-1} compression", journal = j-BYTE, volume = "20", number = "12", pages = "34--??", month = dec, year = "1995", CODEN = "BYTEDJ", ISSN = "0360-5280 (print), 1082-7838 (electronic)", ISSN-L = "0360-5280", bibdate = "Mon Aug 19 08:30:25 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "BYTE Magazine", }* i Y35]/57E;_SkW]cg%articledatacompression.bibEisenberger:1965:SSUIsidore Eisenberger and Edward C. PosnerSystematic Statistics Used for Data Compression in Space Telemetryj-J-AM-STAT-ASSOC6030997--133mar31965JSTNAL0162-1459 (print), 1537-274X (electronic) OR 01621459 (print), 1537274X (electronic)0162-1459 OR 01621459Wed Jan 25 08:05:37 MST 2012http://www.jstor.org/journals/01621459.html; http://www.jstor.org/stable/i314190; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib2012.01.25 08:05:37 MSTSee corrigenda cite Eisenberger:1967:CSS.http://www.jstor.org/stable/2283140Journal of the American Statistical Associationack-nhfbhttp://www.tandfonline.com/loi/uasa20Isidore Eisenberger and Edward C. PosnerSee corrigenda \cite{Eisenberger:1967:CSS}.Systematic Statistics Used for Data Compression in Space Telemetry @Article{Eisenberger:1965:SSU, author = "Isidore Eisenberger and Edward C. Posner", title = "Systematic Statistics Used for Data Compression in Space Telemetry", journal = j-J-AM-STAT-ASSOC, volume = "60", number = "309", pages = "97--133", month = mar, year = "1965", CODEN = "JSTNAL", 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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib", note = "See corrigenda \cite{Eisenberger:1967:CSS}.", URL = "http://www.jstor.org/stable/2283140", acknowledgement = ack-nhfb, fjournal = "Journal of the American Statistical Association", journal-URL = "http://www.tandfonline.com/loi/uasa20", }5411", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib; http://www.math.utah.edu/pub/tex/bib/prng.bib", abstract = "The use of Turing machines for calculating finite binary sequences is studied from the point of view of information theory and the theory of recursive functions. Various results are obtained concerning the number of:instructions ia programs. A modified form of Turing machine is studied from the same point of view. Aa application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed.", acknowledgement = 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.", }! h![ 3-1W57Ei;oqeo1aarticledatacompression.bibChaitin:1966:LPCGregory J. ChaitinOn the Length of Programs for Computing Finite Binary Sequencesj-J-ACM134547--569oct101966JACOAHhttps://doi.org/10.1145/321356.3213630004-5411 (print), 1557-735X (electronic) OR 00045411 (print), 1557735X (electronic)0004-5411 OR 00045411Sat Jan 26 12:46:16 MST 2013http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib; http://www.math.utah.edu/pub/tex/bib/prng.bib2013.01.26 12:46:16 MSTThe use of Turing machines for calculating finite binary sequences is studied from the point of view of information theory and the theory of recursive functions. Various results are obtained concerning the number of:instructions ia programs. A modified form of Turing machine is studied from the same point of view. Aa application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed.Journal of the Association for Computing Machineryack-dshttp://portal.acm.org/browse_dl.cfm?idx=J401The use of Turing machines for calculating finite binary sequences is studied from the point of view of information theory and the theory of recursive functions. Various results are obtained concerning the number of:instructions ia programs. A modified form of Turing machine is studied from the same point of view. Aa application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed.Gregory J. ChaitinOn the Length of Programs for Computing Finite Binary Sequences @Article{Chaitin:1966:LPC, author = "Gregory J. Chaitin", title = "On the Length of Programs for Computing Finite Binary Sequences", journal = 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 = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib; http://www.math.utah.edu/pub/tex/bib/prng.bib", abstract = "The use of Turing machines for calculating finite binary sequences is studied from the point of view of information theory and the theory of recursive functions. Various results are obtained concerning the number of:instructions ia programs. A modified form of Turing machine is studied from the same point of view. Aa application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed.", acknowledgement = 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.", } At$V 3+/5;57E};[/5articledatacompression.bibGolomb:1966:RLESolomon W. GolombRun-Length Encodingsj-IEEE-TRANS-INF-THEORYIT-123399--4011966IETTAW0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsSolomon W. GolombRun-Length Encodings @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", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }@#U 3'a#7E};5uIarticledatacompression.bibFang:1966:IIEI. FangIt Isn't ETAOIN SHRDLU; It's ETAONI RSHDLCj-JOURNAL-Q43761--7621966JOQUAX0196-3031 OR 01963031Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTJournalism Quarterlyack-dsI. FangIt Isn't {ETAOIN} {SHRDLU}; {It}'s {ETAONI} {RSHDLC} @Article{Fang:1966:IIE, author = "I. Fang", title = "It Isn't {ETAOIN} {SHRDLU}; {It}'s {ETAONI} {RSHDLC}", journal = j-JOURNAL-Q, volume = "43", pages = "761--762", year = "1966", CODEN = "JOQUAX", ISSN = "0196-3031", ISSN-L = "", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }<"V 3/){#57E};;){[articledatacompression.bibDavisson:1966:CSTI. D. DavissonComments on `Sequence Time Coding for Data Compression'j-PROC-IEEE542010dec121966IEEPAD0018-9219 (print), 1558-2256 (electronic) OR 00189219 (print), 15582256 (electronic)0018-9219 OR 00189219Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTProceedings of the IEEEack-dshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5I. D. DavissonComments on `Sequence Time Coding for Data Compression' @Article{Davisson:1966:CST, author = "I. D. Davisson", title = "Comments on `Sequence Time Coding for Data Compression'", journal = j-PROC-IEEE, volume = "54", pages = "2010", month = dec, year = "1966", CODEN = "IEEPAD", ISSN = "0018-9219 (print), 1558-2256 (electronic)", ISSN-L = "0018-9219", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", } DD o C @Article{Kida:1999:SAP, author = "Takuya Kida and Masayuki Takeda and Ayumi Shinohara and Setsuo Arikawa", title = "Shift-And Approach to Pattern Matching in {LZW} Compressed Text", journal = j-LECT-NOTES-COMP-SCI, volume = "1645", pages = "1--??", year = "1999", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Feb 5 11:54:24 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1645.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1645/16450001.htm; http://link.springer-ny.com/link/service/series/0558/papers/1645/16450001.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", }0a @Article{Kientzle:1999:AAI, author = "Tim Kientzle", title = "Algorithm Alley: Implementing Fast {DCTs}", journal = j-DDJ, volume = "24", number = "3", pages = "115--119", month = mar, year = "1999", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Feb 2 06:29:28 MST 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://www.ddj.cw @Article{Kinsman:2011:TOT, author = "Adam B. Kinsman and Nicola Nicolici", title = "Trade-Offs in Test Data Compression and Deterministic {X}-Masking of Responses", journal = j-IEEE-TRANS-COMPUT, volume = "60", number = "4", pages = "498--507", month = apr, year = "2011", CODEN = "ITCOB4", DOI = ={ @Article{Kim:2016:BPC, author = "Jungrae Kim and Michael Sullivan and Esha Choukse and Mattan Erez", title = "Bit-plane compression: transforming data for better compression in many-core architectures", journal = j-COMP-ARCH-NEWS, volume = "44", number = "3", pages = "329--340", month = jun, year = "2016", CODEN = "CANED2", DOI = "https://doi.org/10.1145/30077 @Article{Kim:2006:GCD, author = "Junho Kim and Sungyul Choe and Seungyong Lee", title = "Geometry Compression and Decompression: Multiresolution Random Accessible Mesh Compression", journal = j-CGF, volume = "25", number = "3", pages = "323--331", month = sep, year = "2006", CODEN = "CGFODY", DOI = "https://doi.org/10.1111/j.1467-8659.2006.00951.x", ISSN = "0167-7055. @Article{Kim:2001:SPM, author = "Wonkoo Kim and Ching-Chung Li", title = "A Study on Preconditioning Multiwavelet Systems for Image Compression", journal = j-LECT-NOTES-COMP-SCI, volume = "2251", pages = "22--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat Feb 2 13:07:36 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2251.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2251/22510022.htm; http://link.springer-ny.com/link/service/series/0558/papers/2251/22510022.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } p ps&V 3)#_#!57E};;#_articledatacompression.bibLynch:1966:STCT. J. LynchSequence Time Coding for Data Compressionj-PROC-IEEE541490--1491oct101966IEEPAD0018-9219 (print), 1558-2256 (electronic) OR 00189219 (print), 15582256 (electronic)0018-9219 OR 00189219Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTProceedings of the IEEEack-dshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5T. J. LynchSequence Time Coding for Data Compression @Article{Lynch:1966:STC, author = "T. J. Lynch", title = "Sequence Time Coding for Data Compression", journal = j-PROC-IEEE, volume = "54", pages = "1490--1491", month = oct, year = "1966", CODEN = "IEEPAD", ISSN = "0018-9219 (print), 1558-2256 (electronic)", ISSN-L = "0018-9219", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }%X 3)3 %97C7;e93 Uphdthesisdatacompression.bibLynch:1966:DCEThomas Joseph LynchData Compression with Error-Control Coding for Space TelemetryPh.D. thesisUniversity of MarylandCollege Park, MD, USA1301966Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/302201464Electrical engineeringack-nhfbThomas Joseph LynchData Compression with Error-Control Coding for Space Telemetry @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/; http://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", }9", bibdate = "Wed Jan 25 08:05:39 MST 2012", bibsource = "http://www.jstor.org/journals/01621459.html; http://www.jstor.org/stable/i314202; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib", note = "See \cite{Eisenberger:1965:SSU}.", URL = "http://www.jstor.org/stable/2283812", acknowledgement = ack-nhfb, fjournal = "Journal of the American Statistical Association", journal-URL = "http://www.tandfonline.com/loi/uasa20", }' r'Y 35])/!57E;ISkW]M)oarticledatacompression.bibEisenberger:1967:CSSIsidore Eisenberger and Edward C. PosnerCorrigenda: Systematic Statistics used for Data Compression in Space Telemetryj-J-AM-STAT-ASSOC623201518--1518dec121967JSTNAL0162-1459 (print), 1537-274X (electronic) OR 01621459 (print), 1537274X (electronic)0162-1459 OR 01621459Wed Jan 25 08:05:39 MST 2012http://www.jstor.org/journals/01621459.html; http://www.jstor.org/stable/i314202; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib2012.01.25 08:05:39 MSTSee cite Eisenberger:1965:SSU.http://www.jstor.org/stable/2283812Journal of the American Statistical Associationack-nhfbhttp://www.tandfonline.com/loi/uasa20Isidore Eisenberger and Edward C. PosnerSee \cite{Eisenberger:1965:SSU}.Corrigenda: Systematic Statistics used for Data Compression in Space Telemetry @Article{Eisenberger:1967:CSS, author = "Isidore Eisenberger and Edward C. Posner", title = "Corrigenda: Systematic Statistics used for Data Compression in Space Telemetry", journal = j-J-AM-STAT-ASSOC, volume = "62", number = "320", pages = "1518--1518", month = dec, year = "1967", CODEN = "JSTNAL", 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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib", note = "See \cite{Eisenberger:1965:SSU}.", URL = "http://www.jstor.org/stable/2283812", acknowledgement = ack-nhfb, fjournal = "Journal of the American Statistical Association", journal-URL = "http://www.tandfonline.com/loi/uasa20", }8 MST 2012", bibsource = "http://comjnl.oxfordjournals.org/content/10/2.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1960.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/", URL = "http://comjnl.oxfordjournals.org/content/10/2/165.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/100165.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/165.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/166.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/167.tif", acknowledgement = ack-nhfb, fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", }( )[3+QA57EC;/k?ckQ/AYarticledatacompression.bibMarron:1967:ADCB. A. Marron and P. A. D. de MaineAutomatic Data Compressionj-CACM1011711--715nov111967CACMA20001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 00010782Fri Nov 25 18:20:16 MST 2005ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; h6:(X 3+%a[57C+;y5O%a[articledatacompression.bibFraser:1967:DCAA. G. FraserData Compression and Automatic Programmingj-COMP-J102165--167aug81967CMPJA6https://doi.org/10.1093/comjnl/10.2.1650010-4620 (print), 1460-2067 (electronic) OR 00104620 (print), 14602067 (electronic)0010-4620 OR 00104620Tue Dec 4 14:47:38 MST 2012http://comjnl.oxfordjournals.org/content/10/2.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1960.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/2012.12.04 14:47:38 MSThttp://comjnl.oxfordjournals.org/content/10/2/165.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/100165.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/165.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/166.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/167.tifThe Computer Journalack-nhfbhttp://comjnl.oxfordjournals.org/A. G. FraserData Compression and Automatic Programming @Article{Fraser:1967:DCA, author = "A. G. Fraser", title = "Data Compression and Automatic Programming", journal = 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; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1960.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/", URL = "http://comjnl.oxfordjournals.org/content/10/2/165.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/100165.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/165.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/166.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/167.tif", acknowledgement = ack-nhfb, fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", }b/bibliography/Database/Wiederhold.bib; http://www.acm.org/pubs/contents/journals/cacm/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Also published in/as: File Organization, Siwerts and Zeitlinge (Amsterdam), 1969.", abstract = "The ``information explosion'' noted in recent years makes it essential that storage requirements for all information be kept to a minimum. A fully automatic and rapid 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", })ttp://www.math.utah.edu/pub/tex/bib/datacompression.bib2005.11.25 18:20:16 MSTAlso published in/as: File Organization, Siwerts and Zeitlinge (Amsterdam), 1969.The ``information explosion'' noted in recent years makes it essential that storage requirements for all information be kept to a minimum. A fully automatic and rapid 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.Communications of the ACMack-nhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79The ``information explosion'' noted in recent years makes it essential that storage requirements for all information be kept to a minimum. A fully automatic and rapid 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.B. A. Marron and P. A. D. de MaineAlso published in/as: File Organization, Siwerts and Zeitlinge (Amsterdam), 1969.Automatic Data Compression @Article{Marron:1967:ADC, author = "B. A. Marron and P. A. D. de Maine", title = "Automatic Data Compression", journal = j-CACM, volume = "10", number = "11", pages = "711--715", month = nov, year = "1967", CODEN = "CACMA2", 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/; http://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Also published in/as: File Organization, Siwerts and Zeitlinge (Amsterdam), 1969.", abstract = "The ``information explosion'' noted in recent years makes it essential that storage requirements for all information be kept to a minimum. A fully automatic and rapid 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", } ^-),X 315%97C7;e95ephdthesisdatacompression.bibBruckheim:1969:OSOArthur Jay BruckheimOptimum and Sub-Optimum Compression of Second Order Markov DataPh.D. thesisUniversity of MarylandCollege Park, MD, USA1551969Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302460376Electrical engineeringack-nhfbArthur Jay BruckheimOptimum and Sub-Optimum Compression of Second Order {Markov} Data @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/; http://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", }.+U 3/)]1K-E};)]!phdthesisdatacompression.bibTunstall:1967:SNCB. P. TunstallSynthesis of Noiseless Compression CodesPh.D. DissertationGeorgia Institute of TechnologyAtlanta, GA, USA1967Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsB. P. TunstallSynthesis of Noiseless Compression Codes @PhdThesis{Tunstall:1967:SNC, author = "B. P. Tunstall", title = "Synthesis of Noiseless Compression Codes", type = "{Ph.D.} Dissertation", school = "Georgia Institute of Technology", address = "Atlanta, GA, USA", pages = "??", year = "1967", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, rawdata = "Tunstall, B. P., (1967) ``Synthesis of Noiseless Compression Codes,'' Ph.D. dissertation, Georgia Institute of Technology, Atlanta, GA.", }*V 3-9A%51C7;e99Eophdthesisdatacompression.bibStanley:1967:CMDThomas Patrick StanleyCompression of Markov DataPh.D. thesisPrinceton UniversityPrinceton, NJ, USA1061967Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302264732Electrical engineeringack-nhfbThomas Patrick StanleyCompression of {Markov} Data @PhdThesis{Stanley:1967:CMD, author = "Thomas Patrick Stanley", title = "Compression of {Markov} Data", type = "{Ph.D.} thesis", school = "Princeton University", address = "Princeton, NJ, USA", pages = "106", year = "1967", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302264732", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "6802519", subject = "Electrical engineering", } s/W '3+7==/5E1;7=mastersthesisdatacompression.bibHusson:1970:DCSGeorges Eugene HussonData compression systemsDip.Eng. (Elec.), M.Eng.McGill UniversityMontreal, QC, Canadaiii + 1251970Mon Jan 28 15:10:29 MST 2013amicus.nlc-bnc.ca:210/NL; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.28 15:10:29 MSThttp://digitool.library.mcgill.ca/thesisfile49103.pdf; http://www.collectionscanada.ca/obj/thesescanada/vol1/QMM/TC-QMM-49103.pdfack-nhfbGeorges Eugene HussonData compression systems @MastersThesis{Husson:1970:DCS, author = "Georges Eugene Husson", title = "Data compression systems", type = "{Dip.Eng. (Elec.), M.Eng.}", school = "McGill University", address = "Montr{\'e}al, QC, Canada", pages = "iii + 125", year = "1970", LCCN = "????", bibdate = "Mon Jan 28 15:10:29 MST 2013", bibsource = "amicus.nlc-bnc.ca:210/NL; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://digitool.library.mcgill.ca/thesisfile49103.pdf; http://www.collectionscanada.ca/obj/thesescanada/vol1/QMM/TC-QMM-49103.pdf", acknowledgement = ack-nhfb, }+.V 3+3O%75C7;e93Owphdthesisdatacompression.bibBowyer:1970:DCTDuane Ernest BowyerData Compression and TransmissionPh.D. thesisUniversity of FloridaGainesville, FL, USA1461970Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302406194Electrical engineeringack-nhfbDuane Ernest BowyerData Compression and Transmission @PhdThesis{Bowyer:1970:DCT, author = "Duane Ernest Bowyer", title = "Data Compression and Transmission", type = "{Ph.D.} thesis", school = "University of Florida", address = "Gainesville, FL, USA", pages = "146", year = "1970", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302406194", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "7116765", subject = "Electrical engineering", }<-Y 3'+OY77E];9#+O[articledatacompression.bibLynn:1969:QCCKenneth C. LynnA quantitative comparison of conventional information compression techniques in dental literaturej-AM-DOC202149--151apr41969AMDOA7https://doi.org/10.1002/asi.46302002060096-946X OR 0096946X0096-946X OR 0096946XFri Sep 11 06:21:31 MDT 2015http://www.math.utah.edu/pub/tex/bib/amdoc.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2015.09.11 06:21:31 MDTAmerican Documentationack-nhfbhttp://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2330-1643/19 Apr 2007Kenneth C. LynnA quantitative comparison of conventional information compression techniques in dental literature @Article{Lynn:1969:QCC, author = "Kenneth C. Lynn", title = "A quantitative comparison of conventional information compression techniques in dental literature", journal = 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 = "http://www.math.utah.edu/pub/tex/bib/amdoc.bib; http://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", } ;1X 3-5e%/;C7;e95m[phdthesisdatacompression.bibWilkins:1970:SDCLarry Clarke WilkinsStudies on Data Compression. Part I: Picture Coding By Contours. Part II: Error Analysis of Run-Length CodesPh.D. thesisPurdue UniversityWest Lafayette, IN, USA3181970Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302522243Electrical engineeringack-nhfbLarry Clarke WilkinsStudies on Data Compression. {Part I}: Picture Coding By Contours. {Part II}: Error Analysis of Run-Length Codes @PhdThesis{Wilkins:1970:SDC, author = "Larry Clarke Wilkins", title = "Studies on Data Compression. {Part I}: Picture Coding By Contours. {Part II}: Error Analysis of 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/; http://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", }W0X 31=/%1+C7;e9=3}phdthesisdatacompression.bibSchneider:1970:RDCKenneth Stuart SchneiderReliable Data Compression of Constant Rate Markov Sources for Fixed Rate ChannelsPh.D. thesisCornell UniversityIthaca, NY, USA3431970Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302518830Electrical engineeringack-nhfbKenneth Stuart SchneiderReliable Data Compression of Constant Rate {Markov} Sources for Fixed Rate Channels @PhdThesis{Schneider:1970:RDC, author = "Kenneth Stuart Schneider", title = "Reliable Data Compression of Constant Rate {Markov} Sources for Fixed Rate Channels", type = "{Ph.D.} thesis", school = "Cornell University", address = "Ithaca, NY, USA", pages = "343", year = "1970", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302518830", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "7101075", subject = "Electrical engineering", } ii OXZ5 @Article{Pigeon:1999:AAI, author = "Steven Pigeon", title = "Algorithm Alley: Image Compression with Wavelets", journal = j-DDJ, volume = "24", number = "8", pages = "111--115", month = aug, year = "1999", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Fri Jul 16 19:10:34 MDT 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "9908n/990$I @Article{Plandowski:1998:ALZ, author = "Wojciech Plandowski and Wojciech Rytter", title = "Application of {Lempel--Ziv} Encodings to the Solution of Word Equations", journal = j-LECT-NOTES-COMP-SCI, volume = "1443", pages = "731--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Feb 5 11:52:31 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1443.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1443/14430731.htm; http://link.springer-ny.com/link/service/series/0558/papers/1443/14430731.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", }qc @Article{Pigeon:1998:AAM, author = "Steven Pigeon and Yoshua Bengio", title = "Algorithm Alley: Memory-Efficient Adaptive {Huffman} Coding", journal = j-DDJ, volume = "23", number = "10", pages = "131--132, 134--135", month = oct, year = "1998", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Fri Sep 11 09:12:05 MDT 1998", bibsource = "http://www.math.utah.edu/pub/bQ @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 = L @Article{Piner:1999:CSN, author = "Mary-Louise G. Piner", title = "{Computer Society} Notes: {David Huffman} (1925--1999)", journal = j-COMPUTER, volume = "32", number = "12", pages = "86--86", month = dec, year = "1999", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Sat Mar 11 09:52:58 MST 2000", bibsource = "http://www.math.utah.edu/pub/tex/bib/computer1990.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://dlib.computer.org/co/books/co1999/pdf/rz086.pdf", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", }. E @Article{Posner:1971:EED,A @Article{Pierzchala:2003:CWO, author = "Stephen Pierzchala", title = "Compressing {Web} Output Using {{\tt mod\_gzip}} and {Apache}", journal = j-LOGIN, volume = "28", number = "2", pages = "??--??", month = apr, year = "2003", CODEN = "LOGNEM", ISSN = "1044-6397", bibdate = "Tue Apr 11 10:52:26 MDT 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/usenix2000.bib; http://www.usenix.org/publications/login/2003-04/index.html", URL = "http://www.usenix.org/publications/login/2003-04/pdfs/pierzchala.pdf", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", }%1:16 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#AmidonA71; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", abstract = "The best of a dozen different methods for compressing map data is illustrated. The choices are generated by encoding data 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", }2 99D2^3+C57Ee;[?g/c#[CKarticledatacompression.bibAmidon:1971:ASBE. L. Amidon and G. S. AkinAlgorithmic Selection of the Best Method for Compressing Map Data Stringsj-CACM1412769--774dec121971CACMA20001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 00010782Mon Jan 22 06:21:16 MST 2001http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#AmidonA71; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2001.01.22 06:21:16 MSTThe best of a dozen different methods for compressing map data is illustrated. The choices are generated by encoding data 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.Communications of the ACMdata compression; data reduction; data reduction and analysis; data strings; forest resource maps; information retrieval; input/output; map; map storage; run coding; storageack-nhfbC6130 (Data handling techniques); C7890 (Other special applications of computing)Pacific Southwest Forest and Range Experiment Station, Berkeley, CA, USAhttp://portal.acm.org/browse_dl.cfm?idx=J79P PracticalThe best of a dozen different methods for compressing map data is illustrated. The choices are generated by encoding data 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.E. L. Amidon and G. S. AkinAlgorithmic Selection of the Best Method for Compressing Map Data Strings @Article{Amidon:1971:ASB, author = "E. L. Amidon and G. S. Akin", title = "Algorithmic Selection of the Best Method for Compressing Map Data Strings", journal = j-CACM, volume = "14", number = "12", pages = "769--774", month = dec, year = "1971", CODEN = "CACMA2", 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; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", abstract = "The best of a dozen different methods for compressing map data is illustrated. The choices are generated by encoding data 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", } .4V3+[U+![77Ei;kO_[UE/articledatacompression.bibPosner:1971:EEDEdward C. Posner and Eugene R. RodemichEpsilon Entropy and Data Compressionj-ANN-MATH-STAT4262079--2125dec121971AASTADhttps://doi.org/10.1214/aoms/11776930770003-4851 OR 000348510003-4851 OR 00034851Sat May 31 09:11:21 MDT 2014http://www.math.utah.edu/pub/tex/bib/annmathstat.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2014.05.31 09:11:21 MDThttp://projecteuclid.org/euclid.aoms/1177693077Annals of Mathematical Statisticsack-nhfbhttp://projecteuclid.org/all/euclid.aoms/Edward C. Posner and Eugene R. RodemichEpsilon Entropy and Data Compression @Article{Posner:1971:EED, author = "Edward C. Posner and Eugene R. Rodemich", title = "Epsilon Entropy and Data Compression", journal = 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 = "http://www.math.utah.edu/pub/tex/bib/annmathstat.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://projecteuclid.org/euclid.aoms/1177693077", acknowledgement = ack-nhfb, fjournal = "Annals of Mathematical Statistics", journal-URL = "http://projecteuclid.org/all/euclid.aoms/", }O3Y 3+#!!CQE5;U#YDbookdatacompression.bibBerger:1971:RDTToby BergerRate distortion theory; a mathematical basis for data compressionpub-PHpub-PH:adrxiii + 31119710-13-753103-6 OR 0137531036978-0-13-753103-5 OR 9780137531035Q385 .B47Mon Jan 28 15:19:07 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; z3950.loc.gov:7090/Voyager2013.01.28 15:19:07 MSTPrentice-Hall series in information and system sciences; Prentice-Hall electrical engineering seriesRate distortion theory; Coding theory; Information theoryack-nhfbToby BergerRate distortion theory; a mathematical basis for data compression @Book{Berger:1971:RDT, author = "Toby Berger", title = "Rate distortion theory; a mathematical basis for data compression", publisher = 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 = "http://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", } w w h9 @Article{Roger:1996:LCA, author = "R. E. Roger and M. C. Cavenor", title = "Lossless Compression of {AVIRIS} Images", journal = j-IEEE-TRANS-IMAGE-PROCESS, volume = "5", number = "5", pages = "713--719", month = may, year = "1996", CODEN = "IIPRE4", ISSN = "1057-7149 (print), 1941-0042 (electronic)", ISSN-L = "1057-7149", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, fjournal = "IEEE Transactions on Image Processing", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=83", rawdata = "Roger, R. E., and M. C. Cavenor (1996) ``Lossless Compression of AVIRIS Images,'' {\it IEEE Transactions on Image Processing}, {\bf5}(5):713--719, May.", }P) @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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "C Users Journal", }<'O @Article{Rokicki:1985:PPF, author = "Tomas Rokicki", title = "Packed ({{\tt PK}}) Font File Format", )S @Article{Rodriguez:1995:GFF, author = "Karen Rodriguez", title = "Graphics File Format Patent {Unisys} Seeks Royalties from {GIF} Developers", journal = j-INFOWORLD, volume = "17", number = "2", pages = "3", day = "9", month = jan, year = "1995", CODEN = "INWODU", ISSN = "0199-6649", ISSN-L = "", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, fjournal = "InfoWorld", rawdata = "Rodriguez, Karen (1995) ``Graphics File Format Patent Unisys Seeks Royalties from GIF Developers,'' {\it InfoWorld}, January 9, {\bf17}(2):3.", }/ @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 = "http://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", }n' @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", ISSN = "0030-3941", ISSN-L = "", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }d t +t47V 3)'u%9/C7;e)'ukphdthesisdatacompression.bibDosik:1972:OBCPaul H. DosikAn Optimal Buffer Controlled Data Compression SystemPh.D. thesisPolytechnic UniversityNew York, NY, USA1901972Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302676863Systems designack-nhfbPaul H. DosikAn Optimal Buffer Controlled Data Compression System @PhdThesis{Dosik:1972:OBC, author = "Paul H. Dosik", title = "An Optimal Buffer Controlled Data Compression System", type = "{Ph.D.} thesis", school = "Polytechnic University", address = "New York, NY, USA", pages = "190", year = "1972", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302676863", acknowledgement = ack-nhfb, classification = "0790: Systems design", dissertation-thesis-number = "7228226", subject = "Systems design", }M6U 3-E};QEmiscdatacompression.bibAnonymous:1972:GAnonymousG.7111972Sat Jan 26 12:46:12 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:12 MSThttp://en.wikipedia.org/wiki/G.711ack-dsAnonymous{G.711} @Misc{Anonymous:1972:G, author = "Anonymous", title = "{G.711}", pages = "??", year = "1972", bibdate = "Sat Jan 26 12:46:12 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://en.wikipedia.org/wiki/G.711", acknowledgement = ack-ds, rawdata = "G.711 (1972) |http://en.wikipedia.org/wiki/G.711|.", }5X 3+/;57E};[/C articledatacompression.bibRudner:1971:CMRB. RudnerConstruction of Minimum-Redundancy Codes with an Optimum Synchronization Propertyj-IEEE-TRANS-INF-THEORY174478--487jul71971IETTAW0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsB. RudnerConstruction of Minimum-Redundancy Codes with an Optimum Synchronization Property @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", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }ssion.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|.", }8 jY +j[7 @Article{Smith:1993:AMC, author = "Brian C. Smith and Lawrence A. Rowe", title = "Algorithms for manipulating compressed images", journal = j-IEEE-CGA, volume = "13", number = "5", pages = "34--42", month = sep, year = "1993", CODEN = "ICGADZ", ISSN = "0272-1716 (print), 1558-1756 (electronic)", ISSN-L = "0272-1716", bibdate = "Fri Jan 5 07:58:42 MST 1996", bibsource = "GrapP! @Article{Skarbek:1998:MOR, author = "W{\l}adys{\l}aw Skarbek and Adam Pietrowcew and Rados{\l}aw Sikora", title = "The Modified Oja-{RLS} Algorithm, Stochastic Convergence Analysis and Application for Image Compression", journal = j-FUND-INFO, volume = "36", number = "4", pages = "345--365", month = dec, year = "1998", CODEN = "FUMAAJ", DOI = "https://doi.org/10.3233/FI-1998-3644", ISSN = "0169-2968 (print), 1875-8681 (electronic)", ISSN-L = "0169-2968", bibdate = "Sat Mar 5 16:56:14 MST 2016", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fundinfo1990.bib", acknowledgement = ack-nhfb, fjournal = "Fundamenta Informaticae", journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae", }ti @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", ISSN = "0097-8930 (print), 1558-4569 (electronic)", ISSN-L = "0097-8930", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "Ai/a\9 @Article{Skibinski:2005:RDB, author = "Przemys{\l}aw Skibi{\'n}ski and Szymon Grabowski and Sebastian Deorowicz", title = "Revisiting dictionary-based compression", journal = j-SPE, volume = "35", number = "15", pages = "1455--1476", month = dec, year = "2005", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.678", ISSN = "0038-0644 (print), 1097-024X (electronic̅>} @Article{Skarbek:1999:MOR, author = "W. Skarbek and A. Pietrowcew and R. Sikora", title = "Modified {Oja-RLS} algorithm --- stochastic convergence analysis and application for image compression", journal = j-LECT-NOTES-COMP-SCI, volume = "1609", pages = "402--??", year = "1999", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Mon Sep 13 16:57:02 MDT 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", }>5k @Article{Skarbek:1998:PSI, author = "W{\l}adys{\l}aw Skarbek", title = "Preface: Special Issue on Image Compression", journal = j-FUND-INFO, volume = "34", number = "4", pages = "??--??", month = jul, year = "1998", CODEN = "FUMAAJ", DOI = "https://doi.org/10.3233/FI-1998-34410", ISSN = "0169-2968 (print), 1875-8681 (electronic)", ISSN-L = "0169-2968", bibdate = "Sat Mar 5 16:55:47 MST 2016", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fundinfo1990.bib", acknowledgement = ack-nhfb, fjournal = "Fundamenta Informaticae", journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae", } ``^9V 3+%5;57E};[%5iarticledatacompression.bibGolomb:1972:RLES. W. GolombRun-Length Encodingsj-IEEE-TRANS-INF-THEORYIT-123399--4011972IETTAW0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:09 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:09 MSTIEEE Transactions on Information Theoryack-dsS. W. GolombRun-Length Encodings @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", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:09 MST 2013", bibsource = "http://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.", }<8W 3+)1!57E};[3])1Earticledatacompression.bibGardner:1972:MGMartin GardnerMathematical Gamesj-SCI-AMER2272106--106aug81972SCAMAC0036-8733 (print), 1946-7087 (electronic) OR 00368733 (print), 19467087 (electronic)0036-8733 OR 00368733Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSThttp://www.gemstartvguide.com; http://www.macrovision.com/products/ce_manufacturers/ipg_ce/vcr_plus.htmScientific Americanack-dshttp://www.nature.com/scientificamericanMartin GardnerMathematical Games @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", ISSN = "0036-8733 (print), 1946-7087 (electronic)", ISSN-L = "0036-8733", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://www.gemstartvguide.com; http://www.macrovision.com/products/ce_manufacturers/ipg_ce/vcr_plus.htm", acknowledgement = 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|.", } ;X 3/;%=+C7;e!;7phdthesisdatacompression.bibKohlhaas:1972:CFCCharles Albert KohlhaasCalculation of Formation Compression From Core and Well-Tested DataPh.D. thesisColorado School of MinesGolden, CO, USA1972Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302554471Geophysicsack-nhfbCharles Albert KohlhaasCalculation of Formation Compression From Core and Well-Tested Data @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/; http://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", }:V 3)#A!57E};3]#Aarticledatacompression.bibHeath:1972:OBCF. G. HeathOrigins of the Binary Codej-SCI-AMER227276--76aug81972SCAMAC0036-8733 (print), 1946-7087 (electronic) OR 00368733 (print), 19467087 (electronic)0036-8733 OR 00368733Sat Jan 26 12:46:09 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:09 MSTScientific Americanack-dshttp://www.nature.com/scientificamericanF. G. HeathOrigins of the Binary Code @Article{Heath:1972:OBC, author = "F. G. Heath", title = "Origins of the Binary Code", journal = j-SCI-AMER, volume = "227", number = "2", pages = "76--76", month = aug, year = "1972", CODEN = "SCAMAC", ISSN = "0036-8733 (print), 1946-7087 (electronic)", ISSN-L = "0036-8733", bibdate = "Sat Jan 26 12:46:09 MST 2013", bibsource = "http://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.", } >=X 3)1)%/;C7;e91)mphdthesisdatacompression.bibReady:1972:MDCPatrick John ReadyMultispectral Data Compression Through Transform Coding and Block QuantizationPh.D. thesisPurdue UniversityWest Lafayette, IN, USA1641972Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/302618152Electrical engineeringack-nhfbPatrick John ReadyMultispectral Data Compression Through Transform Coding and Block Quantization @PhdThesis{Ready:1972:MDC, author = "Patrick John Ready", title = "Multispectral Data Compression Through Transform Coding and Block Quantization", type = "{Ph.D.} thesis", school = "Purdue University", address = "West Lafayette, IN, USA", pages = "164", year = "1972", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302618152", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "7230964", subject = "Electrical engineering", }|V 33;I;]57E};[;I]articledatacompression.bibSchalkwijk:1972:ASCJ. Pieter M. SchalkwijkAn Algorithm for Source Codingj-IEEE-TRANS-INF-THEORY183395--399may51972IETTAWhttps://doi.org/10.1109/TIT.1972.10548320018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsJ. Pieter M. SchalkwijkAn Algorithm for Source Coding @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 = "http://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.", }50 MST 2012", bibsource = "Compendex database; Database/Wiederhold.bib; http://comjnl.oxfordjournals.org/content/15/4.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/", note = "See correspondence \cite{Gibbons:1973:CFC}.", URL = "http://comjnl.oxfordjournals.org/content/15/4/308.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/150308.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/308.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/309.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/310.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/311.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/312.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/313.tif", acknowledgement = 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", }@ 77F@Y 3)m[57C;_A5M+O#cm9articledatacompression.bibWells:1972:FCUM. WellsFile Compression Using Variable Length Encodingsj-COMP-J154308--313nov111972CMPJA6https://doi.org/10.1093/comjnl/15.4.3080010-4620 (print), 1460-2067 (electronic) OR 00104620 (print), 14602067 (electronic)0010-4620 OR 00104620Tue Dec 4 14:47:50 MST 2012Compendex database; Database/Wiederhold.bib; http://comjnl.oxfordjournals.org/content/15/4.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/2012.12.04 14:47:50 MSTSee correspondence cite Gibbons:1973:CFC.http://comjnl.oxfordjournals.org/content/15/4/308.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/150308.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/308.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/309.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/310.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/311.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/312.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/313.tifThe Computer Journalcodes; computer programming languages; computers, digital; data handling; data processing; decoding; encoding; file compression; hardware; software techniques; variable length encodingsack-nhfbC6130 (Data handling techniques)Univ. Leeds, UKhttp://comjnl.oxfordjournals.org/P PracticalM. WellsSee correspondence \cite{Gibbons:1973:CFC}.File Compression Using Variable Length Encodings @Article{Wells:1972:FCU, author = "M. Wells", title = "File Compression Using Variable Length Encodings", journal = 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; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/", note = "See correspondence \cite{Gibbons:1973:CFC}.", URL = "http://comjnl.oxfordjournals.org/content/15/4/308.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/150308.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/308.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/309.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/310.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/311.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/312.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/313.tif", acknowledgement = 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", }ISSN = "0037-9565", ISSN-L = "0037-9565", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib", acknowledgement = 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.", }A Y d ~1Y^= @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/; http://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", }vm @MastersThesis{Benschop:1997:LDC, author = "Leonard Cornelius Benschop", title = "Lossless Data Compression in {VLSI}", type = "Masterarbeit", school = "Technische Universiteit Eindhoven", address = "Eindhoven, The Netherlands", pages = "242", year = "1997", ISBN = "90-386-0400-9", ISBN-13 = "978-90-386-0400-8", LCCN = "????", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/304401746", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering; 0984: Computer science", dissertation-thesis-number = "C646520", subject = "Electrical engineering; Computer science", }K @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 = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; libraries.colorado.edu:210/INNOPAC", acknowledgement = ack-nhfb, subject = "Data compression (Telecommunication)", }MdI @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/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, classification = "0399: Library science", subject = "Library science", }߅5 @InProceedings{vonBerg:1997:EBA, author = "D. C. Linne von Berg", title = "Effects of boundary artifacts in parallel implementations of wavelet compression for large-format digital framing reconnaissance camera systems", crossref = "Storer:1997:DDC", pages = "??--??", year = "1997", DOI = "https://doi.org/10.1109/DCC.1997.582113", bibdate = "Tue Feb 5 08:32:18 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582113", acknowledgement = ack-nhfb, }1J1 anύoa @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-,=cG @Article{Carretero:1998:CPRa, author = "J. Carretero and J. No and S.-S. Park and A. Choudhary", title = "{COMPASSION}: a Parallel {I/O} Runtime System ʆ7o @Article{Barr:2006:EAL, author = "Kenneth C. Barr and Krste Asanovi{\'c}", title = "Energy-aware lossless data compression", journal = j-TOCS, volume = "24", number = "3", pages = "250--291", month = aug, year = "2006", CODEN = "ACSYEC", ISSN = "0734-2071 (print), 1557-7333 (electronic)", ISSN-L = "0734-2071", bibdate = "Tue Aug 29 05:29:09 MDT 2006", bibsource = "http://www.acm.org/pubs/contents/journals/tocs/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/tocs.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Computer Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774", } cG @Article{Bille:2009:IAS, author = "Philip Bille and Rolf Fagerberg and Inge Li G{\o}rtz", title = "Improved approximate string matching and regular expression matching on {Ziv--Lempel} compressed texts", journal = j-TALG, volume = "6", number = "1", pages = "3:1--3:??", month = dec, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1644015.1644018", ISSN = M(3g @Article{Benini:2002:ODP, author = "Luca Benini and Alberto Macii and Enrico Macii", title = "Offline Data Profiling Techniques to Enhance Memory Compression in Embedded Systems", journal = j-LECT-NOTES-COMP-SCI, volume = "2451", pages = "314--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Sep 10 19:10:32 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2451.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2451/24510314.htm; http://link.springer-ny.com/link/service/series/0558/papers/2451/24510314.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", }O fM @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 .0a @Article{Bekesi:1996:FGA, author = "J. B{\'e}k{\'e}si and G. Galambos and U. Pferschy and G. J. W{\"o}ginger", title = "The Fractional Greedy Algorithm for Data Compression", journal = j-COMPUTING, volume = "56", number = "1", pages = "29--46", month = mar, year = "1996", CODEN = "CMPTA2", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", MRcla K1KcBW '3+[%E};[?inproceedingsdatacompression.bibFaller:1973:ASDN. FallerRecord of the 7th Asilomar Conference on Circuits, Systems, and ComputersAn Adaptive System for Data Compressionpub-IEEEpub-IEEE:adr593--5971973Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsN. FallerRecord of the 7th Asilomar Conference on Circuits, Systems, and ComputersAn Adaptive System for Data Compression @InProceedings{Faller:1973:ASD, author = "N. Faller", booktitle = "Record of the 7th Asilomar Conference on Circuits, Systems, and Computers", title = "An Adaptive System for Data Compression", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "593--597", year = "1973", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }LAX 33'977Ec;s'articledatacompression.bibZeckendorf:1972:RNNE. ZeckendorfRepresentation des Nombres naturels par une Somme de Nombres de Fibonacci ou de Nombres de Lucas. (French) [Representation of the natural numbers by a sum of Fibonacci or Lucas numbers]j-BULL-SOC-R-SCI-LIEGE41179--1821972BSRSA60037-9565 OR 003795650037-9565 OR 00379565Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib2013.01.26 12:46:16 MSTBulletin de la Societe royale des sciences de LiegeFrenchack-dsE. ZeckendorfRepr{\'e}sentation des Nombres naturels par une Somme de Nombres de {Fibonacci} ou de Nombres de {Lucas}. ({French}) [{Representation} of the natural numbers by a sum of {Fibonacci} or {Lucas} numbers] @Article{Zeckendorf:1972:RNN, author = "E. Zeckendorf", title = "Repr{\'e}sentation des Nombres naturels par une Somme de Nombres de {Fibonacci} ou de Nombres de {Lucas}. ({French}) [{Representation} of the natural numbers by a sum of {Fibonacci} or {Lucas} numbers]", journal = 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 = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://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.", }", ISSN-L = "0010-4620", bibdate = "Sat Oct 07 17:13:59 2000", bibsource = "http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/", note = "See \cite{Wells:1972:FCU}.", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/287.tif", acknowledgement = ack-nhfb, fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", }C GDV 3)-U#77E%;e3!9-Ygarticledatacompression.bibGrimm:1973:ALPRichard E. GrimmThe Autobiography of Leonardo Pisanoj-FIB-QUART11199--104feb21973FIBQAU0015-0517 OR 001505170015-0517 OR 00150517Sat Jan 26 12:46:16 MST 2013http://www.fq.math.ca/11-1.html; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib2013.01.26 12:46:16 MSThttp://www.fq.math.ca/Scanned/11-1/grimm.pdfFibonacci Quarterlyack-dsFib. Quarthttp://www.fq.math.ca/Richard E. GrimmThe Autobiography of {Leonardo Pisano} @Article{Grimm:1973:ALP, author = "Richard E. Grimm", title = "The Autobiography of {Leonardo Pisano}", journal = 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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib", URL = "http://www.fq.math.ca/Scanned/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.", }+CZ 3-K[57=E;=!5OKASarticledatacompression.bibGibbons:1973:CFCCharles J. Gibbons and M. WellsCorrespondence: On ``File Compression Using Variable Length Encodings''j-COMP-J163287--287aug81973CMPJA6https://doi.org/10.1093/comjnl/16.3.2870010-4620 (print), 1460-2067 (electronic) OR 00104620 (print), 14602067 (electronic)0010-4620 OR 00104620Sat Oct 07 17:13:59 2000http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/2000.10.07 17:13:59 ???See cite Wells:1972:FCU.http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/287.tifThe Computer Journalack-nhfbhttp://comjnl.oxfordjournals.org/Charles J. Gibbons and M. WellsSee \cite{Wells:1972:FCU}.Correspondence: On {``File Compression Using Variable Length Encodings''} @Article{Gibbons:1973:CFC, author = "Charles J. Gibbons and M. Wells", title = "Correspondence: On {``File Compression Using Variable Length Encodings''}", journal = 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 = "http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/", note = "See \cite{Wells:1972:FCU}.", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/287.tif", acknowledgement = ack-nhfb, fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", }w.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib", URL = "http://www.fq.math.ca/Scanned/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.", }D `%GV 3'1k%7-C7;e#1kYphdthesisdatacompression.bibPore:1973:FADMichael David PoreFactor Analysis as a Data Compression TechniquePh.D. thesisTexas Tech UniversityLubbock, TX, USA3811973Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302771096Mathematicsack-nhfbMichael David PoreFactor Analysis as a Data Compression Technique @PhdThesis{Pore:1973:FAD, author = "Michael David Pore", title = "Factor Analysis as a Data Compression Technique", type = "{Ph.D.} thesis", school = "Texas Tech University", address = "Lubbock, TX, USA", pages = "381", year = "1973", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302771096", acknowledgement = ack-nhfb, classification = "0405: Mathematics", dissertation-thesis-number = "7405821", subject = "Mathematics", }XFX 3)+!CQE;+Wbookdatacompression.bibKnuth:1973:ACPDonald E. KnuthThe Art of Computer Programming, Volume 1, Fundamental Algorithmspub-AWpub-AW:adrSecondxxi + 63419730-201-03821-8 OR 0201038218978-0-201-03821-7 OR 9780201038217Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsDonald E. KnuthThe Art of Computer Programming, Volume 1, Fundamental Algorithms @Book{Knuth:1973:ACP, author = "Donald E. Knuth", title = "The Art of Computer Programming, Volume 1, Fundamental Algorithms", publisher = 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 = "http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; http://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.", }BEX 3/7-%3/C7;e37-iphdthesisdatacompression.bibJoglekar:1973:DCRAnil Narayan JoglekarData Compression In Recursive Estimation with Applications to Navigation SystemsPh.D. thesisStanford UniversityStanford, CA, USA1491973Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/302696388Aerospace materialsack-nhfbAnil Narayan JoglekarData Compression In Recursive Estimation with Applications to Navigation Systems @PhdThesis{Joglekar:1973:DCR, author = "Anil Narayan Joglekar", title = "Data Compression In Recursive Estimation with Applications to Navigation Systems", type = "{Ph.D.} thesis", school = "Stanford University", address = "Stanford, CA, USA", pages = "149", year = "1973", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302696388", acknowledgement = ack-nhfb, classification = "0538: Aerospace materials", dissertation-thesis-number = "7406491", subject = "Aerospace materials", } uIY3)[=3[57E3;WI[[Aarticledatacompression.bibAhmed:1974:DCTN. Ahmed and T. Natarajan and K. R. RaoDiscrete Cosine Transfomj-IEEE-TRANS-COMPUTC-23190--93jan11974ITCOB4https://doi.org/10.1109/T-C.1974.2237840018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)0018-9340 OR 00189340Sat Jan 26 12:46:16 MST 2013http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib2013.01.26 12:46:16 MSTSee comments cite Shanmugam:1975:CDC.http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672377IEEE Transactions on Computersack-dshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12N. Ahmed and T. Natarajan and K. R. RaoSee comments \cite{Shanmugam:1975:CDC}.{Discrete Cosine Transfom} @Article{Ahmed:1974:DCT, author = "N. Ahmed and T. Natarajan and K. R. Rao", title = "{Discrete Cosine Transfom}", journal = 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 = "http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib", note = "See comments \cite{Shanmugam:1975:CDC}.", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672377", acknowledgement = 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.", }yHX 3'5S%3/C7;e95Sphdthesisdatacompression.bibWang:1973:SSTRobert Tien Pei WangA Study of the Structure of Television Pictures as Applied to Practical Data Compression TechniquesPh.D. thesisStanford UniversityStanford, CA, USA1061973Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302674792Electrical engineeringack-nhfbRobert Tien Pei WangA Study of the Structure of Television Pictures as Applied to Practical Data Compression Techniques @PhdThesis{Wang:1973:SST, author = "Robert Tien Pei Wang", title = "A Study of the Structure of Television Pictures as Applied to Practical Data Compression Techniques", type = "{Ph.D.} thesis", school = "Stanford University", address = "Stanford, CA, USA", pages = "106", year = "1973", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302674792", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "7314996", subject = "Electrical engineering", } "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib", note = "See comments \cite{Shanmugam:1975:CDC}.", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672377", acknowledgement = 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.", }I9 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib", abstract = "Predictive coding techniques for efficient transmission or storage of 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", }Jth.utah.edu/pub/tex/bib/ibmjrd.bib1997.03.25 14:26:59 MSTPredictive 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.IBM Journal of Research and Developmentalgorithms; applications of computers; codes, symbolic; communication; communications applications of computers; data compression; digital signals; encoding; image data compression; information theory --- Filtering and Prediction Theory; predictive coding; two level digital images; video signalsack-nhfbB6120B (Codes); B6140 (Signal processing and detection); C1260 (Information theory); C7410F (Communications computing)IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USAhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520IBM J Res DevP Practical; X ExperimentalPredictive coding techniques for efficient transmission or storage of 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.L. R. Bahl and H. KobayashiImage data compression by predictive coding. {II}. Encoding algorithms @Article{Bahl:1974:IDC, author = "L. R. Bahl and H. Kobayashi", title = "Image data compression by predictive coding. {II}. Encoding algorithms", journal = 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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib", abstract = "Predictive coding techniques for efficient transmission or storage of 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", } ooM[3+So57E ;o?EWc!#oWo%articledatacompression.bibJordan:1974:CORB. W. Jordan, Jr. and R. C. BarrettA Cell Organized Raster Display for Line Drawingsj-CACM17270--77feb21974CACMA20001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 00010782Sat Jan 26 12:46:16 MST 2013Compendex database; http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#JordanB74; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTRaster scan computer graphics displays with ``real time'' character generators have previously been limited to alphanumeric characters. A display is described which extends the capabilities of this organization to include general graphics. The feasibility of such a display is shown by deriving the minimum number of patterns required in the read only memory of the character generator to synthesize an arbitrary line. The synthesis process does not compromise picture quality, since the resulting dot patterns are identical with those of a conventional raster display. The time constraints of a raster display are shown to be satisfied for a typical design for very complex line drawings.Communications of the ACMarbitrary line; cell organized raster display; complex line drawings; computer; computer graphic equipY~L\ 3'!s57E;U?uEc!AU!sarticledatacompression.bibHahn:1974:NTCBruce HahnA New Technique for Compression and Storage of Dataj-CACM178434--436aug81974CACMA20001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 00010782Mon Jan 22 06:47:50 MST 2001Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm17.W$KX 3'5%C-C7;e-5Qphdthesisdatacompression.bibFelt:1974:DCTDouglas Charles FeltData-Compression Techniques Using Adaptive Translation-Permutation CodesPh.D. thesisWashington State UniversityPullman, WA, USA1131974Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/302713192Computer scienceack-nhfbDouglas Charles FeltData-Compression Techniques Using Adaptive Translation-Permutation Codes @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/; http://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", }5J_3'C57E;W[]y'CWCarticledatacompression.bibBahl:1974:IDCL. R. Bahl and H. KobayashiImage data compression by predictive coding. II. Encoding algorithmsj-IBM-JRD182172--179mar31974IBMJAE0018-8646 (print), 2151-8556 (electronic) OR 00188646 (print), 21518556 (electronic)0018-8646 OR 00188646Tue Mar 25 14:26:59 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.maT ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Hahn74; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", abstract = "This paper describes techniques that can, in most cases, decrease storage size by a factor of from two to four. The techniques involve special handling of leading and trailing blanks, and the encoding of other symbols in groups of fixed size as unique fixed point numbers. The efficiency of the system is considered and pertinent statistics are given and compared with statistics for other information coding techniques.", acknowledgement = 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", }Lhtml#Hahn74; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2001.01.22 06:47:50 MSTThis paper describes techniques that can, in most cases, decrease storage size by a factor of from two to four. The techniques involve special handling of leading and trailing blanks, and the encoding of other symbols in groups of fixed size as unique fixed point numbers. The efficiency of the system is considered and pertinent statistics are given and compared with statistics for other information coding techniques.Communications of the ACMcoding techniques; compression; data handling; data management; data storage; efficiency; encoding; file maintenance; file organisation; fixed point numbers; information coding techniques; information theory; programs; text compression; utilityack-nhfbGeneration of a character dictionary and its use to minimize space.C6120 (File organisation); C6130 (Data handling techniques)Univ. Waterloo, Ont., Canadahttp://portal.acm.org/browse_dl.cfm?idx=J79Commun ACMA Application; P PracticalThis paper describes techniques that can, in most cases, decrease storage size by a factor of from two to four. The techniques involve special handling of leading and trailing blanks, and the encoding of other symbols in groups of fixed size as unique fixed point numbers. The efficiency of the system is considered and pertinent statistics are given and compared with statistics for other information coding techniques.Bruce HahnA New Technique for Compression and Storage of Data @Article{Hahn:1974:NTC, author = "Bruce Hahn", title = "A New Technique for Compression and Storage of Data", journal = j-CACM, volume = "17", number = "8", pages = "434--436", month = aug, year = "1974", CODEN = "CACMA2", 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; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", abstract = "This paper describes techniques that can, in most cases, decrease storage size by a factor of from two to four. The techniques involve special handling of leading and trailing blanks, and the encoding of other symbols in groups of fixed size as unique fixed point numbers. The efficiency of the system is considered and pertinent statistics are given and compared with statistics for other information coding techniques.", acknowledgement = 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", }Compendex database; http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#JordanB74; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", abstract = "Raster scan computer graphics displays with ``real time'' character generators have previously been limited to alphanumeric characters. A display is described which extends the capabilities of this organization to include general graphics. The feasibility of such a display is shown by deriving the minimum number of patterns required in the read only memory of the character generator to synthesize an arbitrary line. The synthesis process does not compromise picture quality, since the resulting dot patterns are identical with those of a conventional raster display. The time constraints of a raster display are shown to be satisfied for a typical design for very complex line drawings.", acknowledgement = 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", }Mment; computer graphics; computer peripheral equipment; discrete; dot; dot generation; graphics displays; image; line drawing; line drawings; matrix displays; minimum; number of patterns; patterns; read only memory; real time character generatorsack-dsC5540 (Terminals and graphic displays); C6130 (Data handling techniques)Northwestern Univ., Evanston, IL, USAhttp://portal.acm.org/browse_dl.cfm?idx=J79Commun ACMP PracticalRaster scan computer graphics displays with ``real time'' character generators have previously been limited to alphanumeric characters. A display is described which extends the capabilities of this organization to include general graphics. The feasibility of such a display is shown by deriving the minimum number of patterns required in the read only memory of the character generator to synthesize an arbitrary line. The synthesis process does not compromise picture quality, since the resulting dot patterns are identical with those of a conventional raster display. The time constraints of a raster display are shown to be satisfied for a typical design for very complex line drawings.B. W. {Jordan, Jr.} and R. C. BarrettA Cell Organized Raster Display for Line Drawings @Article{Jordan:1974:COR, author = "B. W. {Jordan, Jr.} and R. C. Barrett", title = "A Cell Organized Raster Display for Line Drawings", journal = j-CACM, volume = "17", number = "2", pages = "70--77", month = feb, year = "1974", CODEN = "CACMA2", 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; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", abstract = "Raster scan computer graphics displays with ``real time'' character generators have previously been limited to alphanumeric characters. A display is described which extends the capabilities of this organization to include general graphics. The feasibility of such a display is shown by deriving the minimum number of patterns required in the read only memory of the character generator to synthesize an arbitrary line. The synthesis process does not compromise picture quality, since the resulting dot patterns are identical with those of a conventional raster display. The time constraints of a raster display are shown to be satisfied for a typical design for very complex line drawings.", acknowledgement = 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", }4:26:59 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib", abstract = "Predictive coding techniques for efficient transmission or storage of 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", }N ddN_31C57E; [Iy'C Caarticledatacompression.bibKobayashi:1974:IDCH. Kobayashi and L. R. BahlImage data compression by predictive coding. I. Prediction algorithmsj-IBM-JRD182164--171mar31974IBMJAE0018-8646 (print), 2151-8556 (electronic) OR 00188646 (print), 21518556 (electronic)0018-8646 OR 00188646Tue Mar 25 14:26:59 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib1997.03.25 14:26:59 MSTPredictive coding techniques for efficient transmission or storage of two-level (black and white) digital images are dealt with.IBM Journal of Research and Developmentadaptive linear predictor; adaptive predictor with finite; algorithms; codes, symbolic; communications applications of computers; data compression; digital signals; encoding; fixed predictor; image data compression; information theory --- Filtering and Prediction Theory; memory; prediction; predictive coding; two level digital images; video signalsack-nhfbB6120B (Codes); B6140 (Signal processing and detection); C1260 (Information theory); C7410F (Communications computing)IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USAhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520IBM J Res DevP Practical; X ExperimentalPredictive coding techniques for efficient transmission or storage of two-level (black and white) digital images are dealt with.H. Kobayashi and L. R. BahlImage data compression by predictive coding. {I}. Prediction algorithms @Article{Kobayashi:1974:IDC, author = "H. Kobayashi and L. R. Bahl", title = "Image data compression by predictive coding. {I}. Prediction algorithms", journal = 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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib", abstract = "Predictive coding techniques for efficient transmission or storage of 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", } gPX 3);57E};[= articledatacompression.bibElias:1975:UCSP. EliasUniversal Codeword Sets and Representations of the Integersj-IEEE-TRANS-INF-THEORYIT-212194--203mar31975IETTAW0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsP. EliasUniversal Codeword Sets and Representations of the Integers @Article{Elias:1975:UCS, author = "P. Elias", title = "Universal Codeword Sets and Representations of the Integers", journal = j-IEEE-TRANS-INF-THEORY, volume = "IT-21", number = "2", pages = "194--203", month = mar, year = "1975", CODEN = "IETTAW", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }OX 3-'s%)EEW;Q1'sibookdatacompression.bibSlepian:1974:KPDDavid SlepianKey papers in the development of information theorypub-IEEEpub-IEEE:adrvi + 46319740-87942-027-8, 0-87942-028-6 (paperback) OR 0879420278, 0879420286 (paperback)978-0-87942-027-7, 978-0-87942-028-4 (paperback) OR 9780879420277, 9780879420284 (paperback)Q360 .S54Sat Nov 20 11:29:48 MST 2010catalog.princeton.edu:7090/voyager; http://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib; http://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2010.11.20 11:29:48 MSTIEEE Press selected reprint seriesInformation theoryack-nhfbDavid SlepianKey papers in the development of information theory @Book{Slepian:1974:KPD, editor = "David Slepian", title = "Key papers in the development of information theory", publisher = 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; http://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib; http://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", series = "IEEE Press selected reprint series", acknowledgement = ack-nhfb, subject = "Information theory", } bibsource = "http://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.", }P z% 6GXi @Article{Knuth:1985:DHC, author = "Donald E. Knuth", title = "DynN @Article{Ivanov:2000:CDN, author = "Denis V. Ivanov and Yevgeniy P. Kuzmin", title = "Color Distribution --- a New Approach to Texture Compression", journal = j-CGF, volume = "19", number = "3", pages = "??--??", month = aug, year = "2000", CODEN = "CGFODY", ISSN = "0167-7055 (print), 1467-8659 (electronic)", ISSN-L = "0167-7055", bibdate = "Wed Oct 11 06:13:38 Mn @Article{Jacquet:2001:APL, author = "P. Jacquet and W. Szpankowski and J. Tang", title = n] @Article{Iwata:2002:LZC, author = "Kazunori Iwata and Naohiro Ishii", title = "{Lempel--Ziv} Coding in Reinforcement Learning", journal = j-LECT-NOTES-COMP-SCI, volume = "2412", pages = "531--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Sep 10 19:10:19 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2412.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2412/24120531.htm; http://link.springer-ny.com/link/service/series/0558/papers/2412/24120531.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", }t @Article{Jacquet:1995:ABL, author = "Philippe Jacquet and Wojciech Szpankowski", title = "Asymptotic behavior of the {Lempel--Ziv} parsing scheme and digital search trees", journal = j-THEOR-COMP-SCI, volume = "144", number = "1--2", pages = "161--197", day = "26", month = jun, year = "1995", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSo)S @Article{Jackson:1996:PPF, author = "David Jeff Jackson and Wagdy Mahmoud", title = "Parallel pipelined fractal image compression using quadtree recomposition", journal = j-COMP-J, volume = "39", number = "1", pages = "1--13", month = "????", year = "1996", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/39.1.1", ISSN = "0010-4620 (print), 1460-2067 (electron# @Article{Jackson:1996:PAD, author = "David Jeff Jackson and Greg Scott Tinney", title = "Performance analysis of distributed implementations of a fractal image compression algorithm", journal = j-CPE, volume = "8", number = "5", pages = "357--386", month = jun, year = "1996", CODEN = "CPEXEI", ISSN = "1040-3108", ISSN-L = "1040-3108", bibdate = "Tue Sep 7 06:06:2Y3 @Article{Iyengar:1998:EFS, author = "Vikram Iyengar and Krishnendu Chakrabarty", title = "An efficient finite-state machine implementation of {Huffman} decoders", journal = j-INFO-PROC-LETT, volume = "64", number = "6", pages = "271--275", day = "15", month = jan, year = "1998", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Sat Nov 7 17:55:56 MST 1998", bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib", note = "See \cite{Turpin:1998:CEH}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", }Y ] ]6RY'3/9;K'E};9;Kinproceedingsdatacompression.bibGottlieb:1975:CCMD. Gottlieb and othersProceedings of the National Computer Conference, May 19--22, 1975, Anaheim, California.A Classification of Compression Methods and their Usefulness for a Large Data Processing Center44pub-AFIPSpub-AFIPS:adr453--4581975Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsD. Gottlieb and othersProceedings of the National Computer Conference, May 19--22, 1975, Anaheim, California.A Classification of Compression Methods and their Usefulness for a Large Data Processing Center @InProceedings{Gottlieb:1975:CCM, author = "D. Gottlieb and others", booktitle = "Proceedings of the National Computer Conference, May 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 = "http://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.", }gQX3/c;57E};[c-articledatacompression.bibGallager:1975:OSCRobert G. Gallager and David C. van VoorhisOptimal Source Codes for Geometrically Distributed Integer Alphabetsj-IEEE-TRANS-INF-THEORYIT-213228--230mar31975IETTAW0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsRobert G. Gallager and David C. van VoorhisOptimal Source Codes for Geometrically Distributed Integer Alphabets @Article{Gallager:1975:OSC, author = "Robert G. Gallager and David C. van Voorhis", title = "Optimal Source Codes for Geometrically Distributed Integer Alphabets", journal = j-IEEE-TRANS-INF-THEORY, volume = "IT-21", number = "3", pages = "228--230", month = mar, year = "1975", CODEN = "IETTAW", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", } $ cxcG @PhdThesis{Lee:1981:DCS, author = "Dong Hee Lee", title = "Data Compression with Source Coding for Unknown Source Statistics", type = "{Ph.D.} thesis", school = "University of Maryland", address = "College Park, MD, USA", pages = "86", year = "1981", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303164012", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8205240", subject = "Electrical engineering", }6m @PhdThesis{Larsson:1999:SSM, author = "N. Jesper Larsson", title = "Structures of string matching and data compression", type = "{Ph.D.} thesis", school = "Lunds Universitet", address = "Lund, Sweden", pages = "130", year = "1999", ISBN = "91-628-3685-4", ISBN-13 = "978-91-628-3685-6", LCCN = "????", bibdate = "Fri Feb 1 08:42:55 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/304568808", acknowledgement = ack-nhfb, advisor = "Hui Long Duan", classification = "0984: Computer science", dissertation-thesis-number = "C801205", subject = "Computer science", }1c @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/; http://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", }? @PhdThesis{Kurien:1983:PDC, author = "Thomas Kurien", title = "A Partitioned Data Compression Algorithm", type = "{Ph.D.} thesis", school = "The University of Connecticut", address = "Storrs, CT, USA", pages = "167", year = "1983", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303265149", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8319202", subject = "Electrical engineering", }Z7 @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/; http://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", }; T\3'?Y57E;[k=A'G?Yiarticledatacompression.bibLing:1975:BOIH. Ling and F. P. PalermoBlock-Oriented Information Compressionj-IBM-JRD192141--145mar31975IBMJAE0018-8646 (print), 2151-8556 (electronic) OR 00188646 (print), 21518556 (electronic)0018-8646 OR 00188646Tue Mar 25 14:26:59 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib1ctSV 3-5g%O5C7;e95q7phdthesisdatacompression.bibHilbert:1975:JCSEdward Erwin HilbertA Joint Clustering / Data Compression ConceptPh.D. thesisUniversity of Southern CaliforniaLos Angeles, CA, USA1975Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/302793284Electrical engineeringack-nhfbEdward Erwin HilbertA Joint Clustering \slash Data Compression Concept @PhdThesis{Hilbert:1975:JCS, author = "Edward Erwin Hilbert", title = "A Joint Clustering \slash Data Compression Concept", type = "{Ph.D.} thesis", school = "University of Southern California", address = "Los Angeles, CA, USA", pages = "????", year = "1975", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302793284", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "0510317", subject = "Electrical engineering", } http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib", abstract = "A new scheme is presented for information compression that does not use information statistics. Each information block is represented by two 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", }T997.03.25 14:26:59 MSTA new scheme is presented for information compression that does not use information statistics. Each information block is represented by two 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.IBM Journal of Research and Developmentbinary; binary number compression; CPUs; data base; data bases; data compression; data processing; information block; information compression; information statistics; information theory; information theory --- Data Compression; number reconstruction; one pass algorithm; statistical analysis; statisticsack-nhfbB6110 (Information theory); C1260 (Information theory); C6130 (Data handling techniques)IBM, White Plains, NY, USAhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520IBM J Res DevT Theoretical or MathematicalA new scheme is presented for information compression that does not use information statistics. Each information block is represented by two 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.H. Ling and F. P. PalermoBlock-Oriented Information Compression @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", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Tue Mar 25 14:26:59 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib", abstract = "A new scheme is presented for information compression that does not use information statistics. Each information block is represented by two 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", }0", bibdate = "Tue Dec 4 14:47:55 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/18/2.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/", URL = "http://comjnl.oxfordjournals.org/content/18/2/157.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/157.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/158.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/159.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/160.tif", acknowledgement = 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", }U 66GU[3)=w[57CS;k5+O#=wCarticledatacompression.bibMayne:1975:ICFA. Mayne and E. B. JamesInformation Compression by Factorising Common Stringsj-COMP-J182157--160may51975CMPJA6https://doi.org/10.1093/comjnl/18.2.1570010-4620 (print), 1460-2067 (electronic) OR 00104620 (print), 14602067 (electronic)0010-4620 OR 00104620Tue Dec 4 14:47:55 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/18/2.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/2012.12.04 14:47:55 MSThttp://comjnl.oxfordjournals.org/content/18/2/157.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/157.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/158.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/159.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/160.tifThe Computer Journalbases; codes, symbolic; common factors; data; data compression; data processing; data transmission time; economy; factorising common strings; file organisation; information compression; recoded; security; sequences of characters; storage space; string processingack-nhfbC6120 (File organisation); C6130 (Data handling techniques)Dept. of Computing and Control, Imperial Coll. of Sci. and Technol., London, UKhttp://comjnl.oxfordjournals.org/P PracticalA. Mayne and E. B. JamesInformation Compression by Factorising Common Strings @Article{Mayne:1975:ICF, author = "A. Mayne and E. B. James", title = "Information Compression by Factorising Common Strings", journal = 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; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/", URL = "http://comjnl.oxfordjournals.org/content/18/2/157.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/157.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/158.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/159.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/160.tif", acknowledgement = 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", } "Tue Jul 12 07:57:55 MDT 2011", bibsource = "http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib", note = "See \cite{Ahmed:1974:DCT}.", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672894", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", }V AVY 31+_3[57E3;=I+Acwarticledatacompression.bibShanmugam:1975:CDCK. S. ShanmugamComments on ``Discrete Cosine Transform''j-IEEE-TRANS-COMPUTC-247759--759jul71975ITCOB4https://doi.org/10.1109/T-C.1975.2243010018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)0018-9340 OR 00189340Tue Jul 12 07:57:55 MDT 2011http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib2011.07.12 07:57:55 MDTSee cite Ahmed:1974:DCT.http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672894IEEE Transactions on Computersack-nhfbhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12K. S. ShanmugamSee \cite{Ahmed:1974:DCT}.Comments on {``Discrete Cosine Transform''} @Article{Shanmugam:1975:CDC, author = "K. S. Shanmugam", title = "Comments on {``Discrete Cosine Transform''}", journal = 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 = "http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib", note = "See \cite{Ahmed:1974:DCT}.", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672894", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", }7:56 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/18/3.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/", URL = "http://comjnl.oxfordjournals.org/content/18/3/243.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/243.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/244.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/245.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/246.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/247.tif", acknowledgement = 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", }W 1W[ 3+%g[57CS;5qOA%gQarticledatacompression.bibTurner:1975:GCSL. F. TurnerThe `on-ground' compression of satellite dataj-COMP-J183243--247aug81975CMPJA6https://doi.org/10.1093/comjnl/18.3.2430010-4620 (print), 1460-2067 (electronic) OR 00104620 (print), 14602067 (electronic)0010-4620 OR 00104620Tue Dec 4 14:47:56 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/18/3.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/2012.12.04 14:47:56 MSThttp://comjnl.oxfordjournals.org/content/18/3/243.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/243.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/244.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/245.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/246.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/247.tifThe Computer Journalaerospace applications of computers; data compression; ESRO 1; Hadamard; information theory; on ground compression; Run length method; satellite data; satellites; Shannon Fano method; transformationack-nhfbB6140 (Signal processing and detection); C1260 (Information theory); C7490 (Computing in other engineering fields)Electrical Engng. Dept., Imperial Coll. of Sci. and Technol., London, UKhttp://comjnl.oxfordjournals.org/A Application; P PracticalL. F. TurnerThe `on-ground' compression of satellite data @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; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/", URL = "http://comjnl.oxfordjournals.org/content/18/3/243.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/243.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/244.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/245.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/246.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/247.tif", acknowledgement = 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", } FYY3-Os-57Ek;I?wGOs5articledatacompression.bibBentley:1976:AOAJ. L. Bentley and A. Chi-Chih YaoAn Almost Optimal Algorithm for Unbounded Searchingj-INFO-PROC-LETT5382--87aug81976IFPLAT0020-0190 (print), 1872-6119 (electronic) OR 00200190 (print), 18726119 (electronic)0020-0190 OR 00200190Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib2013.01.26 12:46:16 MSTInformation Processing Lettersalgorithm; almost optimal; comparison searching; table; table lookup; unbounded searchingack-dsDept. of Computer Sci., Univ. of North Carolina, Chapel Hill, NC, USAhttp://www.sciencedirect.com/science/journal/00200190T Theoretical or MathematicalJ. L. Bentley and A. Chi-Chih YaoAn Almost Optimal Algorithm for Unbounded Searching @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", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = 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", }EXX 339%O5C7;e99phdthesisdatacompression.bibAchterberg:1976:BCDDonald Dean AchterbergBlock Code Data Compression: a Rate Distortion Theoretic ApproachPh.D. thesisUniversity of Southern CaliforniaLos Angeles, CA, USA1976Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302800779Electrical engineeringack-nhfbDonald Dean AchterbergBlock Code Data Compression: a Rate Distortion Theoretic Approach @PhdThesis{Achterberg:1976:BCD, author = "Donald Dean Achterberg", title = "Block Code Data Compression: a Rate Distortion Theoretic Approach", type = "{Ph.D.} thesis", school = "University of Southern California", address = "Los Angeles, CA, USA", pages = "????", year = "1976", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302800779", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "0513287", subject = "Electrical engineering", }6 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = 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", }Y arr . ?aaC @Article{Klein:1989:STRqc @Article{Klein:2001:PLZ, author = "Shmuel Tomi Klein and Yair Wiseman", title = "Parallel {Lempel--Ziv} Coding (Extended Abstract)", journal = j-LECT-NOTES-COMP-SCI, volume = "2089", pages = "18--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-97S' @Article{Kirovski:1999:PBP, author = "Darko Kirovski and Johnson Kin and William H. Mangione-Smith", title = "Procedure Based Program Compression", journal = j-INT-J-PARALLEL-PROG, volume = "27", number = "6", pages = "457--475", month = dec, year = "1999", CODEN = "IJPPE5", DOI = "https://doi.org/10.1023/A:1018728216668", ISSN = "0885-7458 (print), 1573-7640 (electryV @Article{Klein:1997:EOR, author = "S. T. Klein", title = "Effi @Article{Kinsman:2011:TOT, author = "Adam B. Kinsman and Nicola Nicolici", title = "Trade-Offs in Test Data Compression and Deterministic {X}-Masking of Responses", journal = j-IEEE-TRANS-COMPUT, volume = "60", number = "4", pages = "498--507", month = apr, year = "2011", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2010.124", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Jun 29 10:26:18 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", }J @Article{Klasing:1998:ICCb, author = "R. Klasing", title = "Improved Compressions of Cube-Connected Cycles Networks", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "9", number = "8", pages = "803--??", month = aug, year = "1998", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri Nov 6 12:31:15 MST 1998", ^= @Article{Klasing:1998:ICCa, author = "R. Klasing", title = "Improved Compressions of Cube-Connected Cycles Networks", journal = j-LECT-NOTES-COMP-SCI, volume = "1517", pages = "242--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Jan 5 08:21:58 MST 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", }cpa @Article{Kjelsoe:1995:MMF, author = "M. Kjelsoe and S. Jones", title = "Memory Management in Flash-Memory Disks with Data Compression", journal = j-LECT-NOTES-COMP-SCI, volume = "986", pages = "399--??", year = "1995", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat May 11 13:45:32 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } B\W3-Q-C5CQ3Eq;sQ-obookdatacompression.bibDavisson:1976:DCLee D. Davisson and Robert M. GrayData compression14Dowden, Hutchinson and RossStroudsburg, PA, USAxv + 40719760-87933-089-9 OR 0879330899978-0-87933-089-7 OR 9780879330897TK5102.5 .D335 1976Mon Jan 28 15:19:07 MST 2013clas.caltech.edu:210/INNOPAC; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; z3950.loc.gov:7090/Voyager2013.01.28 15:19:07 MSTBenchmark papers in electrical engineering and computer scienceData compression (Telecommunication); Coding theoryack-nhfbLee D. Davisson and Robert M. GrayData compression @Book{Davisson:1976:DC, editor = "Lee D. Davisson and Robert M. Gray", title = "Data compression", volume = "14", publisher = "Dowden, Hutchinson and Ross", address = "Stroudsburg, PA, USA", pages = "xv + 407", year = "1976", ISBN = "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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; z3950.loc.gov:7090/Voyager", series = "Benchmark papers in electrical engineering and computer science", acknowledgement = ack-nhfb, subject = "Data compression (Telecommunication); Coding theory", }0[Z3)Cc[57CS;c5-[O#Ccg articledatacompression.bibDance:1976:ALDD. L. Dance and U. W. PoochAn adaptive on line data compression systemj-COMP-J193216--224aug81976CMPJA6https://doi.org/10.1093/comjnl/19.3.2160010-4620 (print), 1460-2067 (electronic) OR 00104620 (print), 14602067 (electronic)0010-4620 OR 00104620Tue Dec 4 14:47:58 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/19/3.toc; http://www.moSZY 33=5Ck;%e9=%phdthesisdatacompression.bibBudihardjo:1976:DCAPeter Setiadi BudihardjoData Compression Algorithms for Encoding of Digital Sources[unknown]Computer Communications Network Group, University of WaterlooWaterloo, ON, Canadaxii + 1521976Fri Feb 1 09:20:32 MST 2013amicus.nlc-bnc.ca:210/NL; http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSTReport E-69.http://search.proquest.com/docview/302833917Electrical engineeringack-nhfbPeter Setiadi BudihardjoReport E-69.Data Compression Algorithms for Encoding of Digital Sources @PhdThesis{Budihardjo:1976:DCA, author = "Peter Setiadi Budihardjo", title = "Data Compression Algorithms for Encoding of Digital Sources", type = "[unknown]", school = "Computer Communications Network Group, University of Waterloo", address = "Waterloo, ON, Canada", pages = "xii + 152", year = "1976", LCCN = "????", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "amicus.nlc-bnc.ca:210/NL; http://search.proquest.com/; http://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", }e Dec 4 14:47:58 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/19/3.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/", URL = "http://comjnl.oxfordjournals.org/content/19/3/216.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/216.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/217.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/218.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/219.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/220.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/221.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/222.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/223.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/224.tif", acknowledgement = 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", }[ath.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/2012.12.04 14:47:58 MSThttp://comjnl.oxfordjournals.org/content/19/3/216.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/216.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/217.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/218.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/219.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/220.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/221.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/222.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/223.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/224.tifThe Computer Journaladaptive; buffering; data compression; data processing; data set; dynamic priority assignment; FORTRAN; input/output control; interface; item relocation; online information; programs; system; utility programsack-nhfbC6130 (Data handling techniques); C6150E (General utility programs)Univ. of Arkansas, Little Rock, AR, USAhttp://comjnl.oxfordjournals.org/P PracticalD. L. Dance and U. W. PoochAn adaptive on line data compression system @Article{Dance:1976:ALD, author = "D. L. Dance and U. W. Pooch", title = "An adaptive on line data compression system", journal = 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; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/", URL = "http://comjnl.oxfordjournals.org/content/19/3/216.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/216.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/217.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/218.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/219.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/220.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/221.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/222.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/223.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/224.tif", acknowledgement = 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", } n P! @Article{Wallace:1991:JSP, author = "Gregory K. Wallace", title = "The {JPEG} still picture compression o_ @Article{Warmuth:1997:SCL, author = "M. Warmuth", title = "Sample compression, learnability, and the @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:4m[ @Article{Vovk:2006:WCP, author = "Vladimir Vovk", title = "Well-calibrated predictions from on-line compression models", journal = j-THEOR-COMP-SCI, volume = "364", number = "1", pages = "10--26", day = "2", month = nov, year = "2006", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Tue Mar 29 08:55:22 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/tcs2005.bib; http://www.sciencedirect.com/science/journal/03043975", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", } A @Article{Vitter:1996:OPD, author = "Jeffrey Scott Vitter and P. Krishnan", title = "Optimal prefetching via data compression", journal = j-J-ACM, volume = "43", number = "5", pages = "771--793", month = sep, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://w4 @Article{Vlachos:2015:CMF, author = "Michail Vlachos and Nikolaos M. Freris and Anastasios Kyrillidis", title = "Compressive mining: fast and optimal data mining in the compressed domain", journal = j-VLDB-J, volume = "24", number = "1", pages = "1--24", month = feb, year = "2015", CODEN = "VLDBFR", DOI = "https://doi.org/10.1007/s00778-014-0360-3", ISSN = cT) @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", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }P! @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", 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/p( 4^V3+5W;57E};[5W9articledatacompression.bibLempel:1976:CFSA. Lempel and J. ZivOn the Complexity of Finite Sequencesj-IEEE-TRANS-INF-THEORY22175--811976IETTAW0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsA. Lempel and J. ZivOn the Complexity of Finite Sequences @Article{Lempel:1976:CFS, author = "A. Lempel and J. Ziv", title = "On the Complexity of Finite Sequences", journal = j-IEEE-TRANS-INF-THEORY, volume = "22", number = "1", pages = "75--81", year = "1976", CODEN = "IETTAW", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }]]U!3'UgQ5E};Ugtechreportdatacompression.bibHunt:1976:ADFJames W. Hunt and M. Douglas McIlroyAn Algorithm for Differential File ComparisonComputing Science Technical Report41Bell LabsMurray Hill, NJ, USAjun61976Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsJames W. Hunt and M. Douglas McIlroyAn Algorithm for Differential File Comparison @TechReport{Hunt:1976:ADF, author = "James W. Hunt and M. Douglas McIlroy", title = "An Algorithm for Differential File Comparison", type = "Computing Science Technical Report", number = "41", institution = "Bell Labs", address = "Murray Hill, NJ, USA", pages = "??", month = jun, year = "1976", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = 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.", } "N @Article{Moore:1998:DCY, author = "Robert L. Moore and D. Gregory Foley", title = "Date Compression and {Year 2000} Challenges", journal = j-DDJ, volume = "23", number = "5", pages = "20--22, 24, 109", month = may, year = "1998", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Wed Apr 1 16:59:28 MST 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URS' @Article{Mohsenian:1999:SPC, author = "N. Mohsenian and R. Rajagopalan and C. A. Gonzales", title = "Single-pass constant- and variable-bit-rate {MPEG-2} video compression", journal = j-IBM-JRD, volume = "43", number = "4", pages = "489--509", month = jul, year = "1999", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Mon Feb 12 08:11:45 2001", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; http://www.research.ibm.com/journal/", URL = "http://www.research.ibm.com/journal/rd/434/mohsenian.html", acknowledgement = ack-nhfb, fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", } @Article{Moffat:2006:BCL, author = "Alistair Moffat and Vo Ngoc Anh", title = "Binary Codes for Locally Homogeneous Sequences", journal = j-INFO-PROC-LETT, volume = "99", number = "5", pages = "175--180", day = "15", month = sep, year = "2006", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Sat Jan 26 12:46:16 MST<[7 @Article{Moffat:2000:BIC, author = "Alistair Moffat and Lang Stuiver", title = "Binary Interpolative Coding for Effective Index Compression", journal = j-INF-RETR, volume = "3", number = "1", pages = "25--47", month = jul, year = "2000", CODEN = "IFRTFY", ISSN = "1386-4564 (print), 1573-7659 (electronic)", ISSN-L = "1386-4564", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, fjournal = "Information Retrieval", rawdata = "Moffat, Alistair and Lang Stuiver (2000) ``Binary Interpolative Coding for Effective Index Compression,'' {\it Information Retrieval}, {\bf3}(1):25--47, July.", }gO @Article{Moffat:1998:ACR, author = "Alistair Moffat and Radford M. Neal and Ian H. Witten", title = "Arithmetic Coding Revisited", journal = j-TOIS, volume = "16", number = "3", pages = "256--294", month = jul, year = "1998", CODEN = "ATISET", ISSN = "1046-8188", ISSN-L = "0734-2047", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.acm.org/2e @Article{Moffat:1997:ESI, author = "A. Moffat", title = "Editorial for Special Issue on Lossless Compression", journal = j-COMP-J, volume = "40", number = "2--3", pages = "65--66", month = "????", year = "1997", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/40.2/3.65", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Wed Juce = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A new algorithm is presented for constructing auxiliary digital search trees to aid in 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.", }_J- =J}-Z7 @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", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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 =# @Article{Cantone:2012:ABM, author = "Domenico Cantone and Simone Faro and Emanuele Giaquinta", title = "Adapting {Boyer--Moore}-Like Algorithms for Searching {Huffman} Encoded Texts", journal = j-INT-J-FOUND-COMP-SCI, volume = "23", number = "2", pages = "343--356", month = feb, year = "2012", CODEN = "IFCSEN", DOI = "https://doi.org/10.1142/S0129054112400163" b @Article{Caillaud:2016:GPC, author = "F. Caillaud and V. Vidal and F. Dupont and G. Lavou{\'e}", title = "Geometry: Progressive compression of arbitrary textured meshes", journal = j-CGF, volume = "35", number = "7", pages = "475--484", month = oct, year = "2016", CODEN = "CGFODY", DOI = "https://doi.org/10.1111/cgf.13044", ISSN = "0167-7055 (print), 1467-8659 (electronic)", ISSN-L = "0167-7055", bibdate = "Fri Oct 28 10:54:56 MDT 2016", bibsource = "http://www.math.utah.edu/pub/tex/bib/cgf.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "Computer Graphics World", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/", } \ P6m @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", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu May 30 09:41:10 9цR% @Article{Bredies:2012:TVB, author = "K. Bredies and M. Holler", title = "A Total Variation-Based {JPEG} Decompression Model", journal = j-SIAM-J-IMAGING-SCI, volume = "5", number = "1", pages = "366--393", month = "????", year = "2012", CODEN = "SJISBI", DOI = "https://doi.org/10.1137/110833531", ISSN = "1936-4954", bibdate = "Tue Oct 30 14:27:32 MDT 2012", bibsource = "http://epubs.siam.org/SIIMS/siims_toc.html; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/siamjimagingsci.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Imaging Sciences", journal-URL = "http://epubs.siam.org/siims", onlinedate = "January 2012", }זS' @Article{Bookstein:1997:MWO, author = "A. Bookstein and S. T. Klein and T. Raita", title = "Modeling Word Occurrences for the Compression of Concordances", journal = j-TOIS, volume = "15", number = "3", pages = "254--290", month = jul, year = "1997", CODEN = "ATISET", ISSN = "1046-8188", ISSN-L = "0734-2047", bibdate = "Sat Jan 16 19:04:41 MST 1999", bibsource N z_Z 313w57E;qe33wuarticledatacompression.bibMcCreight:1976:SESEdward M. McCreightA Space-Economical Suffix Tree Construction Algorithmj-J-ACM232262--272apr41976JACOAH0004-5411 (print), 1557-735X (electronic) OR 00045411 (print), 1557735X (electronic)0004-5411 OR 00045411Sat Jan 26 12:46:16 MST 2013Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib2013.01.26 12:46:16 MSTA new algorithm is presented for constructing auxiliary digital search trees to aid in 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.Journal of the Association for Computing Machinerycomputer programming; information science --- Information Retrievalack-dshttp://portal.acm.org/browse_dl.cfm?idx=J401J Assoc Comput MachA 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.Edward M. McCreightA Space-Economical Suffix Tree Construction Algorithm @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", 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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A new algorithm is presented for constructing auxiliary digital search trees to aid in 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.", }imager/imager.76.bib; http://www.math.utah.edu/pub/tex/bib/cvgip.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = 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", }` FFBaX 3/9%W5C7;e)9mphdthesisdatacompression.bibNussbaum:1976:SCAHoward Steven NussbaumSource Coding and Adaptive Data Compression for Communication NetworksPh.D. thesisUniversity of California, Los AngelesLos Angeles, CA, USA2201976Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302826487Systems designack-nhfbHoward Steven NussbaumSource Coding and Adaptive Data Compression for Communication Networks @PhdThesis{Nussbaum:1976:SCA, author = "Howard Steven Nussbaum", title = "Source Coding and Adaptive Data Compression for Communication Networks", type = "{Ph.D.} thesis", school = "University of California, Los Angeles", address = "Los Angeles, CA, USA", pages = "220", year = "1976", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302826487", acknowledgement = ack-nhfb, classification = "0790: Systems design", dissertation-thesis-number = "7707677", subject = "Systems design", }r`W 3+-y77CC;Y'wG1yarticledatacompression.bibMorrin:1976:CLCT. H. Morrin, IIChain-Link Compression of Arbitrary Black-White Imagesj-CGIP52172--189jun61976CGIPBG0146-664X OR 0146664X0146-664X OR 0146664XFri Feb 7 08:07:49 MST 1997Compendex database; Graphics/imager/imager.76.bib; http://www.math.utah.edu/pub/tex/bib/cvgip.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.02.07 08:07:49 MSTComputer Graphics and Image Processingcharacter recognition equipment; data processing --- Data Reduction and Analysis; encoding graphical data, data compression; image processingack-nhfbhttp://www.sciencedirect.com/science/journal/0146664XComput Graphics Image ProcessT. H. {Morrin, II}Chain-Link Compression of Arbitrary Black-White Images @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", ISSN = "0146-664X", ISSN-L = "0146-664X", bibdate = "Fri Feb 7 08:07:49 MST 1997", bibsource = "Compendex database; Graphics/imager/imager.76.bib; http://www.math.utah.edu/pub/tex/bib/cvgip.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = 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", }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", }b *cY 3/)q57!E+;[mM%G)uEarticledatacompression.bibRissanen:1976:GKIJ. J. RissanenGeneralized Kraft Inequality and Arithmetic Codingj-IBM-JRD203198--203may51976IBMJAE0018-8646 (print), 2151-8556 (electronic) OR 00188646 (print), 21518556 (electronic)0018-8646 OR 0018864694A1054 \#12359Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; http://www.research.ibm.com/journal/2013.01.26 12:46:16 MSTIBM Journal of Research and Developmentarithmetic coding; associated entropy; coding speed; decoding; encoding; finite alphabet; finite strings; generalised Kraft inequalityack-dsB6120B (Codes); C6130 (Data handling techniques)IBM Res. Lab., San Jose, CA, USAhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520Jack K. WolfT Theoretical or MathematicalJ. J. RissanenGeneralized {Kraft} Inequality and Arithmetic Coding @Article{Rissanen:1976:GKI, author = "J. J. Rissanen", title = "Generalized {Kraft} Inequality and Arithmetic Coding", journal = j-IBM-JRD, volume = "20", number = "3", pages = "198--203", month = may, year = "1976", CODEN = "IBMJAE", 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 = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; http://www.research.ibm.com/journal/", acknowledgement = 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", }4bV 3)3q1/C7;e93q}phdthesisdatacompression.bibPasco:1976:SCARichard Clark PascoSource Coding Algorithms for Fast Data CompressionPh.D. DissertationDepartment of Electrical Engineering, Stanford UniversityStanford, CA, USA1131976Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302770683Electrical engineeringack-dsRichard Clark PascoSource Coding Algorithms for Fast Data Compression @PhdThesis{Pasco:1976:SCA, author = "Richard Clark Pasco", title = "Source Coding Algorithms for Fast Data Compression", type = "{Ph.D.} Dissertation", school = "Department of Electrical Engineering, Stanford University", address = "Stanford, CA, USA", pages = "113", year = "1976", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302770683", acknowledgement = 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", }an 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; http://www.research.ibm.com/journal/", acknowledgement = 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", }c . .OfX '3'7uK;C7;e+7ucmastersthesisdatacompression.bibSnow:1976:ICTRoderick Charles SnowAn investigation of clustering techniques, query methods and data base compression with respect to the enlist systemM.Sc.C.S.The University of New BrunswickFredericton, NB, Canada1976Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302820785Library scienceack-nhfbRoderick Charles SnowAn investigation of clustering techniques, query methods and data base compression with respect to the enlist system @MastersThesis{Snow:1976:ICT, author = "Roderick Charles Snow", title = "An investigation of clustering techniques, query methods and data base compression with respect to the enlist system", type = "{M.Sc.C.S.}", school = "The University of New Brunswick", address = "Fredericton, NB, Canada", pages = "????", year = "1976", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302820785", acknowledgement = ack-nhfb, classification = "0399: Library science", dissertation-thesis-number = "MK30462", subject = "Library science", }{eZ 3)#U57E ;W?{MAc!C[#Uoarticledatacompression.bibRubin:1976:ETFFrank RubinExperiments in Text File Compressionj-CACM1911617--623nov111976CACMA20001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 00010782Mon Jan 22 07:17:30 MST 2001Compendex database; http://dblp.uni-trier.de/db/journals/cacm/cacm19.html#Rubin76; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/}wdW 3/))7E};_)'articledatacompression.bibRoetling:1976:HMEP. G. RoetlingHalftone Method with Edge Enhancement and Moire Suppressionj-J-OPT-SOC-AM66985--9891976JOSAAH0030-3941 OR 00303941Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTJournal of the Optical Society of Americaack-dsP. G. RoetlingHalftone Method with Edge Enhancement and Moir{\'e} Suppression @Article{Roetling:1976:HME, author = "P. G. Roetling", title = "Halftone Method with Edge Enhancement and Moir{\'e} Suppression", journal = j-J-OPT-SOC-AM, volume = "66", pages = "985--989", year = "1976", CODEN = "JOSAAH", ISSN = "0030-3941", ISSN-L = "", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }http://dblp.uni-trier.de/db/journals/cacm/cacm19.html#Rubin76; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", abstract = "A system for the compression of data files, viewed as strings of characters, is presented. \par The method is general, and applies equally well to English, to PL/I, or to digital data. The system consists of an encoder, an analysis program, and a decoder. \par Two algorithms for encoding a string differ slightly from earlier proposals. The analysis program attempts to find an optimal set of codes for representing substrings of the file. Four new algorithms for this operation are described and compared. Various parameters in the algorithms are optimized to obtain a high degree of compression for sample texts.", acknowledgement = 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", }ebib/datacompression.bib2001.01.22 07:17:30 MSTA system for the compression of data files, viewed as strings of characters, is presented. par The method is general, and applies equally well to English, to PL/I, or to digital data. The system consists of an encoder, an analysis program, and a decoder. par Two algorithms for encoding a string differ slightly from earlier proposals. The analysis program attempts to find an optimal set of codes for representing substrings of the file. Four new algorithms for this operation are described and compared. Various parameters in the algorithms are optimized to obtain a high degree of compression for sample texts.Communications of the ACManalysis program; comparison of algorithms; computer programming --- Subroutines; data file compaction; data processing; decoder; encoder; Huffman codes; N-gram encoding; strings of characters; text compression; text editing; text file compressionack-nhfbC6130 (Data handling techniques)IBM, Poughkeepsie, NY, USAhttp://portal.acm.org/browse_dl.cfm?idx=J79Commun ACMP Practical; X ExperimentalA system for the compression of data files, viewed as strings of characters, is presented. \par The method is general, and applies equally well to English, to PL/I, or to digital data. The system consists of an encoder, an analysis program, and a decoder. \par Two algorithms for encoding a string differ slightly from earlier proposals. The analysis program attempts to find an optimal set of codes for representing substrings of the file. Four new algorithms for this operation are described and compared. Various parameters in the algorithms are optimized to obtain a high degree of compression for sample texts.Frank RubinExperiments in Text File Compression @Article{Rubin:1976:ETF, author = "Frank Rubin", title = "Experiments in Text File Compression", journal = j-CACM, volume = "19", number = "11", pages = "617--623", month = nov, year = "1976", CODEN = "CACMA2", 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; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", abstract = "A system for the compression of data files, viewed as strings of characters, is presented. \par The method is general, and applies equally well to English, to PL/I, or to digital data. The system consists of an encoder, an analysis program, and a decoder. \par Two algorithms for encoding a string differ slightly from earlier proposals. The analysis program attempts to find an optimal set of codes for representing substrings of the file. Four new algorithms for this operation are described and compared. Various parameters in the algorithms are optimized to obtain a high degree of compression for sample texts.", acknowledgement = 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", } _h] !3-'';U3#777EI;I'313'I'A$techreportdatacompression.bibAronson:1977:CSTJules AronsonComputer science and technology: data compression --- a comparison of methodsNBS special publication500-12Department of Commerce, National Bureau of Standards, Institute for Computer Sciences and TechnologyWashington, DC, USAiv + 31 + 1jun61977XNBSAV0083-1883 OR 008318830083-1883 OR 00831883QC100 .U57 no. 500-12Mon Jan 28 15:18:45 MST 2013clio-db.cc.columbia.edu:7090/Voyager; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; libraries.colorado.edu:210/INNOPAC; z3950.loc.gov:7090/Voyager2013.01.28 15:18:45 MSTERIC Document Number: ED149732http://ucblibraries.colorado.edu/circulation/forms/ericrequest.htm; http://www.eric.ed.gov/contentdelivery/servlet/ERICServlet?accno=ED149732This report delineates the theory and terminology of data compression. It surveys four data compression methods--null suppression, pattern substitution, statistical encoding, and telemetry compression--and relates them to a standard statistical coding problem, i.e., the noiselexgV 3)'k!!CQ%E_;g'kbookdatacompression.bibWirth:1976:ADSNiklaus WirthAlgorithms $ + $ Data Structures $ = $ Programspub-PHpub-PH:adrSecondxvii + 36619760-13-022418-9 OR 0130224189978-0-13-022418-7 OR 9780130224187QA76.6 .W561Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/master.bib2013.01.26 12:46:16 MSTPrentice-Hall Series in Automatic Computationack-dsNiklaus WirthAlgorithms $ + $ Data Structures $ = $ Programs @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 = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://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.", }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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; libraries.colorado.edu:210/INNOPAC; z3950.loc.gov:7090/Voyager", note = "ERIC Document Number: ED149732", URL = "http://ucblibraries.colorado.edu/circulation/forms/ericrequest.htm; http://www.eric.ed.gov/contentdelivery/servlet/ERICServlet?accno=ED149732", abstract = "This report delineates the theory and terminology of data compression. It surveys four data compression 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.", }hss coding problem. The well defined solution to that problem can serve as a standard on which to base the effectiveness of data compression methods. The simple measure described for calculating the effectiveness of a data compression method is based on the characterization of the solution to the noiseless coding problem. Finally, guidelines are stated concerning the relevance of data compression to data processing applications. (Author/DAG).Data compression (Computer science); Coding theory; Comparative Analysis; Computer Programs; Computer Storage Devices; Cost Effectiveness; Data Processing; Databases; Federal Government; Guidelines; Information Scientists; Information Storage; Information Theory; Standards.ack-nhfbThis 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).Jules AronsonERIC Document Number: ED149732Computer science and technology: data compression --- a comparison of methods @TechReport{Aronson:1977:CST, author = "Jules Aronson", title = "Computer science and technology: data compression --- a comparison of methods", type = "NBS special publication", number = "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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; libraries.colorado.edu:210/INNOPAC; z3950.loc.gov:7090/Voyager", note = "ERIC Document Number: ED149732", URL = "http://ucblibraries.colorado.edu/circulation/forms/ericrequest.htm; http://www.eric.ed.gov/contentdelivery/servlet/ERICServlet?accno=ED149732", abstract = "This report delineates the theory and terminology of data compression. It surveys four data compression 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.", }:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; http://www.research.ibm.com/journal/", acknowledgement = 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", }i ;8;zjX 3''%/;C7;e9'?phdthesisdatacompression.bibChen:1977:DCBPo Hsiin ChenData Compression for Binary and Multi-Level Satellite ImageryPh.D. thesisPurdue UniversityWest Lafayette, IN, USA1761977Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302819991Electrical engineeringack-nhfbPo Hsiin ChenData Compression for Binary and Multi-Level Satellite Imagery @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/; http://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", }Ei[ 3-1I57'!E+;[C+G1I# articledatacompression.bibChaitin:1977:AITGregory J. ChaitinAlgorithmic Information Theoryj-IBM-JRD214350--359jul71977IBMJAE0018-8646 (print), 2151-8556 (electronic) OR 00188646 (print), 21518556 (electronic)0018-8646 OR 0018864694A15 (68A20)56 \#15151Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; http://www.research.ibm.com/journal/2013.01.26 12:46:16 MSTIBM Journal of Research and Developmentalgorithm theory; algorithmic information theory; functions; information theory; probability; recursive; recursive function theoryack-dsB0240Z (Other topics in statistics); B6110 (Information theory); C1260 (Information theory); C4210 (Formal logic); C4240 (Programming and algorithm theory)IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USAhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520Robert P. DaleyT Theoretical or MathematicalGregory J. ChaitinAlgorithmic Information Theory @Article{Chaitin:1977:AIT, author = "Gregory J. Chaitin", title = "Algorithmic Information Theory", journal = j-IBM-JRD, volume = "21", number = "4", pages = "350--359", month = jul, year = "1977", CODEN = "IBMJAE", 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 = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; http://www.research.ibm.com/journal/", acknowledgement = 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", } VlX 3/- ;57E};[- articledatacompression.bibLawrence:1977:NUCJohn C. LawrenceA New Universal Coding Scheme for the Binary Memoryless Sourcej-IEEE-TRANS-INF-THEORY234466--472jul71977IETTAW0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsJohn C. LawrenceA New Universal Coding Scheme for the Binary Memoryless Source @Article{Lawrence:1977:NUC, author = "John C. Lawrence", title = "A New Universal Coding Scheme for the Binary Memoryless Source", journal = j-IEEE-TRANS-INF-THEORY, volume = "23", number = "4", pages = "466--472", month = jul, year = "1977", CODEN = "IETTAW", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }ukX3'{ /!57E};S{ Garticledatacompression.bibChen:1977:FCAWen-Hsiung Chen and C. Harrison Smith and S. C. FralickA Fast Computational Algorithm For the Discrete Cosine Transformj-IEEE-TRANS-COMM2591004--1009sep91977IECMBT0090-6778 (print), 1558-0857 (electronic) OR 00906778 (print), 15580857 (electronic)0090-6778 OR 00906778Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Communicationsack-dsWen-Hsiung Chen and C. Harrison Smith and S. C. FralickA Fast Computational Algorithm For the Discrete Cosine Transform @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", ISSN = "0090-6778 (print), 1558-0857 (electronic)", ISSN-L = "0090-6778", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", } ",Y @Article{Rossling:2009:VCA, author = "Guido R{\"o}{\ss}ling and Florian Lindner", title = "Visualizing compression algorithms on-the-fly", journal = j-SIGCSE, volume = "41", number = "3", pages = "376--376", month = sep, year = "2009", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1595496.1563018", ISSN = "0097-8418", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 15:4 cG @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 _? @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", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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{Ross:1994:ROD, author = "John W. Ross", title = "Record-Oriented Data Compression", journal = j-CUJ, volume = "12", number = "4", pages = "83--??", month = apr, year = "1994", ISSN = "0898-9788", bibdate = "Fri Aug 30 16:52:23 MDT 1996", bibsource = "http://www.cuj.com/cbklist.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "C Users Journal", }) @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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "C Users Journal", } K @PhdThesis{Sandman:1989:EPA, author = "Aubrey Max Sandman", title = "Errors --- a Positive Approach (Polynomial Data Compression)", type = "{Ph.D.} thesis", school = "The City University", address = "London, UK", pages = "187", year = "1989", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303820371", acknowledgement = ack-nhfb, classification = "0790: Systems design", dissertation-thesis-number = "DX92220", subject = "Systems design", }C @PhdThesis{Rubinstein:1988:SCC, author = "Roy Steven Rubinstein", title = "Structural complexity classes of sparse sets: Intractability, data compression and printability", type = "{Ph.D.} thesis", school = "Northeastern University", address = "Boston, MA, USA", pages = "79", year = "1988", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303720650", acknowledgement = ack-nhfb, classification = "0984: Computer science", dissertation-thesis-number = "8904853", subject = "Computer science", }(E @PhdThesis{Roy:1987:CES, author = "Bimal Chandra Roy", title = "Compression of Equally Spaced Digital Elevation Model (Dem) Data", type = "{Ph.D.} thesis", school = "The Ohio State University", address = "Columbus, OH, USA", pages = "268", year = "1987", bibdate = "Fri Feb 1 08:42:55 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303501021", acknowledgement = ack-nhfb, classification = "0370: Earth", dissertation-thesis-number = "8726719", subject = "Earth", } V33SS;57E};[SS9 articledatacompression.bibKrichevsky:1981:PUCR. E. Krichevsky and V. K. TrofimovThe Performance of Universal Codingj-IEEE-TRANS-INF-THEORYIT-27199--207mar31981IETTAW0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsR. E. Krichevsky and V. K. TrofimovThe Performance of Universal Coding @Article{Krichevsky:1981:PUC, author = "R. E. Krichevsky and V. K. Trofimov", title = "The Performance of Universal Coding", journal = j-IEEE-TRANS-INF-THEORY, volume = "IT-27", pages = "199--207", month = mar, year = "1981", CODEN = "IETTAW", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }tX 3')G%=3C7;e9)G)phdthesisdatacompression.bibFong:1981:DOAChung-Bin FongThe Decision Oriented Approach to Information-Preserving Data Compression of Digitized ImagesPh.D. thesisUniversity of PittsburghPittsburgh, PA, USA1471981Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303140921Electrical engineeringack-nhfbChung-Bin FongThe Decision Oriented Approach to Information-Preserving Data Compression of Digitized Images @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/; http://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", } X 3%%%97C7;e9%Gphdthesisdatacompression.bibLee:1981:DCSDong Hee LeeData Compression with Source Coding for Unknown Source StatisticsPh.D. thesisUniversity of MarylandCollege Park, MD, USA861981Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303164012Electrical engineeringack-nhfbDong Hee LeeData Compression with Source Coding for Unknown Source Statistics @PhdThesis{Lee:1981:DCS, author = "Dong Hee Lee", title = "Data Compression with Source Coding for Unknown Source Statistics", type = "{Ph.D.} thesis", school = "University of Maryland", address = "College Park, MD, USA", pages = "86", year = "1981", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303164012", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8205240", subject = "Electrical engineering", }|V3-U}/57E};SU}; articledatacompression.bibLangdon:1981:CBWGlen G. Langdon and ~and J. RissanenCompression of Black White Images with Arithmetic Codingj-IEEE-TRANS-COMMCOM-296858--867jun61981IECMBT0090-6778 (print), 1558-0857 (electronic) OR 00906778 (print), 15580857 (electronic)0090-6778 OR 00906778Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Communicationsack-dsGlen G. Langdon and ~and J. RissanenCompression of Black White Images with Arithmetic Coding @Article{Langdon:1981:CBW, author = "Glen G. Langdon and ~and J. Rissanen", title = "Compression of Black White Images with Arithmetic Coding", journal = j-IEEE-TRANS-COMM, volume = "COM-29", number = "6", pages = "858--867", month = jun, year = "1981", CODEN = "IECMBT", ISSN = "0090-6778 (print), 1558-0857 (electronic)", ISSN-L = "0090-6778", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", } \ P\pY 3++{57=C;%?c+)[articledatacompression.bibMiller:1981:LESLance A. MillerLetter to the Editor: On Spelling Correction and Beyondj-CACM249608--609sep91981CACMA20001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 00010782Sun Feb 04 16:49:22 1996http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib1996.02.04 16:49:22 ???See cite Peterson:1980:CPD,Dunlavey:1981:LES,Nix:1981:ESE,Peterson:1981:LES.Communications of the ACMack-nhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Lance A. MillerSee \cite{Peterson:1980:CPD,Dunlavey:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.Letter to the {Editor}: On Spelling Correction and Beyond @Article{Miller:1981:LES, author = "Lance A. Miller", title = "Letter to the {Editor}: On Spelling Correction and Beyond", journal = 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 = "http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib", note = "See \cite{Peterson:1980:CPD,Dunlavey:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", },X'3)W-EA;sWq inproceedingsdatacompression.bibLynch:1981:ADCClifford A. Lynch and E. B. BrownriggApplication of Data Compression to a Large Bibliographic Data BaseZaniolo:1981:VLD435--4471981Fri Jan 12 07:50:27 MST 2001http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/vldb.bib; http://www.vldb.org/dblp/db/conf/vldb/vldb81.html2001.01.12 07:50:27 MSThttp://www.vldb.org/dblp/db/conf/vldb/LynchB81.htmlack-nhfbClifford A. Lynch and E. B. BrownriggApplication of Data Compression to a Large Bibliographic Data Base @InProceedings{Lynch:1981:ADC, author = "Clifford A. Lynch and E. B. Brownrigg", title = "Application of Data Compression to a Large Bibliographic Data Base", crossref = "Zaniolo:1981:VLD", pages = "435--447", year = "1981", bibdate = "Fri Jan 12 07:50:27 MST 2001", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/vldb.bib; http://www.vldb.org/dblp/db/conf/vldb/vldb81.html", URL = "http://www.vldb.org/dblp/db/conf/vldb/LynchB81.html", acknowledgement = 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", } q qO @Article{Rytter:2003:ALZ, author = "Wojciech Rytter", title = "Application of {Lempel--Ziv} factorization to the approximation of grammar-based compression", journal = j-THEOR-COMP-SCI, volume = "302", number = "1--3", pages = "211--222", day = "13", month = jun, year = "2003", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Wed Nov 5 08:45:40 MST 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/tcs2000.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", }0\9 @Article{Sadakane:1999:CDT, author = "K. Sadakane and H. Imai", title = "A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the {Burrows--Wheeler} Transformation", journal = j-LECT-NOTES-COMP-SCI, volume = "1552", pages = "434--445", year = "1999", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Sep 14 06:09:05 MDT 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", keywords = "ADT; conceptual modelling; database technologies; mobile data access; spatio-; temporal data management", }69 @Article{Rytter:2002:ALZ, author = "Wojciech Rytter", title = "Application of {Lempel--Ziv} Factorization to the Approximation of Grammar-Based Compression", journal = j-LECT-NOTES-COMP-SCI, volume = "2373", pages = "20--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Sep 10 19:09:57 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2373.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2373/23730020.htm; http://link.springer-ny.com/link/service/series/0558/papers/2373/23730020.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Ryabko:1987:CLA, author = "B. Ya. Ryabko and R. Nigel Horspool and Gordon V. Cormack", title = "Comments to: {``A locally adaptive data compression scheme'' [Comm. ACM {\bf 29}, 1986, 4, 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 = Ad# @Article{Sadeh:1996:ODC, author = "I. Sadeh", title = "Optimal data compression algorithm", journal = j-COMPUT-MATH-APPL, volume = "32", number = "5", pages = "57--72", month = sep, year = "1996", CODEN = "CMAPDK", ISSN = "0898-1221 (print), 1873-7668 (electronizu @Article{Ruiters:2009:AMR, author = "Roland Ruiters and Reinhard Klein", title = "Appearance Measurement and Rendering: {BTF} Compression via Sparse Tensor Decomposition", journal = j-CGF, volume = "28", number = "4", pages = "1181--1188", month = jun, year = "2009", CODEN = "CGFODY", DOI = "https://doi.org/10.1111/j.1467-8659.2009.01495.x", ISSN = "0167-7055 (print) 12:46:16 MST 2013", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Nix81; http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib", acknowledgement = 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", } &Y 3%'W57EC;?Oc'uarticledatacompression.bibNix:1981:ESERobert P. NixExperience With a Space Efficient Way to Store a Dictionaryj-CACM245297--2981981CACMA2https://doi.org/10.1145/358645.3586540001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 00010782Sat Jan 26 12:46:16 MST 2013http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Nix81; http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib2013.01.26 12:46:16 MSTCommunications of the ACMComment on cite Peterson:1981:LESack-dshttp://portal.acm.org/browse_dl.cfm?idx=J79Robert P. NixExperience With a Space Efficient Way to Store a Dictionary @Article{Nix:1981:ESE, author = "Robert P. Nix", title = "Experience With a Space Efficient Way to Store a Dictionary", journal = 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; http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib", acknowledgement = 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", } IV 3/)a!57E};)aKarticledatacompression.bibReghbati:1981:ODCH. K. ReghbatiAn Overview of Data Compression Techniquesj-COMPUTER14471--761981CPTRB40018-9162 (print), 1558-0814 (electronic) OR 00189162 (print), 15580814 (electronic)0018-9162 OR 00189162Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTComputerack-dshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2H. K. ReghbatiAn Overview of Data Compression Techniques @Article{Reghbati:1981:ODC, author = "H. K. Reghbati", title = "An Overview of Data Compression Techniques", journal = j-COMPUTER, volume = "14", number = "4", pages = "71--76", year = "1981", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }sY 3//{57=C;!?c/%_articledatacompression.bibPeterson:1981:LESJames L. PetersonLetter to the Editor: On Spelling Correction and Beyondj-CACM249609--609sep91981CACMA20001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 00010782Sun Feb 04 16:49:21 1996http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib1996.02.04 16:49:21 ???See cite Peterson:1980:CPD,Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE.Communications of the ACMack-nhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79James L. PetersonSee \cite{Peterson:1980:CPD,Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE}.Letter to the {Editor}: On Spelling Correction and Beyond @Article{Peterson:1981:LES, author = "James L. Peterson", title = "Letter to the {Editor}: On Spelling Correction and Beyond", journal = 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 = "http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib", note = "See \cite{Peterson:1980:CPD,Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", }cm/cacm24.html#RobinsonS81; http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib", acknowledgement = 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", } d W3/IS57EO;?cISarticledatacompression.bibRobinson:1981:ASCP. J. Robinson and Dave SingerAnother Spelling Correction Programj-CACM245296--2971981CACMA20001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 00010782Sat Jan 26 12:46:16 MST 2013http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#RobinsonS81; http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib2013.01.26 12:46:16 MSTCommunications of the ACMack-dshttp://portal.acm.org/browse_dl.cfm?idx=J79P. J. Robinson and Dave SingerAnother Spelling Correction Program @Article{Robinson:1981:ASC, author = "P. J. Robinson and Dave Singer", title = "Another Spelling Correction Program", journal = j-CACM, volume = "24", number = "5", pages = "296--297", year = "1981", CODEN = "CACMA2", 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; http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib", acknowledgement = 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", }12:46:16 MST 2013", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = 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.", } k"V 3-7=%3/C7;e97=aphdthesisdatacompression.bibStewart:1981:TDCLawrence Colm StewartTrellis Data CompressionPh.D. thesisStanford UniversityStanford, CA, USA1371981Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/303177936Electrical engineeringack-nhfbLawrence Colm StewartTrellis Data Compression @PhdThesis{Stewart:1981:TDC, author = "Lawrence Colm Stewart", title = "Trellis Data Compression", type = "{Ph.D.} thesis", school = "Stanford University", address = "Stanford, CA, USA", pages = "137", year = "1981", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303177936", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8124158", subject = "Electrical engineering", }!W3)q57EQ;qeq articledatacompression.bibRodeh:1981:LADMichael Rodeh and Vaughan R. Pratt and Shimon EvenLinear Algorithm for Data Compression via String Matchingj-J-ACM28116--24jan11981JACOAH0004-5411 (print), 1557-735X (electronic) OR 00045411 (print), 1557735X (electronic)0004-5411 OR 00045411Sat Jan 26 12:46:16 MST 2013ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib2013.01.26 12:46:16 MSTJournal of the Association for Computing Machineryack-dshttp://portal.acm.org/browse_dl.cfm?idx=J401Michael Rodeh and Vaughan R. Pratt and Shimon EvenLinear Algorithm for Data Compression via String Matching @Article{Rodeh:1981:LAD, author = "Michael Rodeh and Vaughan R. Pratt and Shimon Even", title = "Linear Algorithm for Data Compression via String Matching", journal = j-J-ACM, volume = "28", number = "1", pages = "16--24", month = jan, year = "1981", CODEN = "JACOAH", 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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://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.", } S&[3)q57E ;s]}sqSarticledatacompression.bibIshii:1982:HEDAtsushi Ishii and Kenji Kouno and Yasunori MaezawaHighly Efficient Data Compression Method for Newspaper Image Dataj-FUJITSU-SCI-TECH-JV 18N 2199--225jun61982FUSTA40016-2523 OR 00162523Mon Dec 16 08:30:04 MST 1996Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/typeset.bib1996.12.16 08:30:04 MSTA highly efficient image data compression unit is considered which reduces data file size and data transfer time in computerized typesetting systems. In a study of the correlation between picture elements, it is found that in the prǡ%[3'?a[57CS;35Y[O#?eMarticledatacompression.bibBell:1982:KSCD. A. Bell and S. M. DeenKey Space Compression and Hashing in PRECIj-COMP-J254486--492nov111982CMPJA6https://doi.org/10.1093/comjnl/25.4.4860010-4620 (print), 1460-2067 (electronic) OR 00104620 (print), 14602067 (electronic)0010-4620 OR 00104620Tue Dec 4 14:48:13 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/25/4.toc; http://www.matĊ8$Y 3131a9E5;7bookdatacompression.bibAnonymous:1982:DCHAnonymousData compression hardware and software market: Data compression products in the U.SFrost and Sullivan106 Fulton Strett, New York 10038, NY, USAvii + 184may51982HD9696.D383 U6316 1982Mon Jan 28 15:19:07 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; z3950.loc.gov:7090/Voyager2013.01.28 15:19:07 MSTData transmission equipment industry; United States; Market surveysack-nhfbAnonymousData compression hardware and software market: Data compression products in the {U.S} @Book{Anonymous:1982:DCH, author = "Anonymous", title = "Data compression hardware and software market: Data compression products in the {U.S}", publisher = "Frost and Sullivan", address = "106 Fulton Strett, New York 10038, NY, USA", pages = "vii + 184", month = may, year = "1982", LCCN = "HD9696.D383 U6316 1982", bibdate = "Mon Jan 28 15:19:07 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, subject = "Data transmission equipment industry; United States; Market surveys", }!#V 3)Oy%/;C7;e9Oy[phdthesisdatacompression.bibYazdi:1981:ELDMohammad Ali Jezu Tabatabai YazdiEdge Location and Data Compression for Digital ImageryPh.D. thesisPurdue UniversityWest Lafayette, IN, USA1781981Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/303174746Electrical engineeringack-nhfbMohammad Ali Jezu Tabatabai YazdiEdge Location and Data Compression for Digital Imagery @PhdThesis{Yazdi:1981:ELD, author = "Mohammad Ali Jezu Tabatabai Yazdi", title = "Edge Location and Data Compression for Digital Imagery", type = "{Ph.D.} thesis", school = "Purdue University", address = "West Lafayette, IN, USA", pages = "178", year = "1981", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303174746", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8210265", subject = "Electrical engineering", }Dec 4 14:48:13 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/25/4.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/", URL = "http://comjnl.oxfordjournals.org/content/25/4/486.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/486.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/487.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/488.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/489.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/490.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/491.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/492.tif", acknowledgement = 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", } #] n# 3h @Article{Ernvall:1984:ELM, author = "J. Ernvall and O. Nevalainen", title = "Estimating the length of minimal spanning trees in 3 @Article{Elgohary:2016:CLA, author = "Ahmed Elgohary and Matthias Boehm and Peter J. Haas and Frederick R. Reiss and Berthold Reinwald", title = "Compressed linear algebra for large-scale machine learning", journal = j-PROC-VLDB-ENDOWMENT, volume = "9", number = "12", pages = "960--971", month = aug, year = "2016", CODEN = "????", DOI = "https://doi.org/10.147kW @Article{Einarsson:1987:DCD, author = 6o @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", ISSN = "0162-1459 (print), 1537-274X (electronic)", ISSN-L = "0162-14512g @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", ISSN = "0162-1459 (print), 1537-274X (electronic)", ISSN-L = "0162-1459", bibdate ='kW @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", 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; http://www.math.utah.edu/pub/tex/bib/compgraph.bib; http://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", }K @Article{Eichinger:2015:TSC, author = "Frank Eichinger and Pavel Efros and Stamatis Karnouskos and Klemens B{\"o}hm", title = "A time-series compression technique and its application to the smart grid", journal = j-VLDB-J, volume = "24", number = "2", pages = "193--218", month = apr, year = "2015", CODEN = "VLDBFR", DOI = "https://doi.org/10.1007/s00778-014-03?!C @Article{Edwards:2014:PAB, author = "James A. Edwards and Uzi Vishkin", title = "Parallel algorithms for {Burrows--Wheeler} compression and decompression", journal = j-THEOR-COMP-SCI, volume = "525", number = "??", pages = "10--22", day = "13", month = mar, year = "2014", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Mar 8 16:44:06 MST 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/tcs2010.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0304397513007615", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } %h.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/2012.12.04 14:48:13 MSThttp://comjnl.oxfordjournals.org/content/25/4/486.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/486.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/487.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/488.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/489.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/490.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/491.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/492.tifThe Computer Journaldata handling; data processing; database designer's; database management systems; DBMS; direct access performance; hash trees; hashing; key; PRECI; sequential access; space compression; storage; table lookup; tool-kit; utilizationack-nhfbC6120 (File organisation); C6130 (Data handling techniques); C6160 (Database management systems (DBMS))School of Computer Sci., Ulster Polytech., Newtonabbey, UKhttp://comjnl.oxfordjournals.org/P PracticalD. A. Bell and S. M. DeenKey Space Compression and Hashing in {PRECI} @Article{Bell:1982:KSC, author = "D. A. Bell and S. M. Deen", title = "Key Space Compression and Hashing in {PRECI}", journal = 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; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/", URL = "http://comjnl.oxfordjournals.org/content/25/4/486.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/486.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/487.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/488.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/489.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/490.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/491.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/492.tif", acknowledgement = 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", } "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/typeset.bib", abstract = "A highly efficient image data compression unit is considered which reduces data file size and data transfer time in computerized typesetting systems. In a study of the correlation between picture elements, it is found that in the predictive coding method, which reduces redundancy in screen dot image data, the most efficient reference picture elements were information on three neighboring screen dots. Based on this finding, an adaptive predictive split coding method is developed which predicts and encodes screen dot image data and character image data according to the most adaptive reference picture elements. This coding method utilizes a variable length control code system to prevent reduction of the compression factor when different kinds of data are used. It proves to be a highly efficient compression method for encoding fullpage, page segment, and character font data.", acknowledgement = 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", } " 3[7 @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 = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://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", }aC @Article{Lippert:1997:CDV, author = "L. Lippert and M. H. Gross and C. Kurmann", title = "Compression Domain Volume Rendering for Distributed Environments", journal = j-CGF, volume = "16", number = "3", pages = "C95--C107", day = "4--8", month = sep, year = "1997", CODEN = "CGFODY", ISSN = "0167-7055 (print), 1467-8659 (electronic)", ISSN-L = "0167-7055", bqc @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", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }3i @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", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Tue Mar 25 14:26:59 MST 1997", bibsource = "Compendex database; b; @Article{Lindley:1995:JLIb, author = "Craig A. Lindley", title = "{JPEG-Like} Image Compression. Part 2", journal = j-DDJ, volume = "20", number = "8", pages = "62, 64--66, 102--105", month = aug, year = "1995", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 03 09:16:52 1996", bibsource = "Compendex database; http://www.ddj.com/index/author/index.htm; }{ @Article{Lindley:1995:JLIa, author = "Craig A. Lindley", title = "{JPEG}-like Image Compression. Part 1", journal = j-DDJ, volume = "20", number = "7", pages = "50, 52, 54--58", month = jul, year = "1995", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 03 09:16:51 1996", bibsource = "Compendex database; http://www.ddj.com/index/author/index.htm; edictive coding method, which reduces redundancy in screen dot image data, the most efficient reference picture elements were information on three neighboring screen dots. Based on this finding, an adaptive predictive split coding method is developed which predicts and encodes screen dot image data and character image data according to the most adaptive reference picture elements. This coding method utilizes a variable length control code system to prevent reduction of the compression factor when different kinds of data are used. It proves to be a highly efficient compression method for encoding fullpage, page segment, and character font data.Fujitsu scientific and technical journaladaptive predictive split coding; codes, symbolic; control code; image processing; information theory --- data compression; screen dot image data; typesetting --- computer applicationsack-nhfbA highly efficient image data compression unit is considered which reduces data file size and data transfer time in computerized typesetting systems. In a study of the correlation between picture elements, it is found that in the predictive coding method, which reduces redundancy in screen dot image data, the most efficient reference picture elements were information on three neighboring screen dots. Based on this finding, an adaptive predictive split coding method is developed which predicts and encodes screen dot image data and character image data according to the most adaptive reference picture elements. This coding method utilizes a variable length control code system to prevent reduction of the compression factor when different kinds of data are used. It proves to be a highly efficient compression method for encoding fullpage, page segment, and character font data.Atsushi Ishii and Kenji Kouno and Yasunori MaezawaHighly Efficient Data Compression Method for Newspaper Image Data @Article{Ishii:1982:HED, author = "Atsushi Ishii and Kenji Kouno and Yasunori Maezawa", title = "Highly Efficient Data Compression Method for Newspaper Image Data", journal = 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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/typeset.bib", abstract = "A highly efficient image data compression unit is considered which reduces data file size and data transfer time in computerized typesetting systems. In a study of the correlation between picture elements, it is found that in the predictive coding method, which reduces redundancy in screen dot image data, the most efficient reference picture elements were information on three neighboring screen dots. Based on this finding, an adaptive predictive split coding method is developed which predicts and encodes screen dot image data and character image data according to the most adaptive reference picture elements. This coding method utilizes a variable length control code system to prevent reduction of the compression factor when different kinds of data are used. It proves to be a highly efficient compression method for encoding fullpage, page segment, and character font data.", acknowledgement = 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", } _(X 335I+3CQOK1E;e)?Ibookdatacompression.bibMandelbrot:1982:FGNBenoit B. MandelbrotThe Fractal Geometry of Naturepub-W-H-FREEMANpub-W-H-FREEMAN:adrv + 46019820-7167-1186-9 OR 0716711869978-0-7167-1186-5 OR 9780716711865QA447 .M25 1982; QA447 .M357 198200A69 (51-01 54F45 85A35 86A99)665254 (84h:00021)S. DubucSat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTSchriftenreihe fur den Referenten. [Series for the Referee]Revised edition of cite Mandelbrot:1977:FFC.Zbl 0504.28001ack-dsBeno{\^\i}t B. MandelbrotSchriftenreihe f{\"u}r den Referenten. [Series for the Referee]The Fractal Geometry of Nature @Book{Mandelbrot:1982:FGN, author = "Beno{\^\i}t B. Mandelbrot", title = "The Fractal Geometry of Nature", publisher = 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 = "http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Schriftenreihe f{\"u}r den Referenten. [Series for the Referee]", ZMnumber = "Zbl 0504.28001", acknowledgement = 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}.", }'V 3)#O;57E};[#S' articledatacompression.bibLloyd:1982:LSQS. P. LloydLeast Squares Quantization in PCMj-IEEE-TRANS-INF-THEORYIT-28129--137mar31982IETTAW0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:12 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:12 MSTIEEE Transactions on Information Theoryack-dsS. P. LloydLeast Squares Quantization in {PCM} @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", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:12 MST 2013", bibsource = "http://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.", }S. Dubuc", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Schriftenreihe f{\"u}r den Referenten. [Series for the Referee]", ZMnumber = "Zbl 0504.28001", acknowledgement = 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}.", } D" 30A={? @Article{SantaCruz:2001:JIC, author = "Diego {Santa Cruz} and Touradj Ebrahimi and Charilaos Christopoulos", title = "The {JPEG 2000} Image Coding Standard", journal = j-DDJ, volume = "26", number = "4", pages = "46, 48, 50--52, 54", month = apr, year = "2001", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Mar 13 15:22:36 MST 2001", bibsource = "http://www.mah(Q @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 2008uk @Article{Salomon:2000:PCS, author = "David Salomon", title = "Prefix Compression of Sparse Binary Strings", journal = j-CROSSROADS, volume = "6", number = "3", pages = "??--??", month = feb, year = "2000", CODEN = "", ISSN = "1528-4972 (print), 1528-4980 (electronic)", ISSN-L = "1528-4972", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, fjournal = "Crossroads", rawdata = "Salomon, David (2000) ``Prefix Compression of Sparse Binary Strings,'' {\it ACM Crossroads Magazine}, {\bf6}(3), February.", }.7 @Article{Sampath:1993:CPS, author = "Ashwin Sampath and Ahmad C. Ansari", title = "Combined {Peano} Scan and {VQ} Approach to Image Compression", journal = j-IMAGE-VIDEO-PROCESS, volume = "1903", pages = "175--186", year = "199 @Article{Sadeh:1996:UDC, author = "Ilan Sadeh", title = "Universal Data Compression Algorithm Based on Approximate String Matching", journal = j-PROBAB-ENGRG-INFORM-SCI, volume = "10", number = "4", pages = "465--486", month = oct, year = "1996", CODEN = "????", DOI = "https://doi.org/10.1017/S0269964800004502", ISSN = "0269-9648 (print), 1469-8951 (electronic)", I!$I @Article{Said:1996:NFE, author = "A. Said and W. A. Pearlman", title = "A New Fast and Efficient Image Codec Based on Set Partitioning in Hierarchical Trees", journal = j-IEEE-TRANS-CIRCUITS-SYST-VIDEO-TECH, volume = "6", number = "6", pages = "243--250", month = jun, year = "1996", CODEN = "ITCTEM", ISSN = "1051-8215 (print), 1558-2205 (electronic)", ISSN-L = "1051-821#@ @Article{Sadeh:1998:BDC, author = "Ilan Sadeh", title = "Bounds on Data Compression Ratio with a Given Tolerable Error Probability", journal = j-PROBAB-ENGRG-INFORM-SCI, volume = "12", number = "2", pages = "189--210", month = apr, year = "1998", CODEN = "????", DOI = "https://doi.org/10.1017/S0269964800005143", ISSN = "0269-9648 (print), 1469-8951 (electronic)", I L @Article{Saleh:2016:PAN, author = "Bassel Saleh and Dongyu Qiu", title = "Performance Analysis of Network-Coding-Based {P2P} Live Streaming Systems", journal = j-IEEE-TRANS-NETWORKING, volume = "24", number = "4", pages = "2140--2153", month = aug, year = "2016", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2015.2448597", ISSN = "1063-6692 (print), 1558-2566r+ H eK @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 = "http://www.computer.org/tc/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://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", }& 8%K @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", ISSN = "0018~} @Article{Qi:2011:UHC, author = "Zhao-Hui Qi and Ling Li and Xiao-Qin Qi", title = "Using {Huffman} coding method to visualize and analyze {DNA} sequences", journal = j-J-COMPUT-CHEM, volume = "32", number = "15", pages = "3233--3240", day = "30", month = nov, year = "2011", CODEN = "JCCHDD", DOI = "https://doi.org/10.1002/jcc.21906", ISSN = "0192-8651 (pri 2Ƈ|y @Article{Qu:2012:ISD, author = "Zhenhua Qu and Weiqi Luo and Jiwu Huang", title = "Identifying Shifted Double {JPEG} Compression Artifacts for Non-intrusive Digital Image Forensics", journal = j-LECT-NOTES-COMP-SCI, volume = "7633", pages = "1--8", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-34263-9_1", ISSN = "0302-9743 (print), 1611-3349 (electronic)", sg @Article{Przelaskowski:1998:DPW, author = "Artur Przelaskowski", title = "Detail Preserving Wavelet-based Compression with Adaptive ConC @Article{Prasad:2001:IBI, author = "M. V. N. K. Prasad and K. K. Shukla and R. N. Mukherjee", title = "Implementation of {BTTC} Image Compression Algorithm Using Fuzzy Technique", journal = j? @Article{Pournelle:1993:QOC, author = "Jerry Pournelle", title = "The {DOS} 6 Question: Our columnist finds {DOS} 6 is the least expensive route to disk compression and memory optimization", journal = j-BYTE, volume = "18", number = "8", pages = "209--??", month = jul, year = "1993", CODEN = "BYTEDJ", ISSN = "0360-5280 (print), 1082-7838 (electronic)", ISSN-L = "0360-5280", bibdate = "Tue Jan 2 10:01:41 MST 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "BYTE Magazine", }:K @Article{Pomeranz:2016:PSS, author = "Irith Pomeranz", title = "Periodic Scan-In States to Reduce the Input Test Data Volume for Partially Functional Broadside Tests", journal = j-TODAES, volume = "22", number = "1", pages = "7:1--7:??", month = dec, year = "2016", CODEN = "ATASFO", DOI = "https://doi.org/10.1145/2911983", ISSN = "1084-4309 (print), 1557-7309 (electr Q QL*Y'3+=E%!E};=Ewinproceedingsdatacompression.bibRonson:1982:ABTJ. Ronson and J. DewitteProceedings of the IEEE International Conference on Acoustics, Speech, and Signal ProcessingAdaptive Block Truncation Coding Scheme Using an Edge Following Algorithmpub-IEEEpub-IEEE:adr1235--12381982Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsJ. Ronson and J. DewitteProceedings of the IEEE International Conference on Acoustics, Speech, and Signal ProcessingAdaptive Block Truncation Coding Scheme Using an Edge Following Algorithm @InProceedings{Ronson:1982:ABT, author = "J. Ronson and J. Dewitte", booktitle = "Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing", title = "Adaptive Block Truncation Coding Scheme Using an Edge Following Algorithm", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "1235--1238", year = "1982", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }[)W 3-1k57Ee;?c1k]articledatacompression.bibPechura:1982:FATMichael A. PechuraFile Archival Techniques Using Data Compressionj-CACM259605--6091982CACMA20001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 00010782Mon Jan 22 07:11:57 MST 2001http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Pechura82; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2001.01.22 07:11:57 MSTCommunications of the ACMack-nhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Michael A. PechuraFile Archival Techniques Using Data Compression @Article{Pechura:1982:FAT, author = "Michael A. Pechura", title = "File Archival Techniques Using Data Compression", journal = j-CACM, volume = "25", number = "9", pages = "605--609", year = "1982", CODEN = "CACMA2", 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; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://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", } WbE @PhdThesis{Elnahas:1984:DCA, author = "Sharaf Eldin Elnahas", title = "Data Compression with Applications to Digital Radiology", type = "{D.Sc.} thesis", school = "Washington University", address = "St. Louis, MO, USA", pages = "162", year = "1984", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303316909", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8524758", subject = "Electrical engineering", }4k @PhdThesis{Dosik:1972:OBC, author = "Paul H. Dosik", title = "An Optimal Buffer Controlled Data Compression System", type = "{Ph.D.} thesis", school = "Polytechnic University", address = "New York, NY, USA", pages = "190", year = "1972", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302676863", acknowledgement = ack-nhfb, classification = "0790: Systems design", dissertation-thesis-number = "7228226", subject = "Systems design", }7C @PhdThesis{Davisson:1964:TDC, author = "Lee David Davisson", title = "Theory of Data Compression", type = "{Ph.D.} thesis", school = "University of California, Los Angeles", address = "Los Angeles, CA, USA", pages = "46", year = "1964", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302143966", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "6502683", subject = "Electrical engineering", };w @PhdThesis{Chow:1996:SRC, author = "James G. Chow", title = "Successive refinement and the compression of multi-dimensional data", type = "{Ph.D.} thesis", school = "Cornell University", address = "Ithaca, NY, USA", pages = "100", year = "1996", bibdate = "Fri Feb 1 08:42:55 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/304303621", acknowledgement = ack-nhfb, advisor = "Jian Min Wang", classification = "0544: Electrical engineering; 0984: Computer science", dissertation-thesis-number = "9629624", subject = "Electrical engineering; Computer science", }jU @PhdThesis{Chen:1999:SDC, author = "Xiao Chen", title = "Study on Data Compression Coding in Multimedia Communication", type = "{D.Eng.} thesis", school = "Huazhong (Central China) University of Science and Technology", address = "Huazhong, Peoples Republic of China", year = "1999", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/1027904819", acknowledgement = ack-nhfb, advisor = "Yao Ting Zhu and Guang Xi Zhu and Guang Xi", classification = "9998: No UMI subject assigned", dissertation-thesis-number = "H144800", language = "Chinese", subject = "No UMI subject assigned", }p://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = 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.", } 33L,X '3%/#[3C7;e9/mastersthesisdatacompression.bibTao:1982:RTSBertram P. M. TaoReal-Time Speech Data Compression System Based Upon Vector QuantizationM.S. thesisCalifornia State University, Long BeachLong Beach, CA, USA1891982Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303109401Electrical engineeringack-nhfbBertram P. M. TaoReal-Time Speech Data Compression System Based Upon Vector Quantization @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/; http://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", }y+W3+[_57E;qe[_{articledatacompression.bibStorer:1982:DCTJames A. Storer and Thomas G. SzymanskiData Compression via Textual Substitutionj-J-ACM294928--951oct101982JACOAH0004-5411 (print), 1557-735X (electronic) OR 00045411 (print), 1557735X (electronic)0004-5411 OR 00045411Sat Jan 26 12:46:16 MST 2013http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib2013.01.26 12:46:16 MSTJournal of the Association for Computing Machineryack-dshttp://portal.acm.org/browse_dl.cfm?idx=J401James A. Storer and Thomas G. SzymanskiData Compression via Textual Substitution @Article{Storer:1982:DCT, author = "James A. Storer and Thomas G. Szymanski", title = "Data Compression via Textual Substitution", journal = j-J-ACM, volume = "29", number = "4", pages = "928--951", month = oct, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = 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.", } ?.V3'Sg/57E};SSks articledatacompression.bibBurt:1983:LPCPeter J. Burt and Edward H. AdelsonThe Laplacian Pyramid as a Compact Image Codej-IEEE-TRANS-COMMCOM-314532--540apr41983IECMBT0090-6778 (print), 1558-0857 (electronic) OR 00906778 (print), 15580857 (electronic)0090-6778 OR 00906778Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Communicationsack-dsPeter J. Burt and Edward H. AdelsonThe {Laplacian} Pyramid as a Compact Image Code @Article{Burt:1983:LPC, author = "Peter J. Burt and Edward H. Adelson", title = "The {Laplacian} Pyramid as a Compact Image Code", journal = j-IEEE-TRANS-COMM, volume = "COM-31", number = "4", pages = "532--540", month = apr, year = "1983", CODEN = "IECMBT", ISSN = "0090-6778 (print), 1558-0857 (electronic)", ISSN-L = "0090-6778", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }/-V3#=g77C;YgwG=g articledatacompression.bibWu:1982:ABAJ. K. Wu and R. E. BurgeAdaptive Bit Allocation for Image Compressionj-CGIP194392--400aug81982CGIPBG0146-664X OR 0146664X0146-664X OR 0146664XFri Feb 7 08:36:21 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/cvgip.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.02.07 08:36:21 MSTComputer Graphics and Image Processingimage processing; pattern recognition systemsack-nhfbhttp://www.sciencedirect.com/science/journal/0146664XComput Graphics Image ProcessJ. K. Wu and R. E. BurgeAdaptive Bit Allocation for Image Compression @Article{Wu:1982:ABA, author = "J. K. Wu and R. E. Burge", title = "Adaptive Bit Allocation for Image Compression", journal = j-CGIP, volume = "19", number = "4", pages = "392--400", month = aug, year = "1982", CODEN = "CGIPBG", ISSN = "0146-664X", ISSN-L = "0146-664X", bibdate = "Fri Feb 7 08:36:21 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/cvgip.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = 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", }at Jan 26 12:46:16 MST 2013", bibsource = "http://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.", } q0W3/g{#Q57'1=;Q-Ug{garticledatacompression.bibFraenkel:1983:TCPAviezri S. Fraenkel and Moshe Mor and Y. PerlIs Text Compression by Prefixes and Suffixes Practical?j-ACTA-INFO204371--389dec121983AINFA2https://doi.org/10.1007/BF002642800001-5903 (print), 1432-0525 (electronic) OR 00015903 (print), 14320525 (electronic)0001-5903 OR 0001590368U15 (94A29)732312 (85c:68084)Mon May 26 18:16:34 2014ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; http://www.math.utah.edu/pub/tex/bib/actainfo.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; MathSciNet database2014.05.26 18:16:34 ???Monographs in Visual CommunicationActa Informaticaack-nhfbhttp://link.springer.com/journal/236Aviezri S. Fraenkel and Moshe Mor and Y. PerlIs Text Compression by Prefixes and Suffixes Practical? @Article{Fraenkel:1983:TCP, author = "Aviezri S. Fraenkel and Moshe Mor and Y. Perl", title = "Is Text Compression by Prefixes and Suffixes Practical?", journal = 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; http://www.math.utah.edu/pub/tex/bib/actainfo.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; MathSciNet database", series = "Monographs in Visual Communication", acknowledgement = ack-nhfb, fjournal = "Acta Informatica", journal-URL = "http://link.springer.com/journal/236", }/Y '3-=+# 5=E};=#+ sinproceedingsdatacompression.bibDewitte:1983:OBCJ. Dewitte and J. RonsonH. W. SchusslerSignal Processing II: Theories and Applications---Proceedings of EUSIPCO 83Original Block Coding Scheme for Low Bit Rate Image Transmissionpub-ELSEVIER-SCIENCEpub-ELSEVIER-SCIENCE:adr143--1461983Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsJ. Dewitte and J. RonsonSignal Processing II: Theories and Applications---Proceedings of EUSIPCO 83H. W. SchusslerOriginal Block Coding Scheme for Low Bit Rate Image Transmission @InProceedings{Dewitte:1983:OBC, author = "J. Dewitte and J. Ronson", editor = "H. W. Schussler", booktitle = "Signal Processing II: Theories and 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 = "http://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.", }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; http://www.math.utah.edu/pub/tex/bib/actainfo.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; MathSciNet database", series = "Monographs in Visual Communication", acknowledgement = ack-nhfb, fjournal = "Acta Informatica", journal-URL = "http://link.springer.com/journal/236", } Hv3X 3-+;57E};[+;articledatacompression.bibLangdon:1983:NZLGlen G. LangdonA Note on the Ziv--Lempel Model for Compressing Individual Sequencesj-IEEE-TRANS-INF-THEORYIT-292284--287mar31983IETTAW0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsGlen G. LangdonA Note on the {Ziv--Lempel} Model for Compressing Individual Sequences @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", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }72U 3--[!7E};O-[articledatacompression.bibLangdon:1983:ARLGlenn G. LangdonAn Adaptive Run Length Coding Algorithmj-IBM-TDB267B3783--3785dec121983IBMTAA0018-8689 OR 00188689Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIBM Technical Disclosure Bulletinack-dsGlenn G. LangdonAn Adaptive Run Length Coding Algorithm @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 = "http://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.", }41V 3+']%G+C7;e9']phdthesisdatacompression.bibKurien:1983:PDCThomas KurienA Partitioned Data Compression AlgorithmPh.D. thesisThe University of ConnecticutStorrs, CT, USA1671983Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303265149Electrical engineeringack-nhfbThomas KurienA Partitioned Data Compression Algorithm @PhdThesis{Kurien:1983:PDC, author = "Thomas Kurien", title = "A Partitioned Data Compression Algorithm", type = "{Ph.D.} thesis", school = "The University of Connecticut", address = "Storrs, CT, USA", pages = "167", year = "1983", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303265149", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8319202", subject = "Electrical engineering", } i9s @Article{Loew:1996:APM, author = "Murray H. Loew and Dunling Li and Raymond L. Pickholtz", title = "Adaptive {PIFS} model in fractal image compression", journal = j-PROC-SPIE, volume = "2707", number = "??", pages = "284--293", month = "????", year7 @Article{Liu:2010:GDH, author = "Yang Liu and Balakrishnan Prabhakaran and Xiaohu Guo", title = "Geometry {I}: {Dirichlet} Harmonic Shape Compression with Feature Preservation for Parameterized Surfaces", journal = j-CGF, volume = "29", number = "7", pages = "2039--2048", month = sep, year = "2010", CODEN = "CGFODY", DOI = "https://doi.org/10.1111/j.1467-8659.2010.01790.x", &' @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", IiS @Article{Liu:2015:GTB, author = "Shaohui Liu and Anand Paul and Guochao Zhang and Gwanggil Jeon", title = "A game theory-based block image compression method in encryption domain", journal = j-J-SUPERCOMPUTING, volume = "71", number = "9", pages = "3353--3372", month = sep, year = "2015", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-015-1413-0", IL&M @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-467dI @Article{Liu:2008:RDO, author = "Hui Liu and Siliang Ma", title = "{R--D} optimized tree-structured compression algorithms with discrete directional wavelet transform", journal = j-J-COMPUT-APPL-MATH, volume = "219", number = "1", pages = "302--311", day = "15", month = sep, year = "2008", CODEN = "JCAMDI", ISSN = "0377-0427 (print), 1879-1778 (electronic)", ISSN-L = "0377-0427", bibdate = "Sat Feb 25 13:13:25 MST 2017", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jcomputapplmath2005.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0377042707004116", acknowledgement = ack-nhfb, fjournal = "Journal of Computational and Applied Mathematics", journal-URL = "http://www.sciencedirect.com/science/journal/03770427", } + @Article{Liu:2005:DBV, author = "Hongmei Liu and Jiwu Huang and Yun Q. Shi", title = "{DWT}-Based Video Data Hiding Robust to {MPEG} Compression and Frame Loss", journal = j-INT-J-IMAGE-GRAPHICS, volume = "5", number = "1", pages = "111--??", month = jan, year = "2005", CODEN = "????", ISSN = "0219-4678", bibdate = "Wed Jan 12 05:16:34 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml; http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ijig.bib", acknowledgement = ack-nhfb, fjournal = "International Journal of Image and Graphics (IJIG)", journal-URL = "http://www.worldscientific.com/worldscinet/ijig", } LCCN = "????", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "amicus.nlc-bnc.ca:210/NL; http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "2 microfiches (150 frames).", series = "Canadian theses on microfiche = Th{\`e}ses canadiennes sur microfiche", URL = "http://search.proquest.com/docview/303201518?accountid=14677", acknowledgement = ack-nhfb, classification = "0537: Engineering", dissertation-thesis-number = "MK54443", subject = "Engineering", } ~5 @PhdThesis{Ginesta:1995:DHO, author = "Xavier Ginesta", title = "Design of high-order statistical models of an information source and their application to data compression", type = "{Ph.D.} thesis", school = "Polytechnic University", addresgQ @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/; http://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", }K) @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/; http://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", }&M @PhdThesis{Gadallah:1991:DCT, author = "M. E. Gadallah", title = "Data Compression Techniques for Isolated and Connected Word Recognition (Speech Signals, Template Matching)", type = "{Ph.D.} thesis", school = "Cranfield University", address = "Cranfield, Bedfordshire MK43 0AL, UK", pages = "301", year = "1991", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303965529", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering; 0800: Artificial intelligence; 0984: Computer science", dissertation-thesis-number = "DX94719", subject = "Computer science; Electrical engineering; Artificial intelligence", } @PhdThesis{Foulds:1985:DRT, author = "Richard Arthur Foulds", title = "A Data Reduction Technique for Minimum Bandwidth Transmission of Intelligible {American Sign Language} for the Deaf (Compression, Telecommunications, Communication, Rehabilitation)", type = "{Ph.D.} thesis", school = "Tufts University", address = "Medford, MA, USA", pages = "215", year = "1985", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303423885", acknowledgement = ack-nhfb, classification = "0300: Audiology; 0537: Engineering", dissertation-thesis-number = "8602315", subject = "Engineering; Audiology", } PP-5X 3-5%K1C7;e-5]phdthesisdatacompression.bibPoehler:1983:DCIPaul Leonard PoehlerData Compression of Imagery Using Linear Predictive Coding TechniquesPh.D. thesisFlorida Institute of TechnologyMelbourne, FL, USA2681983Fri Feb 1 08:42:55 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 08:42:55 MSThttp://search.proquest.com/docview/303271798Computer scienceack-nhfbPaul Leonard PoehlerData Compression of Imagery Using Linear Predictive Coding Techniques @PhdThesis{Poehler:1983:DCI, author = "Paul Leonard Poehler", title = "Data Compression of Imagery Using Linear Predictive Coding Techniques", type = "{Ph.D.} thesis", school = "Florida Institute of Technology", address = "Melbourne, FL, USA", pages = "268", year = "1983", bibdate = "Fri Feb 1 08:42:55 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303271798", acknowledgement = ack-nhfb, classification = "0984: Computer science", dissertation-thesis-number = "8319226", subject = "Computer science", }{4Z '3)1!%A5CQ7Ck;C#1C!mastersthesisdatacompression.bibNadim:1983:DCTGalal Ezz E. NadimData compression techniques as applied to the electroencephalograph signal54443M.Sc. thesisThe University of ManitobaWinnipeg, MB, Canada19830-315-06523-0 OR 0315065230978-0-315-06523-9 OR 97803150652390227-3845 OR 02273845Fri Feb 1 09:20:32 MST 2013amicus.nlc-bnc.ca:210/NL; http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MST2 microfiches (150 frames).Canadian theses on microfiche = Theses canadiennes sur microfichehttp://search.proquest.com/docview/303201518?accountid=14677Engineeringack-nhfbGalal Ezz E. Nadim2 microfiches (150 frames).Data compression techniques as applied to the electroencephalograph signal @MastersThesis{Nadim:1983:DCT, author = "Galal Ezz E. Nadim", title = "Data compression techniques as applied to the electroencephalograph signal", volume = "54443", type = "{M.Sc.} thesis", school = "The University of Manitoba", address = "Winnipeg, MB, Canada", pages = "????", year = "1983", ISBN = "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/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "2 microfiches (150 frames).", series = "Canadian theses on microfiche = Th{\`e}ses canadiennes sur microfiche", URL = "http://search.proquest.com/docview/303201518?accountid=14677", acknowledgement = ack-nhfb, classification = "0537: Engineering", dissertation-thesis-number = "MK54443", subject = "Engineering", }tah.edu/pub/tex/bib/datacompression.bib; http://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", } 3 W/ @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 = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, rawdata = "Bass, Thomas A. (1992) {\it Eudaemonic Pie}, New York, Penguin Books.", }! @Book{Barnsley:1988:FE, author = "Michael F. 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", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/master.bib", acknowledgement = ack-ds # " and " # ack-nhfb, rawdata = "Barnsley, M. F. (1988) {\it Fractals Everywhere}, New York, Academic Press.", }B @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 = "http://www.math.utah.edu/pub/tex/bib+W @Book{Anonymous:2006:DCF, editor = "Anonymous", title = "Data compression in financial telecommunications: {American National Standard for Financial Services: ANSI X9.32-2006}", publisher = "Accredited Standards Committee X9, Inc., Financial Industry Standards", address = "Annapolis, MD, USA", pages = "x + 30 leaves", year = "2006", LCCN = "HG4515.5 .D38 2006", bibdate = "Mon Jan 28 15:19:07 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; z3950.loc.gov:7090/Voyager", note = "Revision of X9.32-1998. Date approved: July 6, 2006.", acknowledgement = ack-nhfb, subject = "Financial services industry; Data processing; Standards; Data compression (Telecommunication); Data encryption (Computer science)", } jK @Book{Anonymous:1982:DCH, author = "Anonymous", title = "Data compression hardware and software market: Data compression products in the {U.S}", publisher = "Frost and Sullivan", address = "106 Fulton Strett, New York 10038, NY, USA", pages = "vii + 184", month = may, year = "1982", LCCN = "HD9696.D383 U6316 1982", bibdate = "Mon Jan 28 15:19:07 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, subject = "Data transmission equipment industry; United States; Market surveys", } $7X %3+15//5Ec;135 35incollectiondatacompression.bibVorobev:1983:FNNikolai N. VorobevIan Naismith SneddonFibonacci NumbersFibonacci NumbersNew Classics Library1983Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib2013.01.26 12:46:16 MSTTranslation by Halina Moss. Reprint of cite Vorobev:1961:FN.ack-dsNikolai N. Vorobev{Fibonacci} NumbersIan Naismith SneddonTranslation by Halina Moss. Reprint of \cite{Vorobev:1961:FN}.{Fibonacci} Numbers @InCollection{Vorobev:1983:FN, author = "Nikolai N. Vorobev", editor = "Ian Naismith Sneddon", booktitle = "{Fibonacci} Numbers", title = "{Fibonacci} Numbers", publisher = "New Classics Library", address = "????", pages = "??", year = "1983", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fibquart.bib", note = "Translation by Halina Moss. Reprint of \cite{Vorobev:1961:FN}.", acknowledgement = 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", }N6X 3+%g-57Ea;E}wG%garticledatacompression.bibStorer:1983:TATJ. A. StorerToward an abstract theory of data compressionj-THEOR-COMP-SCI243221--237aug81983TCSCDI0304-3975 (print), 1879-2294 (electronic) OR 03043975 (print), 18792294 (electronic)0304-3975 OR 03043975Sat Nov 22 13:36:07 MST 1997http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/tcs1980.bib1997.11.22 13:36:07 MSTTheoretical Computer Scienceabstract program size complexity; abstract theory; computational complexity; cost function; data compression; programming languageack-nhfbDept. of Computer Sci., Brandeis Univ., Waltham, MA, USAhttp://www.sciencedirect.com/science/journal/03043975T Theoretical or MathematicalJ. A. StorerToward an abstract theory of data compression @Article{Storer:1983:TAT, author = "J. A. Storer", title = "Toward an abstract theory of data compression", journal = j-THEOR-COMP-SCI, volume = "24", number = "3", pages = "221--237", month = aug, year = "1983", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:36:07 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/tcs1980.bib", acknowledgement = 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", } pp_ eO @Book{Roelofs:1999:PDG, author = "Greg Roelofs", title = "{PNG}: The Definitive Guide", publisher = pub-ORA, address = pub-ORA:adr, pages = "xix + 327 + 4", year = "1999", ISBN = "1-56592-542-4", ISBN-13 = "978-1-56592-542-7", LCCN = "T385 .R588 1999", bibdX1 @Book{Rebaza:2012:FCA, author = "Jorge Rebaza", title = "A first course in applied mathematics", publisher = pub-WILEY, address = pub-WILEY:adr, pages = "xvi + 439", year = "2012", ISBN = "1-118-22962-2", ISBN-13 = "978-1-118-22962-0", LCCN = "TA342 .R43 2012", bibdate = "Tue May 5 16:13:00 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http:/ 2e @Book{Richardson:2003:HMV, author = "Iain G. Richardson", title = "{H.264} and {MPEG-4} Video Compression Video Coding for Next-generation Multimedia", publisher = pub-WILEY, address = pub-WILEY:adr, pages = "??", year = "2003", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, rawdata = "Richardson, Iain G. (2003) {\it H.264 and MPEG-4 Video Compression Video Coding for Next-generation Multimedia}, Chichester, West Sussex, UK, John Wiley and Sons,", }.O @Book{Roelofs:1999:PDG, author = "Greg Roelofs", title = "{PNG}: The Definitive Guide", publisher = pub-ORA, address = pub-ORA:adr, pages = "xix + 327 + 4", year = "1999", ISBN = "1-56592-542-4", ISBN-13 = "978-1-56592-542-7", LCCN = "T385 .R588 1999", bibdate = "Mon Apr 18 14:56:25 MDT 2005", bibsource = "http://www.math.utah.edu/pub/tex/bib/computer1980.bib; http://www.math.u# @Book{Rao:2001:TDC, editor = "K. Ramamohan (Kamisetty Ramamohan) Rao and P. C. (Pat C.) Yip", title = "The transform and data compression handbook", publisher = pub-CRC, address = pub-CRC:adr, pages = "xix + 388", year = "2001", ISBN = "0-8493-3692-9", ISBN-13 = "978-0-8493-3692-8", LCCN = "TK5105 .T72 2001", bibdate = "Mon Jan 28 15:19:07 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; z3950.loc.gov:7090/Voyager", series = "The electrical engineering and signal processing series", URL = "http://www.loc.gov/catdir/enhancements/fy0646/00057149-d.html", acknowledgement = ack-nhfb, subject = "Data transmission systems; Handbooks, manuals, etc; Data compression (Telecommunication)", }-zu @Book{Rao:2000:TDC, author = "Kamisetty Ramamohan Rao and Patrick C. Yip and editors", title = "The Transform and Data Compression Handbook", publisher = pub-CRC, address = pub-CRC:adr, pages = "??", year = "2000", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, rawdata = "Rao, Kamisetty Ramamohan and Patrick C. Yip, editors (2000) {\it The Transform and Data Compression Handbook}, Boca Raton, FL, CRC Press.", }Z5 @Book{Rao:1998:WTI, author = "Raghuveer M. Rao and Ajit S. Bopardikar", title = "Wavelet Transforms: Introduction to Theory and Applications", publisher = pub-AW, address = pub-AW:adr, pages = "xiii + 310", year = "1998", ISBN = "0-201-63463-5", ISBN-13 = "978-0-201-63463-1", LCCN = "QA403.3 .R36 1998", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah 9X3+K/57E};SKOarticledatacompression.bibCleary:1984:DCUJohn G. Cleary and I. H. WittenData Compression Using Adaptive Coding and Partial String Matchingj-IEEE-TRANS-COMMCOM-324396--402apr41984IECMBT0090-6778 (print), 1558-0857 (electronic) OR 00906778 (print), 15580857 (electronic)0090-6778 OR 00906778Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Communicationsack-dsJohn G. Cleary and I. H. WittenData Compression Using Adaptive Coding and Partial String Matching @Article{Cleary:1984:DCU, author = "John G. Cleary and I. H. Witten", title = "Data Compression Using Adaptive Coding and Partial String Matching", journal = j-IEEE-TRANS-COMM, volume = "COM-32", number = "4", pages = "396--402", month = apr, year = "1984", CODEN = "IECMBT", ISSN = "0090-6778 (print), 1558-0857 (electronic)", ISSN-L = "0090-6778", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", },8X 3+7%1-C7;e97_phdthesisdatacompression.bibCathey:1984:DCNSilvia Gilbert CatheyData Compression for Noiseless Channels (Huffman Codes, Lattice Theory)Ph.D. thesisClemson UniversityClemson, SC, USA1371984Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303289543Electrical engineeringack-nhfbSilvia Gilbert CatheyData Compression for Noiseless Channels ({Huffman} Codes, Lattice Theory) @PhdThesis{Cathey:1984:DCN, author = "Silvia Gilbert Cathey", title = "Data Compression for Noiseless Channels ({Huffman} Codes, Lattice Theory)", type = "{Ph.D.} thesis", school = "Clemson University", address = "Clemson, SC, USA", pages = "137", year = "1984", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303289543", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8426762", subject = "Electrical engineering", }Jan 26 12:46:16 MST 2013", bibsource = "http://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.", } "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, } ;V 3-5{%71C7;e95{Ephdthesisdatacompression.bibElnahas:1984:DCASharaf Eldin ElnahasData Compression with Applications to Digital RadiologyD.Sc. thesisWashington UniversitySt. Louis, MO, USA1621984Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/303316909Electrical engineeringack-nhfbSharaf Eldin ElnahasData Compression with Applications to Digital Radiology @PhdThesis{Elnahas:1984:DCA, author = "Sharaf Eldin Elnahas", title = "Data Compression with Applications to Digital Radiology", type = "{D.Sc.} thesis", school = "Washington University", address = "St. Louis, MO, USA", pages = "162", year = "1984", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303316909", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8524758", subject = "Electrical engineering", }:\3-!=};Q5!miscdatacompression.bibEastman:1984:AMCWillard L. Eastman and Abraham Lempel and Jacob Ziv and Martin CohnApparatus and method for compressing data signals and restoring the signal396--4027aug81984Thu Feb 14 10:33:02 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.14 10:33:02 ???US Patent Application 291,870 filed 10 August 1981. See also the related patent cite Welch:1984:HSD issued on the same day. This patent was held by Sperry and its successor, Unisys, and vigorously enforced until its expiry on 7 August 2001. It led to multimillion-dollar lawsuit settlements, and the move away from LZW compression to several other methods that are patent free.http://www.google.com/patents/US4464650; https://en.wikipedia.org/wiki/Graphics_Interchange_Formatack-nhfbUS Patent 4,558,302.Willard L. Eastman and Abraham Lempel and Jacob Ziv and Martin CohnUS Patent Application 291,870 filed 10 August 1981. See also the related patent \cite{Welch:1984:HSD} issued on the same day. This patent was held by Sperry and its successor, Unisys, and vigorously enforced until its expiry on 7 August 2001. It led to multimillion-dollar lawsuit settlements, and the move away from LZW compression to several other methods that are patent free.Apparatus and method for compressing data signals and restoring the signal @Misc{Eastman:1984:AMC, author = "Willard L. Eastman and Abraham Lempel and Jacob Ziv and Martin Cohn", title = "Apparatus and method for compressing data signals and restoring the signal", howpublished = "US Patent 4,558,302.", day = "7", month = aug, year = "1984", bibdate = "Thu Feb 14 10:33:02 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "US Patent Application 291,870 filed 10 August 1981. See also the related patent \cite{Welch:1984:HSD} issued on the same day. This patent was held by Sperry and its successor, Unisys, and vigorously enforced until its expiry on 7 August 2001. It led to 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, } P P0a @PhdThesis{Stewart:1981:TDC, author = "Lawrence Colm Stewart", title = "Trellis Data Compression", type = "{Ph.D.} thesis", school = "Stanford University", address = "Stanford, CA, USA", pages = "137", year = "1981", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303177936", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-wo @PhdThesis{Spaan:2000:ERC, author = "Franciscus Henricus Petrus Spaan", title = "Error resilient compression of digital video data", type = "Doctoral", school = "Technische Universiteit Delft", address = "Delft, The Netherlands", pages = "157", year = "2000", ISBN = "90-90-13218-X", ISBN-13 = "978-90-90-13218-1", LCCN = "????", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/304672016", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering; 0984: Computer science", dissertation-thesis-number = "C803360", subject = "Electrical engineering; Computer science", }Ʌ6o @PhdThesis{Stanley:1967:CMD, author = "Thomas Patrick Stanley", title = "Compression of {Markov} Data", type = "{Ph.D.} thesis", school = "Princeton University", address = "Princeton, NJ, USA", pages = "106", year = "1967", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302264732", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "6802519", subject = "Electrical engineering", }*7 @PhdThesis{Southard:1995:VQN, author = "David Alan Southard", title = "Vector quantization and nearest neighbor clustering with applications to image compression and data visualization", type = "{Sc.D.} thesis", school = "University of Massachusetts Lowell", address = "Lowell, MA, USA", pages = "169", year = "1995", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/304200450", acknowledgement = ack-nhfb, advisor = "Georges G. Grinstein", classification = "0544: Electrical engineering; 0984: Computer science", dissertation-thesis-number = "9612675", subject = "Computer science; Electrical engineering", }`A @PhdThesis{Smith:1979:SPA, author = "George Heavener Smith", title = "Spectral Peak Amplitude Coding for Voice Data Compression", type = "{Ph.D.} thesis", school = "Stanford University", address = "Stanford, CA, USA", pages = "101", year = "1979", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302972664", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8002017", subject = "Electrical engineering", }SN-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; http://www.math.utah.edu/pub/tex/bib/bit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=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", } =V3/SM;57E};[SQMarticledatacompression.bibFerguson:1984:SSHT. J. Ferguson and J. H. RabinowitzSelf-Synchronizing Huffman codesj-IEEE-TRANS-INF-THEORY304687--693jul71984IETTAW0018-9448 (print), 1557-9654 (electronic) OR 00189448 (print), 15579654 (electronic)0018-9448 OR 00189448Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsT. J. Ferguson and J. H. RabinowitzSelf-Synchronizing {Huffman} codes @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", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }A U'3)CE'C};CEw inproceedingsdatacompression.bibGamal:1984:IDCA. El Gamal and A. OrlitskyInteractive Data CompressionIEEE:1984:ASF100--1081984Thu Apr 5 06:13:39 MDT 2001http://www.math.utah.edu/pub/tex/bib/datacompression.bib2001.04.05 06:13:39 MDTack-nhfbA. El Gamal and A. OrlitskyInteractive Data Compression @InProceedings{Gamal:1984:IDC, author = "A. El Gamal and A. Orlitsky", title = "Interactive Data Compression", crossref = "IEEE:1984:ASF", pages = "100--108", year = "1984", bibdate = "Thu Apr 5 06:13:39 MDT 2001", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, }ib/bstj1980.bib; http://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", } --O?\ 3-!77=;]9!articledatacompression.bibGharavi:1984:CVLH. GharaviConditional variable-length coding for gray-level picturesj-ATT-BELL-LAB-TECH-J632249--2601984ABLJER0748-612X OR 0748612XFri Nov 12 09:17:39 2010Compendex database; http://www.math.utah.edu/pub/tex/bib/bstj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2010.11.12 09:17:39 ???This paper presents a new 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.AT&T Bell Laboratories Technical Journaldata processing --- code converters; pulse code modulationconditional variable-length coding; digital image reduction; gray-level picture codingack-nhfbThis 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.H. GharaviConditional variable-length coding for gray-level pictures @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", ISSN = "0748-612X", bibdate = "Fri Nov 12 09:17:39 2010", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/bstj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", abstract = "This paper presents a new 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", } z`zbAW !3-+ 3+#E};+ /techreportdatacompression.bibLangdon:1984:PVMGlen G. LangdonOn Parsing vs. Mixed-Order Model Structures for Data CompressionIBM research reportRJ-4163 (46091)pub-IBMpub-IBM:adr18jan11984Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsGlen G. LangdonOn Parsing vs. Mixed-Order Model Structures for Data Compression @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 = "http://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.", }@W 3%wE};{omiscdatacompression.bibISO:1984:IPSISOInformation Processing Systems --- Data Communication High-Level Data Link Control Procedure-Frame Structure: IS 3309Thirdoct101984Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsISOInformation Processing Systems --- Data Communication High-Level Data Link Control Procedure-Frame Structure: {IS 3309} @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 = "http://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.", }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, }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.Franklin Mark LiangWord Hy-phen-a-tion by Com-pu-ter @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 = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/texbook3.bib", URL = "http://www.tug.org/docs/liang/; http://wwwlib.umi.com/dissertations/fullcit/8329742", abstract = "This thesis describes research leading to an improved word hyphenation algorithm for the T(,E)X82 typesetting system. Hyphenation is viewed primarily as a data compression problem, where we are given a dictionary of words with allowable division points, and try to devise methods that take advantage of the large amount of redundancy present. The new hyphenation algorithm is based on the idea of hyphenating and inhibiting patterns. These are simply strings of letters that, when they match in a word, give us information about hyphenation at some point in the pattern. For example, `-tion' and `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, } ]BY 3)3O1m/=c;3#%3Ophdthesisdatacompression.bibLiang:1984:WHPFranklin Mark LiangWord Hy-phen-a-tion by Com-pu-terPh.D. dissertationComputer Science Department, Stanford UniversityStanford, CA, USA92mar31984Fri Jul 08 14:48:58 2005http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/texbook3.bib2005.07.08 14:48:58 ???http://www.tug.org/docs/liang/; http://wwwlib.umi.com/dissertations/fullcit/8329742This thesis describes research leading to an improved word hyphenation algorithm for the T(,E)X82 typesetting system. Hyphenation is viewed primarily as a data compression problem, where we are given a dictionary of words with allowable division points, and try to devise methods that take advantage of the large amount of redundancy present. The new hyphenation algorithm is based on the idea of hyphenating and inhibiting patterns. These are simply strings of letters that, when they match in a word, give us information about hyphenation at some point in the pattern. For example, `-tion' and `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.ack-nhfbThis thesis describes research leading to an improved word hyphenation algorithm for the T(,E)X82 typesetting system. Hyphenation is viewed primarily as a data compression problem, where we are given a dictionary of words with allowable division points, and try to devise methods that take advantage of the large amount of redundancy present. The new hyphenation algorithm is based on the idea of life.bib; http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Applications of formal grammars for generating graphic fractals --- ``graftals'' --- in the modeling of plants.", acknowledgement = 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", } AAxDY 3))=};Y5)I miscdatacompression.bibWelch:1984:HSDTerry A. WelchHigh speed data compression and decompression apparatus and method1--107aug81984Thu Feb 14 10:28:31 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.14 10:28:31 ???US Patent Application US19830505638 filed 20 June 1983. See also the related patent cite Eastman:1984:AMC issued on the same day.http://www.google.com/patents/US455830ack-nhfbUS Patent 4,558,302.Terry A. WelchUS Patent Application US19830505638 filed 20 June 1983. See also the related patent \cite{Eastman:1984:AMC} issued on the same day.High speed data compression and decompression apparatus and method @Misc{Welch:1984:HSD, author = "Terry A. Welch", title = "High speed data compression and decompression apparatus and method", howpublished = "US Patent 4,558,302.", day = "7", month = aug, year = "1984", bibdate = "Thu Feb 14 10:28:31 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "US Patent Application US19830505638 filed 20 June 1983. See also the related patent \cite{Eastman:1984:AMC} issued on the same day.", URL = "http://www.google.com/patents/US455830", acknowledgement = ack-nhfb, }?CZ 3)1Y=)57E#;k/7w5kYi articledatacompression.bibSmith:1984:PFFAlvy Ray Smith IIIPlants, Fractals, and Formal Languagesj-COMPUTERS-AND-GRAPHICS1831--10jul71984CGRADI, CPGPBZ0097-8930 (print), 1558-4569 (electronic) OR 00978930 (print), 15584569 (electronic)0097-8930 OR 00978930Sat Jan 26 12:46:16 MST 2013Ai/alife.bib; http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTApplications of formal grammars for generating graphic fractals --- ``graftals'' --- in the modeling of plants.Computer Graphicsack-dsGraftals. Methods for displaying natural objects based on formal language models are presented. In particular, deterministic models are shown to exhibit sufficient variety to be used in production graphic systems.http://www.sciencedirect.com/science/journal/00978493Alvy Ray {Smith III}Applications of formal grammars for generating graphic fractals --- ``graftals'' --- in the modeling of plants.Plants, Fractals, and Formal Languages @Article{Smith:1984:PFF, author = "Alvy Ray {Smith III}", title = "Plants, Fractals, and Formal Languages", journal = j-COMPUTERS-AND-GRAPHICS, volume = "18", number = "3", pages = "1--10", month = jul, year = "1984", CODEN = "CGRADI, CPGPBZ", ISSN = "0097-8930 (print), 1558-4569 (electronic)", ISSN-L = "0097-8930", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "Ai/alife.bib; http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Applications of formal grammars for generating graphic fractals --- ``graftals'' --- in the modeling of plants.", acknowledgement = 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", } "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}.", }atacompression.bib2013.01.26 12:46:16 MSTComputerThis 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.ack-dshttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2Terry A. WelchA Technique for High-Performance Data Compression @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 = "http://www.math.utah.edu/pub/tex/bib/computer1980.bib; http://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}.", } GY 33+%-CQ3E=;M+>bookdatacompression.bibCappellini:1985:DCEVito CappelliniData compression and error control techniques with applicationspub-ACADEMICpub-ACADEMIC:adrxiv + 30419850-12-159260-X OR 012159260X978-0-12-159260-8 OR 9780121592608TK5102.5 .D336 1985Mon Jan 28 15:19:07 MST 2013clas.caltech.edu:210/INNOPAC; clio-db.cc.columbia.edu:7090/Voyager; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; z3950.loc.gov:7090/Voyager2013.01.28 15:19:07 MSTData compression (Telecommunication); Coding theory; Error-correcting codes (Information theory)ack-nhfbVito CappelliniData compression and error control techniques with applications @Book{Cappellini:1985:DCE, editor = "Vito Cappellini", title = "Data compression and error control techniques with applications", publisher = 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; http://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)", }oFU3+O+%-E};O+bookdatacompression.bibBerstel:1985:TCJean Berstel and Dominique PerrinTheory of Codespub-ACADEMICpub-ACADEMIC:adr1985Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsJean Berstel and Dominique PerrinTheory of Codes @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 = "http://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.", }0EX 3))o![57Ek;S)owarticledatacompression.bibWelch:1984:THPTerry A. WelchA Technique for High-Performance Data Compressionj-COMPUTER1768--19jun61984CPTRB4https://doi.org/10.1109/MC.1984.16591580018-9162 (print), 1558-0814 (electronic) OR 00189162 (print), 15580814 (electronic)0018-9162 OR 00189162Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/computer1980.bib; http://www.math.utah.edu/pub/tex/bib/d U!IU 3'![377E};g!_5articledatacompression.bibCole:1985:NPPA. J. ColeA Note on Peano Polygons and Gray Codesj-INT-J-COMPUT-MATH183--131985IJCMAT0020-7160 OR 002071600020-7160 OR 00207160Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTInternational Journal of Computer Mathematicsack-dsA. J. ColeA Note on {Peano} Polygons and Gray Codes @Article{Cole:1985:NPP, author = "A. J. Cole", title = "A Note on {Peano} Polygons and Gray Codes", journal = j-INT-J-COMPUT-MATH, volume = "18", pages = "3--13", year = "1985", CODEN = "IJCMAT", ISSN = "0020-7160", ISSN-L = "0020-7160", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }'HY'3-a#E};a inproceedingsdatacompression.bibChoueka:1985:EVHY. Choueka and Shmuel T. Klein and Y. PerlProceedings of the 8th ACM-SIGIR Conference, Montreal, QC, CanadaEfficient Variants of Huffman Codes in High Level Languagespub-ACMpub-ACM:adr122--1301985Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsY. Choueka and Shmuel T. Klein and Y. PerlProceedings of the 8th ACM-SIGIR Conference, Montr{\'e}al, QC, CanadaEfficient Variants of {Huffman} Codes in High Level Languages @InProceedings{Choueka:1985:EVH, author = "Y. Choueka and Shmuel T. Klein and Y. Perl", booktitle = "Proceedings of the 8th 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 = "http://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.", }ibliography/Database/Wiederhold.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/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{Cheng:1996:FHR, author = "J.-M. Cheng and L. M. Duyanovich and D. J. Craft", title = "A fast, highly reliable data compression chip and algorithm for storage systems", journal = j-IBM-JRD, volume = "40", number = "6", pages = "603--613", month = nov, year = "1996", CODEN = "IBMJAE", ISSN =pa @Article{Chen:2006:GCD, author = "Chih-Chun Chen and Jung-Hong Chuang", title = "Geometry Compression and Decompression: Texture Adaptation for Progressive Meshes", journal = j-CGF, volume = "25", number = "3", pages = "343--350", month = sep, year = "2006", CODEN = "CGFODY", DOI = "https://doi.org/10.1111/j.1467-8659.2006.00953.x", ISSN = "0167-7055 (print), 1467-86`A @Article{Chen:2005:TSC, author = "Zhe Chen and David Dagan Feng and Weidong Cai", title = "Temporal and Spatial Compression of Dynamic Positron Emission Tomography in Sinogram Domain", journal = j-INT-J-IMAGE-GRAPHICS, volume = "5", number = "4", pages = "839--??", month = oct, year = "2005", CODEN = "????", ISSN = "0219-4678", bibdate = "Wed Aug 23 08:55:54 MDT 2006", bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ijig.bib", acknowledgement = ack-nhfb, fjournal = "International Journal of Image and Graphics (IJIG)", journal-URL = "http://www.worldscientific.com/worldscinet/ijig", }? @Article{Chen:1999:MEF, author = "Hong-Chung Chen and Yue-Li Wang and Yu-Feng Lan", title = "A memory-efficient and fast {Huffman} decoding algorithm", journal = j-INFO-PROC-LETT, volume = "69", number = "3", pages = "119--122", day = "12", month = feb, year = "1999", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", S7 @Article{Chen:1996:ABPb, author = "I-Cheng K. Chen and John T. Coffey and Trevor N. Mudge", title = "Analysis of Branch Prediction Via Data Compression", journal = j-SIGPLAN, volume = "31", number = "9", pages = "128--137", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (φ1 @Article{Chen:1996:ABPa, author = "I-Cheng K. Chen and John T. Coffey and Trevor N. Mudge", title = "Analysis of branch prediction via data compression", journal = j-OPER-SYS-REV, volume = "30", number = "5", pages = "128--137", month = dec, year = "1996", CODEN = "OSRED8", ISSN = "0163-5980 (print), 1943-586X (electronic)", ISSN-L = "0163-5980", bibdate = "Sat Aug 26 08:55:55 MDT 2006", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/opersysrev.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGOPS Operating Systems Review", }= @Article{Chen:1994:CCI, author = "Yung-Sheng S. Chen and Hung-Tien T. Yen and Wen-Hsing H. Hsu", title = "Compression of Color Image via the Technique of Surface Fitting", journal = j-CVGIP-GMIP, volume = "56", number = "3", pages = "272--279", month = may, year = "1994", CODEN = "CGMPE5", DOI = "https://doi.org/10.1006/cgip.1994.1024", ISSN = "1049-Y fp*%K @Article{Sebe:2000:SDI, author = "Francesc Seb{\'e} and Josep Domingo-Ferrer and Jordi Herrera", title = "Spatial-Domain Image Watermarking Robust against Compression, Filtering, Cropping and Scaling", journal = j-LECT-NOTES-COMP-SCI, volume = "1975ʍR% @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", ISSN = "0001-0782 (print), 1557-7317 (electroni C @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", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://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.", }5>'O @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 = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/tugboat.bib", URL = "http://www.tug.org/TUGboat/Articles/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{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", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 26 e!C @Article{Ristov:1999:ZLC, author = "Strahil Ristov and Eric Laporte", title = "{Ziv--Lempel} Compression of Huge Natural Language Data Tries Using Suffix Arrays", journal = j-LECT-NOTES-COMP-SCI, volume = "1645", pages = "196--??", year = "1999", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Feb 5 11:54:24 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1645.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1645/16450196.htm; http://link.springer-ny.com/link/service/series/0558/papers/1645/16450196.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", }2 J[ 3-/W!57E;?+!Ec/Wmarticledatacompression.bibCormack:1985:DCDGordon V. CormackData compression on a database systemj-CACM28121336--1342dec121985CACMA20001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 00010782Thu May 30 09:41:10 MDT 1996ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1996.05.30 09:41:10 MDThttp://www.acm.org/pubs/toc/Abstracts/0001-0782/214963.htmlCommunications of the ACMdesign; IMS compression one (entire) record at a time.; management; performancebf E.4: Data, CODING AND INFORMATION THEORY, Data compaction and compression. bf H.2.0: Information Systems, DATABASE MANAGEMENT, General.ack-nhfbfirst partition into IMS based types, then Huffman. Gives factor two space, adds 17pct time.http://portal.acm.org/browse_dl.cfm?idx=J79Gordon V. CormackData compression on a database system @Article{Cormack:1985:DCD, author = "Gordon V. Cormack", title = "Data compression on a database system", journal = j-CACM, volume = "28", number = "12", pages = "1336--1342", month = dec, year = "1985", CODEN = "CACMA2", 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/Wiederhold.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/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.", }ce = "Compendex database; http://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", } NKZ 335y57E%;;'yy]#5yGarticledatacompression.bibCottingham:1985:CDSMarion S. CottinghamA Compressed Data Structure for Surface Representationj-CGF43217--228sep91985CGFODY0167-7055 (print), 1467-8659 (electronic) OR 01677055 (print), 14678659 (electronic)0167-7055 OR 01677055Mon Apr 14 10:23:20 MDT 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.04.14 10:23:20 MDTComputer Graphics Forumcompressed data structure; compressed data structure (CDS); computer graphics; computer graphics --- Imaging Techniques; constructive solid; data compression; data processing; data structures; Data Structures; data structures; facets; facets, design; geometrical information; geometry; high curvature; image processing; modelling; photometry information; polyhedron; ray casting; sculptured surface; shaded image; smooth image; solid object; solids --- Mathematical Models; surface patches; surface representation; surfaces --- Mathematical Models; topological information; verticesI.3 Computing Methodologies, COMPUTER GRAPHICS, Miscellaneous I.3.5 Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Curve, surface, solid, and object representationsack-nhfbUniv of Glasgow, Computing Science Dep, Glasgow, ScotlUniv of Glasgow, Computing Science Dep, Glasgow, ScotlDept. of Comput. Sci., Glasgow Univ., UKhttp://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/P PracticalMarion S. CottinghamA Compressed Data Structure for Surface Representation @Article{Cottingham:1985:CDS, author = "Marion S. Cottingham", title = "A Compressed Data Structure for Surface Representation", journal = j-CGF, volume = "4", number = "3", pages = "217--228", month = sep, year = "1985", CODEN = "CGFODY", ISSN = "0167-7055 (print), 1467-8659 (electronic)", ISSN-L = "0167-7055", bibdate = "Mon Apr 14 10:23:20 MDT 1997", bibsource = "Compendex database; http://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", } bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "Graphics/imager/imager.85.bib; http://portal.acm.org/; http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://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.", } ]MX 3+7q%--C7;e97uphdthesisdatacompression.bibFoulds:1985:DRTRichard Arthur FouldsA Data Reduction Technique for Minimum Bandwidth Transmission of Intelligible American Sign Language for the Deaf (Compression, Telecommunications, Communication, Rehabilitation)Ph.D. thesisTufts UniversityMedford, MA, USA2151985Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/303423885Engineering; Audiologyack-nhfbRichard Arthur FouldsA Data Reduction Technique for Minimum Bandwidth Transmission of Intelligible {American Sign Language} for the Deaf (Compression, Telecommunications, Communication, Rehabilitation) @PhdThesis{Foulds:1985:DRT, author = "Richard Arthur Foulds", title = "A Data Reduction Technique for Minimum Bandwidth Transmission of Intelligible {American Sign Language} for the Deaf (Compression, Telecommunications, Communication, Rehabilitation)", type = "{Ph.D.} thesis", school = "Tufts University", address = "Medford, MA, USA", pages = "215", year = "1985", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303423885", acknowledgement = ack-nhfb, classification = "0300: Audiology; 0537: Engineering", dissertation-thesis-number = "8602315", subject = "Engineering; Audiology", }LZ3)m =)57Eu;/wm karticledatacompression.bibDemko:1985:CFOStephen Demko and Laurie Hodges and Bruce NaylorConstruction of Fractal Objects with Iterated Function Systemsj-COMPUTERS-AND-GRAPHICS193271--278jul71985CGRADI, CPGPBZ0097-8930 (print), 1558-4569 (electronic) OR 00978930 (print), 15584569 (electronic)0097-8930 OR 00978930Sat Jan 26 12:46:16 MST 2013Graphics/imager/imager.85.bib; http://portal.acm.org/; http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTComputer GraphicsI35 fractals, I35 iterative methods, I35 geometric modelingack-dshttp://www.sciencedirect.com/science/journal/00978493Stephen Demko and Laurie Hodges and Bruce NaylorConstruction of Fractal Objects with Iterated Function Systems @Article{Demko:1985:CFO, author = "Stephen Demko and Laurie Hodges and Bruce Naylor", title = "Construction of Fractal Objects with Iterated Function Systems", journal = j-COMPUTERS-AND-GRAPHICS, volume = "19", number = "3", pages = "271--278", month = jul, year = "1985", CODEN = "CGRADI, CPGPBZ", 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/; http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://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.", } H H-OX!3/Q - +E};Q techreportdatacompression.bibFraenkel:1985:RUCA. S. Fraenkel and Shmuel T. KleinRobust Universal Complete Codes as Alternatives to Huffman CodesTechnical ReportCS85-16Department of Applied Mathematics, Weizmann Institute of ScienceRehovot, Israeloct101985Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsA. S. Fraenkel and Shmuel T. KleinRobust Universal Complete Codes as Alternatives to {Huffman} Codes @TechReport{Fraenkel:1985:RUC, author = "A. S. Fraenkel and Shmuel T. Klein", title = "Robust Universal Complete Codes as Alternatives to {Huffman} Codes", type = "Technical Report", number = "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 = "http://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.", }NW%3/IAO!E};/IOAkincollectiondatacompression.bibFraenkel:1985:NCSA. S. Fraenkel and S. T. KleinA. Apostolico and Z. GalilCombinatorial Algorithms on WordsNovel Compression of Sparse Bit-Strings---Preliminary Report12pub-SVpub-SV:adr169--1831985Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTNATO ASI Series Fack-dsA. S. Fraenkel and S. T. KleinCombinatorial Algorithms on WordsA. Apostolico and Z. GalilNovel Compression of Sparse Bit-Strings---Preliminary Report @InCollection{Fraenkel:1985:NCS, author = "A. S. Fraenkel and S. T. Klein", editor = "A. Apostolico and Z. Galil", booktitle = "Combinatorial Algorithms on Words", title = "Novel Compression of Sparse 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 = "http://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.", } (RW 3--E};5miscdatacompression.bibIEEE754:1985:ISBIEEE754ANSI/IEEE Standard 754-1985: IEEE Standard for Binary Floating-Point Arithmetic.1985Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsIEEE754{ANSI/IEEE Standard 754-1985}: {IEEE} Standard for Binary Floating-Point Arithmetic. @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 = "http://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.''", }yQ[39W]57Ey;yqgKe3y[]sarticledatacompression.bibGonzalezSmith:1985:PADM. E. Gonzalez Smith and J. A. StorerParallel Algorithms for Data Compressionj-J-ACM322344--373apr41985JACOAH0004-5411 (print), 1557-735X (electronic) OR 00045411 (print), 1557735X (electronic)0004-5411 OR 00045411Wed Jan 15 18:12:53 MST 1997Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib1997.01.15 18:12:53 MSThttp://www.acm.org/pubs/toc/Abstracts/0004-5411/3152.htmlParallel algorithms for data compression by textual substitution that are suitable for VLSI implementation are studied. Both `static' and `dynamic' dictionary schemes are considered.Journal of the Association for Computing MachineryAlgorithms; algomPX '3)3+K;CQC7;e+3/;mastersthesisdatacompression.bibFryer:1985:SDCJeffrey Keefe FryerA Survey of Data Compression Techniques and Their Application to VSPC Data SetsM.Sc.C.S.The University of New BrunswickFredericton, NB, Canada19850-315-23105-X OR 031523105X978-0-315-23105-4 OR 9780315231054Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/303433066Library scienceack-nhfbJeffrey Keefe FryerA Survey of Data Compression Techniques and Their Application to {VSPC} Data Sets @MastersThesis{Fryer:1985:SDC, author = "Jeffrey Keefe Fryer", title = "A Survey of Data Compression Techniques and Their Application to {VSPC} Data Sets", type = "{M.Sc.C.S.}", school = "The University of New Brunswick", address = "Fredericton, NB, Canada", pages = "????", year = "1985", ISBN = "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/; http://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", } "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/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.", }rithms; computer programming; computer systems, digital --- Parallel Processing; data compression; image information; parallel algorithms; statistics; theory; verification; VLSIbf E.4: Data, CODING AND INFORMATION THEORY, Data compaction and compression. bf B.7.1: Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration). bf F.2.2: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. bf G.1.0: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms. bf F.2.2: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. bf F.2.2: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. bf F.2.2: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout.ack-nhfbBrandeis Univ, Waltham, MA, USAhttp://portal.acm.org/browse_dl.cfm?idx=J401J Assoc Comput MachParallel algorithms for data compression by textual substitution that are suitable for VLSI implementation are studied. Both `static' and `dynamic' dictionary schemes are considered.M. E. {Gonzalez Smith} and J. A. StorerParallel Algorithms for Data Compression @Article{GonzalezSmith:1985:PAD, author = "M. E. {Gonzalez Smith} and J. A. Storer", title = "Parallel Algorithms for Data Compression", journal = j-J-ACM, volume = "32", number = "2", pages = "344--373", month = apr, year = "1985", CODEN = "JACOAH", 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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/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.", }5", 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; http://www.math.utah.edu/pub/tex/bib/bit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=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.", }