&=%<$:!8 52/,)&#! }zwvtsqok߇hއf݇cڇbԇ`҇\чYχV͇ṠQˇOɇMƇJŇHćEB@>=;852/-+(%"|{xvspmj~g}dxaw^u[tXrVqToSnRlQkPiMhJfHdGcDbBa?_=^;]8\5Y2W0U-S*R'Q$L"K JGBA?=:8 76 2/,+*(~&}%{$x usqpmjgec`\ YVTSQOMKJIGDA@>;852ޅ/څ+م'ׅ%ԅ$҅"х ͅʅŅÅ ~zwutsqomjifdb`^\ZWUR~O|M{JyHwGvFtDrBq?o<m:j7g5f2e/b,_+^(]&Z$Y!UTSQPMJIG EDB@?=|:z9w7v6u5r2o/l+h*f(c&`%^$\ZXUROMKHEB@ >;8 542/,)&# }zxu߂sނq܂oڂmׂkՂhӂfтd͂b˂_ʂ]Ă[XVTRQNLKIHFDCB@?><:8765310.,+}*{(y&w%s#p!n lifec`\ZWV SQN LIE@?}:{9x7u5s4q2p/o,m+k*i(g$e"cb`^]\[XVUTQOMLJGDہCB@?><:8642݁0.Ձ,ԁ*ҁ(́&́"ʁ ȁƁā }{yvtrpnlkig|dzbxav_t^q\nYmWkVhUdTbR_P^NXMSIQGMDKBI@G?E=D;B9@7?4;2:/8,5)2'1%/#.!) '%"! * \ [c he h +_? @Article{Netravali:1980:PCP, author = "A. Netravali and J. O. Limb", title = "Picture Coding: a Preview", journal = j-PROC-IEEE, volume = "68", pages = "366--406", year = "1980", CODEN = "IEEPAD", DOI = "https://doi.org/10.1109/proc.1980.11647", ISSN = "0018-9219 (print), 1558-2256 (electronic)", ISSN-L = "0018-9219", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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 = "Netravali, A. and J. O. Limb (1980) ``Picture Coding: A Preview,'' {\it Proceedings of the IEEE}, {\bf68}:366--406.", } @InProceedings{Ramchandran:1994:SCE, author = "K. Ramchandran and M. Vetterli", title = "Syntax-constrained encoder optimization using adaptive quantization thresholding for {JPEG\slash MPEG} coders", crossref = "Storer:1994:DDC", pages = "146--155", year = "1994", DOI = "https://doi.org/10.1109/DCC.1994.305922", bibdate = "Tue Feb 5 14:06:30 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305922", acknowledgement = ack-nhfb, }dI @Article{Fraenkel:1996:RUC, author = "Aviezri S. Fraenkel and Shmuel T. Klein", title = "Robust Universal Complete Codes for Transmission and Compression", journal = j-DISCRETE-APPL-MATH, volume = "64", number = "1", pages = "31--55", month = jan, year = "1996", CODEN = "DAMADU", DOI = "https://doi.org/10.1016/016v? @InProceedings{Lin:2001:RDO, author = "K. K. Lin and R. M. Gray", title = "Rate-distortion optimization for the {SPIHT} encoder", crossref = "Storer:2001:DPD", pages = "123--132", year = "2001", DOI = "https://doi.org/10.1109/DCC.2001.917143", bibdate = "Tue Feb 5 14:07:00 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917143", acknowledgement = ack-nhfb, }!um] @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.", }>= "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.", } o^ M @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 = "JV; @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.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)", K @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 B @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", DOI = "https://doi.org/10.1016/s0898-1221(00)00119-x", 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", }g? @Article{Abrahamson:1989:ADS, author = "David M. Abrahamson", title = "An Adaptive Dependency Source Model for Data Compression", journal = j-CACM, volume = "32", number = "1", pages = "77--83", month = jan, year = "1989", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/63238.63243", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", z 6Gi' @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.20+ @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", DOI = "https://doi.org/10.1147/rd.501.0149", ISSN = "0018-"\9 @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", DOI = "https://doi.org/10.1145/567112.567116", 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", }P^? @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 = TY3 @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", DOI = "https://doi.org/10.1109/18.556122", 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.", }|qc @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", DOI = "https://doi.org/10.1002/(sici)1097-024x(199909)29:11<943::aid-spe266>3.0.co;2-k", ISSN = m 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", } P%K @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", DOI = "https://doi.org/10.1016/j.jnca.2011.08.004", ISSN = "1084- 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 @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", DOI = "https://doi.org/10.1145/1028176.1006719", 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", }iB @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", DOI = "https://doi.org/10.1007/pl00009217", 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", }܇jU @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", DOI = "https://doi.org/10.1016/j.camwa.2007.11.043", 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", } $$YZ 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/Uqo"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", } Z 3-/_1q7E;S!O!/WcOarticledatacompression.bibShannon:1951:PEPClaude E. ShannonPrediction and Entropy of Printed Englishj-BELL-SYST-TECH-J30150--64jan11951BSTJANhttps://doi.org/10.1002/j.1538-7305.1951.tb01366.x0005-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.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.", } 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", }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", DOI = "https://doi.org/10.1002/j.1538-7305.1951.tb01366.x", ISSN = "0005-8580", ISSN-L = "", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://bstj.bell-labs.com/oldfiles/year.1951/BSTJ.1951.3001.html; http://www.alcatel-lucent.com/bstj/vol30-1951/bstj-vol30-issue01.html; 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", } O `fM @Article{Deligiannis:2014:PRW, author = "Nikos Deligiannis and Frederik Verbist and J{\"u}rgen Slowack and Rik van de Walle and Peter Schelkens and Adrian Munteanu", title = "Progressively refined {Wyner--Ziv} video coding for visual sensors", journal = j-TOSN, volume = "10", number = "2", pages = "21:1--21:??", month = jan, year = "2014", CODEN = "????"pcG @Article{Deng:2012:VIA, author = "Aidong Deng and Jianeng Tang and Li Zhao and Cairong Zou", title = "The variable-interval arithmetic coding using asymptotic deterministic randomness for data compression and encryption", journal = j-J-STAT-COMPUT-SIMUL, volume = "82", number = "10", pages = "1545--1555", year = "2012", CODEN = "JSCSAJ", DOI = "https://doi.org/10.1080/00949655.2011.587423", ISSN = "0094-9655 (print), 1026-7778 (electronic), 1563-5163", ISSN-L = "0094-9655", bibdate = "Tue Apr 22 09:13:07 MDT 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Statistical Computation and Simulation", journal-URL = "http://www.tandfonline.com/loi/gscs20", }uk @Article{Deng:2012:OAC, author = "Xi Deng and Yuanyuan Yang", title = "Online Adaptive Compression in Delay Sensitive Wireless Sensor Networks", journal = j-IEEE-TRANS-COMPUT, volume = "61", number = "10", pages = "1429--1442", month = oct, year = "2012", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2011.174", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Aug 29 17:46:04 2012", 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", }o_ @Article{Demko:1985:CFO, author = "Stephen Demko and Laurie Hodges and Bruce Naylor", title = "Construction of Fractal Objects with Iterated Function Systems", journal = j-COMPUTERS-AND-GRAPHICS, volume = "19", number = "3", pages = "271--278", month = jul, year = "1985", CODEN = "CGRADI, CPGPBZ", DOI = "https://doi.org/10.1145/325165.325245", ISSN = "0097-8930 (prin@ @Article{Delfino:1993:PMI, author = "Erik Delfino", title = "{PC} Monitor --- The {Internet} Toolkit: File Compression and Archive Utilities", journal = j-ONLINE, volume = "17", number = "6", pages = "90--??", day = "1", month = nov, year = "1993", CODEN = "ONLIDN", ISSN = "0146-5422", bibdate = "Tue Jun 18 10:55:20 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/internet.bib; UnCover library database", acknowledgement = ack-nhfb, fjournal = "Online", }v= @Article{Degener:1994:DSC, author = "Jutta Degener", title = "Digital Speech Compression", journal = j-DDJ, volume = "19", number = "15", pages = "30, 32, 34, 88--89", month = dec, year = "1994", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Wed Sep 04 09:01:48 1996", bibsource = "http://www.ddj.com/index/author/index.htm; http://www.math.utah.edu/pub/tex/bib/dat #V 3-!e9]7E};Y!earticledatacompression.bibChomsky:1956:TMDN. ChomskyThree Models for the Description of Languagej-IRE-TRANS-INF-THEORY23113--1241956IRITAYhttps://doi.org/10.1109/tit.1956.10568130096-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", DOI = "https://doi.org/10.1109/tit.1956.1056813", 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.", }gV 3-'!!a7E};k'Garticledatacompression.bibHuffman:1952:MCMDavid HuffmanA Method for the Construction of Minimum Redundancy Codesj-PROC-IRE4091098--11011952PIREAEhttps://doi.org/10.1109/jrproc.1952.2738980096-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", DOI = "https://doi.org/10.1109/jrproc.1952.273898", 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.", } |Z 3+);K57E;);=articledatacompression.bibGivens:1958:CPUWallace GivensComputation of Plane Unitary Rotations Transforming a General Matrix to Triangular Formj-J-SIAM6126--50mar31958JSIMAVhttps://doi.org/10.1137/01060040368-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", DOI = "https://doi.org/10.1137/0106004", ISSN = "0368-4245 (print), 1095-712X (electronic)", ISSN-L = "0368-4245", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", }mV 3//q;]57E};[/q%articledatacompression.bibMcMillan:1956:TIIBrockway McMillanTwo Inequalities Implied by Unique Decipherabilityj-IEEE-TRANS-INF-THEORY24115--116dec121956IETTAWhttps://doi.org/10.1109/tit.1956.10568180018-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", DOI = "https://doi.org/10.1109/tit.1956.1056818", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", } "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.", } :*X1 @Article{Dion:1993:CPC, author = "Pierre J. Dion", title = "Cross-Platform Compression", journal = j-DDJ, volume = "18", number = "12", pages = "32, 34, 36--37", month = dec, year = "1993", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 03 09:15:45 1996", bibsource = "http://www.ddj.com/index/author/index.htm; http://www.math.utah.edu/pub/tex/bib/datacompr'O @Article{Deorowicz:2000:IBW, author = "Sebastian Deorowicz", title = "Improvements to {Burrows--Wheeler} compression algorithm", journal = j-SPE, volume = "30", number = "13", pages = "1465--1483", day = "10", month = nov, year = "2000", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/1097-024X(20001110)30:13<1465::AID-SPE345>3.0.CO;2-D", ISSN = "0038-064qc @Article{Deorowicz:2002:SSA, author = "Sebastian Deorowicz", title = "Second step algorithms in the {Burrows--Wheeler} compression algorithm", journal = j-SPE, volume = "32", number = "2", pages = "99--111", month = feb, year = "2002", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.426", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038% @Article{Dickman:1992:PCS, author = "Chris Dickman", title = "The {President} and {CEO} of {Storm Technology} discusse"E @Article{Di:2018:OEB, author = "Sheng Di and Franck Cappello", title = "Optimization of Error-Bounded Lossy Compression for Hard-to-Compress {HPC} Data", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "29", number = "1", pages = "129--143", month = jan, year = "2018", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2017.2749300", ISSN = "1045-9219 (print), 1558-2183 (electronic)ITDSEO", ISSN-L = "1045-9219", bibdate = "Thu Dec 14 07:22:41 MST 2017", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib", URL = "https://www.computer.org/csdl/trans/td/2018/01/08031063-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } ӇU+ @Article{Diamantini:2001:EDC, author = "Claudia Diamantini and Maurizio Panti", title = "An Efficient Data Compression Approach to the Classification Task", journal = j-LECT-NOTES-COMP-SCI, volume = "2035", pages = "444--??", year = "2001", CODEN = "LNCSD9", DOI = "https://doi.org/10.1145/380995.381014", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat Feb 2 13:03:52 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2035.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2035/20350444.htm; http://link.springer-ny.com/link/service/series/0558/papers/2035/20350444.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Dhem:1997:LCA, author = "J. F. Dhem and J. J. Quisquater", title = "Lossless compression algorithms for smart cards: A progress report", journal = j-FUT-GEN-COMP-SYS, volume = "13", number = "1", pages = "27--38", month = jun, year = "1997", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/S0167-739X(97)89109-1", ISSN = "0167-739X (print), 1872-7115 (electro hV 3){;]57E};[{1articledatacompression.bibCapon:1959:PMRJ. CaponA Probabilistic Model for Run-length Coding of Picturesj-IEEE-TRANS-INF-THEORY54157--163dec121959IETTAWhttps://doi.org/10.1109/tit.1959.10575120018-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", DOI = "https://doi.org/10.1109/tit.1959.1057512", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", }8413 (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.", } lX3-GM1q73%Eu;+OG+MO#articledatacompression.bibGilbert:1959:VLBE. N. Gilbert and E. F. MooreVariable Length Binary Encodingsj-BELL-SYST-TECH-J384933--967jul71959BSTJANhttps://doi.org/10.1002/j.1538-7305.1959.tb01583.x0005-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", DOI = "https://doi.org/10.1002/j.1538-7305.1959.tb01583.x", ISSN = "0005-8580", ISSN-L = "", MRclass = "94.00", MRnumber = "0108413 (21 \#7129)", MRreviewer = "S. W. Golomb", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://bstj.bell-labs.com/oldfiles/year.1959/BSTJ.1959.3804.html; http://www.alcatel-lucent.com/bstj/vol38-1959/bstj-vol38-issue04.html; 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.", } ZoV 3%O9]7E};YOMarticledatacompression.bibMax:1960:QMDJoel MaxQuantizing for minimum distortionj-IRE-TRANS-INF-THEORYIT-67--12mar31960IRITAYhttps://doi.org/10.1109/tit.1960.10575480096-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", DOI = "https://doi.org/10.1109/tit.1960.1057548", 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.", }#V 3+O9K7E};UOQparticledatacompression.bibDurbin:1960:FTSJ. DurbinThe Fitting of Time-Series Modelsj-REV-INST-INT-STATIST28233--3441960https://doi.org/10.2307/14013220373-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 = "", DOI = "https://doi.org/10.2307/1401322", 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", } 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/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.", } wfDU" 3 @Article{Grossi:2015:FCT, author = "Roberto Grossi and Giuseppe Ottaviano", title = "Fast Compressed Tries through Path Decompositions", journal = j-ACM-J-EXP-ALGORITHMICS, volume = "19", number = "??", pages = "1.8:1--1.8:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2656332", ISSN = "1084-6654", bibdate = "Fri Apr 3 16:22:03 MDT 2015", bib @Article{Gonzalez:2015:LCS, author = "Rodrigo Gonz{\'a}lez and Gonzalo Navarro and H{\'e}ctor Ferrada", title = "Locally Compressed Suffix Arrays", journal = j-ACM-J-EXP-ALGORITHMICS, volume = "19", number = "??", pages = "1.1:1--1.1:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2594408", ISSN = "1084-6654", bibdate = "Fri Apro_ @Article{GonzalezSmith:1985:PAD, author = "M. E. {Gonzalez Smith} and J. A. Storer", title = "Parallel Algorithms for Data Compression", journal = j-J-ACM, volume = "32", number = "2", pages = "344--373", month = apr, year = "1985", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3149.3152", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate @Article{Grassi:2012:KSP, author = "Elena Grassi and Federico Di Gregorio and Ivan Molineris", title = "{KungFQ}: a Simple and Powerful Approach to Compress {{\tt fastq}} Files", journal = j-TCBB, volume = "9", number = "6", pages = "1837--1842", month = nov, year = "2012", CODEN = "ITCBCY", DOI = "https://doi.org/10.1109/TCBB.2012.123", ISSN = "1545 їpa @Article{Gorjiara:2008:MDC, author = "Bita Gorjiara and Mehrdad Reshadi and Daniel Gajski", title = "Merged Dictionary Code Compression for {FPGA} Implementation of Custom Microcoded {PEs}", journal = j-TRETS, volume = "1", number = "2", pages = "11:1--11:??", month = jun, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1371579.1371583", ISSN = "1936-74 @T) @Article{Gu:2005:LAO, author = "Hung-Yan Gu", title = "A large-alphabet-oriented scheme for {Chinese} and {English} text compression", journal = j-SPE, volume = "35", number = "11", pages = "1027--1039", month = sep, year = "2005", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.661", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-064Ք @Article{Gross:1999:CMV, author = "Markus H. Gross and Lars Lippert and Oliver G. Staadt", title = "Compression Methods for Visualization", journal = j-FUT-GEN-COMP-SYS, volume = "15", number = "1", pages = "11--29", day = "12", month = feb, year = "1999", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/s0167-739x(98)00053-3", ISSN = "0167-739X (print), 1rg @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://wwN Ft 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.", }OW 3'!#]E};;! articledatacompression.bibKarp:1961:MRCR. S. KarpMinimum-Redundancy Coding for the Discrete Noiseless Channelj-TRANS-IRE727--381961https://doi.org/10.1109/tit.1961.1057615Sat 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 = "", DOI = "https://doi.org/10.1109/tit.1961.1057615", 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.", }7W 3-+w;]7Eq;]+wc 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.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.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", } 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", } Z Y35]/i57E;_SkW]cm%articledatacompression.bibEisenberger:1965:SSUIsidore Eisenberger and Edward C. PosnerSystematic Statistics Used for Data Compression in Space Telemetryj-J-AM-STAT-ASSOC6030997--133mar31965JSTNALhttps://doi.org/10.1080/01621459.1965.104807780162-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", DOI = "https://doi.org/10.1080/01621459.1965.10480778", ISSN = "0162-1459 (print), 1537-274X (electronic)", ISSN-L = "0162-1459", bibdate = "Wed Jan 25 08:05:37 MST 2012", bibsource = "http://www.jstor.org/journals/01621459.html; http://www.jstor.org/stable/i314190; 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.", }! R uq @Article{Larmore:1995:CHT, author = "Lawrence L. Larmore and Teresa M. Przytycka", title = "Constructing {Huffman} Trees in Parallel", journal = j-SIAM-J-COMPUT, volume = "24", number = "6", pages = "1163--1169", month = dec, year = "1995", CODEN = "SMJCAT", DOI = "https://doi.org/10.1137/S0097539792233245", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5]; @Article{Laney:2014:AED, author = "Daniel Laney and Steven Langer and Christopher Weber and Peter Lindstrom and Al Wegener", title = "Assessing the effects of data compression in simulations using physically motivated metrics", journal = j-SCI-PROG, volume = "22", number = "2", pages = "141--155", month = "????", year = "2014", CODEN = "SCIPEV", DOI = "https://doi.org/10.3233/SPR-140386", ISSN = "1058-9244 (print), 1875-919X (electronic)", ISSN-L = "1058-9244", bibdate = "Tue Sep 9 18:01:01 MDT 2014", bibsource = "http://www.iospress.nl/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/sciprog.bib", acknowledgement = ack-nhfb, fjournal = "Scientific Programming", journal-URL = "http://iospress.metapress.com/content/1058-9244", } B @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.", }[7 @Article{Langdon:1981:CBW, author = "Glen G. Langdon and ~and J. Rissanen", title = "Compression of Black White Images with Arithmetic Coding", journal = j-IEEE-TRANS-COMM, volume = "COM-29", number = "6", pages = "858--867", month = jun, year = "1981", CODEN = "IECMBT", DOI = "https://doi.org/10.1109/tcom.1981.1095052", ISSN = "0090-6778 (print), 1558-0857 (electronic)", ISSN-L = "0090-6778", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", },Y @Article{Lamparter:1994:ECC, author = "B. Lamparter and W. Effelsberg", title = "{eXtended} Color Cell Compression --- a Runtime-efficient Compression Scheme for Software Video", journal = j-LECT-NOTES-COMP-SCI, volume = "868", pages = "181--??", year = "1994", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Mon May 13 11:52:14 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } < Ire @Article{Anedda:1988:CQI, author = "C. Anedda and L. Felician", title = "{$P$}-Compressed Quadtrees for Image Storing", journal = j-COMP-J, volume = "31", number = "4", pages = "353--357", year = "1988", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/31.4.353", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", rawdata = "Anedda, C. and L. Felician (1988) ``P-Compressed Quadtrees for Image Storing,'' {\it The Computer Journal}, {\bf31}(4):353--357.", }Љ @Article{Anonymous:1986:CDF, author = "Anonymous", title = "Compression\slash Decompression of Font Patterns", journal = j-IBM-TDB, volume = "28", number = "8", pages = "3563--3564", month = jan, year = "1986", CODEN = "IBMTAA", ISSN = "0018-8689", bibdate = "Mon Dec 16 08:30:04 MST 1996", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacom!! @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", DOI = "https://doi.org/10.1016/0020-0255(96)00089-8", 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", }bB @Article{Amsterdam:1986:DCH, author = "Jonathan Amsterdam", title = "Data Compression with {Huffman} Coding", journal = j-BYTE, volume = "11", number = "5", pages = "99--108", month = may, year = "1986", CODEN = "BYTEDJ", ISSN = "0360-5280 (print), 1082-7838 (electronic)", ISSN-L = "0360-5280", bibsource = "http://www.math.utah.edu/pub/tex/bib/byte1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", fjournal = "BYTE Magazine", }wo @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", DOI = "https://doi.org/10.1007/pl00009217", ISSN = "0178-4617 (print), 1kW @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", DOI = "https://doi.org/10.1016/j.camwa.2007.05.014", ISSN = "0898-1221 (print), 18 n PCn>} @Article{Baron:2005:ASS, author = "D. Baron and Y. Bresler", title = "Antisequential suffix sorting for {BWT}-based data compression", journal = j-IEEE-TRANS-COMPUT, volume = "54", number = "4", pages = "385--397", month = apr, year = "2005", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2005.56", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", 0a @Article{Baig:2017:MHC, author = "Mohammad Haris Baig and Lorenzo Torresani", title = "Multiple hypothesis colorization and its application to image compression", journal = j-COMP-VIS-IMAGE-UNDERSTANDING, volume = "164", number = "??", pages = "111--123", month = nov, year = "2017", CODEN = "CVIUF4", ISSN = "1077-3142 (print), 1090-235X (electronic)", ISSN-L = "1077-3142", bibdate = "Sat Dec 23 07:29:56 MST 2017", bibsource = "http://www.math.utah.edu/pub/tex/bib/cviu.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1077314217300267", acknowledgement = ack-nhfb, fjournal = "Computer Vision and Image Understanding: CVIU", journal-URL = "http://www.sciencedirect.com/science/journal/10773142/", } [7 @Article{B:1999:DIF, author = "Praveen B. and Deepak Gupta and Rajat Moona", title = "Design and implementation of a file system with on-the-fly data compression for {GNU/Linux}", journal = j-SPE, volume = "29", number = "10", pages = "863--874", month = aug, year = "1999", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibsӇQ# @Article{Bar-Joseph:2003:CHC, author = "Ziv Bar-Joseph and Daniel Cohen-Or", title = "Compression: Hierarchical Context-based Pixel Ordering", journal = j-CGF, volume = "22", number = "3", pages = "349--358", month = sep, year = "2003", CODEN = "CGFODY", DOI = "https://doi.org/10.1111/1467-8659.00682", ISSN = "0167-7055 (print), 1467-8659 (electronic)", ISSN-L = "0167-7055", bibdate = "Sat May 11 15:15:56 MDT 2013", bibsource = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/; http://www.math.utah.edu/pub/tex/bib/cgf.bib; 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/", onlinedate = "4 Nov 2003", }[vm @Article{Balkenhol:2000:UDC, author = "B. Balkenhol and S. Kurtz", title = "Universal data compression based on the {Burrows--Wheeler} transformation: theory and practice", journal = j-IEEE-TRANS-COMPUT, volume = "49", number = "10", pages = "1043--1053", month = oct, year = "2000", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/12.888040", ISSN = @Article{Apostolico:1987:RTU, author = "Alberto Apostolico and A. S. Fraenkel", title = "Robust Transmission of Unbounded Strings {Using} {Fibonacci} Representations", journal = j-IEEE-TRANS-INF-THEORY, volume = "33", number = "2", pages = "238--245", month = mar, year = "1987", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/tit.1987.1057284", ISSN = "0018-9448 (pr8 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.", } 4 4)#U 3'a#a7E};5uGarticledatacompression.bibFang:1966:IIEI. FangIt Isn't ETAOIN SHRDLU; It's ETAONI RSHDLCj-JOURNAL-Q43761--7621966JOQUAXhttps://doi.org/10.1177/1077699066043004180196-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", DOI = "https://doi.org/10.1177/107769906604300418", 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/){#Y57E};;){Qarticledatacompression.bibDavisson:1966:CSTI. D. DavissonComments on `Sequence Time Coding for Data Compression'j-PROC-IEEE542010dec121966IEEPADhttps://doi.org/10.1109/proc.1966.51670018-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", DOI = "https://doi.org/10.1109/proc.1966.5167", ISSN = "0018-9219 (print), 1558-2256 (electronic)", ISSN-L = "0018-9219", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", } " 3M^o) @Article{Franti:1994:CDI, author = "Pasi Fr{\"a}nti and Olli Nevalainen and Timo Kaukoranta", title = "Compression of digital images by block truncation coding: a survey", journal = j-COMP-J, volume = "37", number = "4", pages = "308--332", month = "????", year = "1994", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/37.4.308", ISSN = "0010- {w @Article{Franti:1993:TSM, author = "Pasi Fr{\"a}nti and Olli Nevalainen", title = "A two-stage modelling method for compressing binary images by arithmetic coding", journal = j-COMP-J, volume = "36", number = "7", pages = "615--622", month = "????", year = "1993", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/36.7.615", ISSN = "0010-4620 (print), 1460-2067 ? @Article{Frank:1980:PIT, author = "Amalie J. Frank and J. D. Daniels and Diane R. Unangst", title = "Progressive Image Transmission Using a Growth-Geometry Coding", journal = j-PROC-IEEE, volume = "68", number = "7", pages = "897--909", month = jul, year = "1980", CODEN = "IEEPAD", DOI = "https://doi.org/10.1109/proc.1980.11755", ISSN = "0018-9219 (pdI @Article{Fraenkel:1996:RUC, author = "Aviezri S. Fraenkel and Shmuel T. Klein", title = "Robust Universal Complete Codes for Transmission and Compression", journal = j-DISCRETE-APPL-MATH, volume = "64", number = "1", pages = "31--55", month = jan, year = "1996", CODEN = "DAMADU", DOI = "https://doi.org/10.1016/0166-218x(93)00116-h", ISSN = "0166-218X (print), 1872-6771 (electronic)", ISSN-L = "0166-218X", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, fjournal = "Discrete Applied Mathematics", rawdata = "Fraenkel, Aviezri S. and Shmuel T. Klein (1996) ``Robust Universal Complete Codes for Transmission and Compression,'' {\it Discrete Applied Mathematics}, {\bf64}(1):31--55, January.", }- @Article{Fraenkel:1990:BHC, author = "Aviezri S. Fraenkel and Shmuel T. Klein", title = "Bidirectional {Huffman} Coding", journal = j-COMP-J, volume = "33", number = "4", pages = "296--307", month = aug, year = "1990", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/33.4.296", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", MRclass = "3g @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)", ߖbE @Article{Fox:1991:OPM, author = "Edward A. Fox and Qi Fan Chen and Amjad M. Daoud and Lenwood S. Heath", title = "Order Preserving Minimal Perfect Hash Functions and Information Retrieval", journal = j-TOIS, volume = "9", number = "3", pages = "281--308", month = jul, year = "1991", CODEN = "ATISET", DOI = "https://doi.org/10.1145/125187.125200", ISSN = %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", }Y$V 3+/5;]57E};[/5{articledatacompression.bibGolomb:1966:RLESolomon W. GolombRun-Length Encodingsj-IEEE-TRANS-INF-THEORYIT-123399--4011966IETTAWhttps://doi.org/10.1109/tit.1966.10539070018-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", DOI = "https://doi.org/10.1109/tit.1966.1053907", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", } )E'Y 35])/!K57E;ISkW]M)Warticledatacompression.bibEisenberger:1967:CSSIsidore Eisenberger and Edward C. PosnerCorrigenda: Systematic Statistics used for Data Compression in Space Telemetryj-J-AM-STAT-ASSOC623201518--1518dec121967JSTNALhttps://doi.org/10.2307/22838120162-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", DOI = "https://doi.org/10.2307/2283812", ISSN = "0162-1459 (print), 1537-274X (electronic)", ISSN-L = "0162-1459", bibdate = "Wed Jan 25 08:05:39 MST 2012", bibsource = "http://www.jstor.org/journals/01621459.html; http://www.jstor.org/stable/i314202; 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", }T&V 3)#_#!Y57E};;#_{articledatacompression.bibLynch:1966:STCT. J. LynchSequence Time Coding for Data Compressionj-PROC-IEEE541490--1491oct101966IEEPADhttps://doi.org/10.1109/proc.1966.51670018-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", DOI = "https://doi.org/10.1109/proc.1966.5167", ISSN = "0018-9219 (print), 1558-2256 (electronic)", ISSN-L = "0018-9219", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", } 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/", }( QQg)[3+QAW57EC;/k?ckQ/AMarticledatacompression.bibMarron:1967:ADCB. A. Marron and P. A. D. de MaineAutomatic Data Compressionj-CACM1011711--715nov111967CACMA2https://doi.org/10.1145/363790.3638130001-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; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2007:(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/", }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", })5.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", DOI = "https://doi.org/10.1145/363790.363813", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Fri Nov 25 18:20:16 MST 2005", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://www.acm.org/pubs/contents/journals/cacm/; 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", } "-[ @ArtZ5 @Article{Min:2012:DCT, author = "Joonki Min and Jookyoung Kim and Youngmi Kwon", title = "Data Compression Technique for Wireless Sensor Networks", journal = j-LECT-NOTES-COMP-SCI, volume = "7425", pages = "9--16", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-32645-5_2", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:22:17 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/lncs2012g.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-32645-5_2/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-32645-5", book-URL = "http://www.springerlink.com/content/978-3-642-32645-5", fjournal = "Lecture Notes in Computer Science", }8q @Article{Mitra:2006:XET, author = "S. Mitra and K. S. Kim", title = "{XPAND}: an efficient test stimulus compression technique", journal = j-IEEE-TRANS-COMPUT, volume = "55", number = "2", pages = "163--173", month = feb, year = "2006", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2006.31", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Jul 4 15:35:52 MDT 2011", bibsource = "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=1566577", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } }{ @Article{Mitra:1998:SPI, author = "Suman K. Mitra and C. A. Murthy and Malay K. Kundu", title = "A Study on Partitioned Iterative Function Systems for Image Compression", journal = j-FUND-INFO, volume = "34", number = "4", pages = "413--428", month = jul, year = "1998", CODEN = "FUMAAJ", DOI = "https://doi.org/10.3233/FI-1998-34405", 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", }~X1 @Article{Mitin:2003:PSI, author = "Alexander V. Mitin and Jon Baker and Krzysztof Wolinski and Peter Pulay", title = "Parallel stored-integral and semidirect {Hartree--Fock} and {DFT} methods with data compression", journal = j-J-COMPUT-CHEM, volume = "24", number = "2", pages = "154--160", day = "30", month = jan, year = "2003", CODEN = "JCCH9m[ @Article{Milward:2004:DIL, author = "Mark Milward and Jos{\'e} Luis N{\'u}{\~n}ez and David Mulvaney", title = "Design and Implementation of a Lossless Parallel High-Speed Data Compression System", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "15", number = "6", pages = "481--490", month = jun, year = "2004", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/T 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", } #2^3+CW57Ee;[?g/c#[C?articledatacompression.bibAmidon:1971:ASBE. L. Amidon and G. S. AkinAlgorithmic Selection of the Best Method for Compressing Map Data Stringsj-CACM1412769--774dec121971CACMA2https://doi.org/10.1145/362919.3629310001-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.=;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", }N-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", }2html#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", DOI = "https://doi.org/10.1145/362919.362931", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:21:16 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#AmidonA71; 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", } ** m ]; @MastersThesis{Ramlaoui:1992:DCR, author = "Hussam Ibrahim Ramlaoui", title = "Data compression review and implementation", type = "{M.S.} thesis", school = "California State University, Long Beach", address = "Long Beach, CA, USA", pages = "72", year = "1992", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/304033789", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "1349677", subject = "Electrical engineering", };uk @MastersThesis{Schmidt:1986:SRC, author = "Alfred Rudolf Schmidt", title = "Secondary Range Compression for Improved Range\slash {Doppler} Processing of {SAR} Data with High Squint", type = "{M.A.Sc}", school = "The University of British Columbia", address = "Vancouver, BC, Canada", pages = "xviii + 213", year = "1986", ISBN = "0-315-36707-5", ISBN-13 = "978-0-315-36707-4", LCCN = "????", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303539025", acknowledgement = ack-nhfb, classification = "0537: Engineering", dissertation-thesis-number = "ML36707", subject = "Engineering", } c @MastersThesis{Snow:1976:ICT, author = "Roderick Charles Snow", title = "An investigation of clustering techniques, query methods and data base compression with respect to the enlkW @MastersThesis{Shah:1994:EDC, author = "Jaimin B. Shah", title = "An evaluation of data compression algorithms using the communication network simulation", type = "{M.S.E.} thesis", school = "The University of Alabama in Huntsville", address = "Huntsville, AL, USA", pages = "111", year = "1994", 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/304135847", acknowledgement = ack-nhfb, advisor = "Mark Maier", classification = "0544: Electrical engineering; 0984: Computer science", dissertation-thesis-number = "1360556", subject = "Electrical engineering; Computer science", } kaC @MastersThesis{Stamplecoskie:2009:DCB, author = "Jennifer Krista Stamplecoskie", title = "Data compression of {Blainville}'s beaked whale vocalizations = {La} compression de vocalizations de baleine {\`a} bec de {Blainville}", type = "{Master of Applied Science in Signal Processing}", school = "Division of Graduate Studies, Royal Military College of Canada", address = "St. Jean, QC, Canad ۆ0c @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", }f .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", } 47V 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|.", }g5X 3+/;]57E};[/= articledatacompression.bibRudner:1971:CMRB. RudnerConstruction of Minimum-Redundancy Codes with an Optimum Synchronization Propertyj-IEEE-TRANS-INF-THEORY174478--487jul71971IETTAWhttps://doi.org/10.1109/tit.1971.10546570018-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", DOI = "https://doi.org/10.1109/tit.1971.1054657", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", }013", 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|.", }8 HC9V 3+%5;]57E};[%5carticledatacompression.bibGolomb:1972:RLES. W. GolombRun-Length Encodingsj-IEEE-TRANS-INF-THEORYIT-123399--4011972IETTAWhttps://doi.org/10.1109/tit.1966.10539070018-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", DOI = "https://doi.org/10.1109/tit.1966.1053907", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:09 MST 2013", bibsource = "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.", }58W 3+)1!q57E};[3])1Sarticledatacompression.bibGardner:1972:MGMartin GardnerMathematical Gamesj-SCI-AMER2272106--106aug81972SCAMAChttps://doi.org/10.1038/scientificamerican0872-1060036-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", DOI = "https://doi.org/10.1038/scientificamerican0872-106", ISSN = "0036-8733 (print), 1946-7087 (electronic)", ISSN-L = "0036-8733", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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|.", } }ys @Article{Peterson:1980:CPD, author = "James Lyle Peterson", title = "Computer Programs for Detecting and Correcting Spelling Errors",;w @Article{Pattem:2008:ISC, author = "Sundeep Pattem and Bhaskar Krishnamachari and Ramesh Govindan", title = "The impact of spatial correlation on routing with compression in wireless sensor networks", journal = j-TOSN, volume = "4", number = "4", pages = "24:1--24:??", month = aug, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1387663.1387670", t @Article{Payan:2007:TWB, author = "Fr{\'e}d{\'e}ric Payan and Marc Antonini", title = "Temporal wavelet-based compression for {$3$D} animated models", journal = j-COMPUTERS-AND-GRAPHICS, volume = "31", number = "1", pages = "77--88", month = jan, year = "2007", CODEN = "COGRD2", DOI = "https://doi.org/10.1016/j.cag.2006.09.009", ISSN = "0097-8493 (print), 1873-7684 (' @Article{Papadopoulos:2010:TRM, author = "Konstantinos Papadopoulos and Ioannis Papaefstathiou", title = "{Titan-R}: a Multigigabit Reconfigurable Combined Compression\slash Decompression Unit", journal = j-TRETS, volume = "3", number = "2", pages = "7:1--7:??", month = may, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1754386.1754388", ISSN = "1936- 3:u @Article{Parodi:2010:PLA, author = "Mauro Parodi and Mauro Gaggero and Marco Storace", title = "Piecewise linear approximations of multivariate functions: a multiresolution-based compression algorithm suitable for circuit implementation", journal = j-APPL-NUM-MATH, volume = "60", number = "9", pages = "924--933", month = sep, year = "2010", CODEN = "ANMAEL", DOI = 6sQ @ArtifM @Article{Park:2017:HHC, author = "Jaehyun Park and Seungcheol Baek and Hyung Gyu Lee and Chrysostomos Nicopoulos and Vinson Young and Junghee Lee and Jongman Kim", title = "{HoPE}: Hot-Cacheline Prediction for Dynamic Early Decompression in Compressed {LLCs}", journal = j-TODAES, volume = "22", number = "3", pages = "40:1--40:??", month = may, year = "2017", COz= @Article{Pande:2012:PDP, author = "Amit Pande and Joseph Zambreno", title = "{Poly-DWT}: {Polymorphic} wavelet hardware support for dynamic image compression", journal = j-TECS, volume = "11", number = "1", pages = "6:1--6:??", month = mar, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2146417.2146423", ISSN = "1539-9087 (print), 1558-3465 (electronic @Ar @Article{Pande:2013:SMC, author = "Amit Pande and Prasant Mohapatra and Joseph Zambreno", title = "Securing Multimedia Content Using Joint Compression and Encryption", journal = j-IEEE-MULTIMEDIA, volume = "20", number = "4", pages = "50--61", month = oct # "\slash " # dec, year = "2013", CODEN = "IEMUE4", DOI = "https://doi.org/10.1109/MMUL.2012.29", ISSN = "1070-986X (print), 1941-0166 (electronic)", ISSN-L = "1070-986X", bibdate = "Mon Aug 25 06:43:49 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib", acknowledgement = ack-nhfb, fjournal = "IEEE MultiMedia", } * y y ;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", }w:V 3)#A!o57E};3]#Aarticledatacompression.bibHeath:1972:OBCF. G. HeathOrigins of the Binary Codej-SCI-AMER227276--76aug81972SCAMAChttps://doi.org/10.1038/scientificamerican0872-760036-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", DOI = "https://doi.org/10.1038/scientificamerican0872-76", ISSN = "0036-8733 (print), 1946-7087 (electronic)", ISSN-L = "0036-8733", bibdate = "Sat Jan 26 12:46:09 MST 2013", bibsource = "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.", } Z Z>=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", }bV 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 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 EVgxS' @Article{Lefebvre:2002:CLL, author = "Arnaud Lefebvre and Thierry Lecroq", title = "{Compror}: On-line lossless data compression with a factor oracle", journal = j-INFO-PROC-LETT, volume = "83", number = "1", pages = "1--6", day = "16", month = jul, year = "2002", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/s0020-0190(01)00308-8", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon Jan 26 08:44:29 MST 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc2000.bib; http://www.sciencedirect.com/science/journal/00200190", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", }<y @Article{Lee:2017:IEE, author = "S. Lee and K. Kim and G. Koo and H. Jeon and M. Annavaram and W. W. Ro", title = "Improving Energy Efficiency of {GPUs} through Data Compression and Compressed Execution", journal = j-IEEE-TRANS-COMPUT, volume = "66", number = "5", pages = "834--847", month = may, year = "2017", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/p @Article{Lee:2014:JEP, author = "Jae-Gil Lee and Gopi Attaluri and Ronald Barber and Naresh Chainani and Oliver Draese and Frederick Ho and Stratos Idreos and Min-Soo Kim and Sam Lightstone and Guy Lohman and Konstantinos Morfonios and Keshava Murthy and Ippokratis Pandis and Lin Qiao and Vijayshankar Raman and Vincent Kulandai Samy and Richard Sidle and Knut Stolze and Ly+W @Article{Lee:2005:IEC, author = "B. K. Lee and L. K. John", title = "Implications of executing compression and encryption applications on general purpose processors", journal = j-IEEE-TRANS-COMPUT, volume = "54", number = "7", pages = "917--922", month = jul, year = "2005", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2005.121", ISSN = "0018-9340 (print), 1557J @Article{Lee:2003:AMM, author = "J.-S. Lee and W.-K. Hong and S.-D. Kim", title = "Adaptive Methods to Minimize Decompression Overhead for Compressed On-Chip Caches", journal = j-INT-J-COMPUT-APPL, volume = "25", number = "2", pages = "98--105", year = "2003", DOI = "https://doi.org/10.1080/1206212X.2003.11441690", ISSN = "1206-212X (print), 1925-7074 (electronic)", ISSN-L = "1206-212X", bibdate = "Sat Apr 21 17:20:50 MDT 2018", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ijca.bib", URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2003.11441690", acknowledgement = ack-nhfb, fjournal = "International Journal of Computer Applications", journal-URL = "https://www.tandfonline.com/loi/tjca20", online-date = "11 Jul 2015", }0c @Article{Lea:1978:TCA, author = "R. M. Lea", title = "Text Compression with an Associative Parallel Processor", journal = j-COMP-J, volume = "21", number = "1", pages = "45--56", month = feb, year = "1978", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/21.1.45", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = pc 'p47o @Article{Bocharova:1994:TCL, author = "I. E. Bocharova and V. D. Kolesnik and V. {Yu Krachkovsky} and B. D. Kudryashov", title = "On Trellis Codes for Linear= @Article{Blinn:1993:WDD, author = "J. F. Blinn", title = "{What}'s the Deal with the {DCT}", journal = j-IEEE-CGA, volume = "13", number = "4", pages = "78--83", month = jul, year = "1993", CODEN = "ICGADZ", DOI = "https://doi.org/10.1109/38.219457", ISSN = "0272-1716 (print), 1558-1756 (electronic)", ISSN-L = "0272-1716", bibdate = "Sat Jan 26 12:46:09 MST 2013", bi K @Article{Bassiouni:1985:DCS, author = "M. A. Bassiouni", title = "Data Compression in Scientific and Statistical Databases", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "SE-11", number = "10", pages = "1047--1058", month = oct, year = "1985", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/TSE.1985.231852", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Thu Feb 1 08:07:37 MST 2018", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1701920", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", }ZjU @Article{Bonny:2010:HBC, author = "Talal Bonny and J{\"o}rg Henkel", title = "{Huffman}-based code compression techniques for embedded processors", journal = j-TODAES, volume = "15", number = "4", pages = "31:1--31:??", month = sep, year = "2010", CODEN = "ATASFO", DOI = "https://doi.org/10.1145/1835420.1835424", ISSN = "1084-4309 (print), 1557-7309 (electronic)", @Article{Bertram:2004:GBS, author = "Martin Bertram and Mark A. Duchaineau and Bernd Hamann and Kenneth I. Joy", title = "Generalized {B}-Spline Subdivision-Surface Wavelets for Geometry Compression", journal = j-IEEE-TRANS-VIS-COMPUT-GRAPH, volume = "10", number = "3", pages = "326--338", month = may # "\slash " # jun, year = "2004", CODEN = "ITVGEA", DOI = "nߚ={ @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", DOI = "https://doi.org/10.1145/179812.179892", ISSN = "0004-5411 (print), 1557-735X (electronic)", IfM @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 `%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", } o" 3okW @Article{Schmiedekamp:2006:CCS, author = "Mendel Schmiedekamp and Aparna Subbu and Shashi Phoha", title = "The Clustered Causal State Algorithm: Efficient Pattern Discovery for Lossy Data-Compression Applications", journal = j-COMPUT-SCI-ENG, volume = "8", number = "5", pages = "59--67", month = sep # "\slash " # oct, year = "2006", CODEN = "CSENFA", DN @Article{Schwarz:2007:OSV, author = "Heiko Schwarz and Detlev Marpe and Thomas Wiegand", title = "Overview of the Scalable Video Coding Extension of the {H.264\slash AVC} Standard", journal = j-IEEE-TRANS-CIRCUITS-SYST-VIDEO-TECH, volume = "17", number = "9", pages = "1103--1120", month = sep, year = "2007", CODEN = "ITCTEM", ISSN = "1051-8215 (print), 1558-2205 (electronic)", 8C @Article{Searfoss:1990:BBD, author = "Glenn Searfoss", title = "Bounding Box Data Compression", journal = j-DDJ, volume = "15", number = "4", pages = "56--64, 108", month = apr, year = "1990", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 03 09:12:37 1996", bibsource = "http://www.ddj.com/index/author/index.htm; http://www.math.utah.edu/pub/tex/bib/datacoۇS' @Article{Scott:2002:AAO, author = "David A. Scott", titl @Article{Schwartz:2011:IFI, author = "William Robson Schwartz and Helio Pedrini", title = "Improved Fractal Image Compression Based on Robust Feature Descriptors", journal = j-INT-J-IMAGE-GRAPHICS, volume = "11", number = "4", pages = "571--587", month = oct, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1142/S0219467811004251", ISSN = "0219-4678", bibdate = "Wed Feb 8 18:48:57 MST 2012", 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", }W/ @Article{Schieber:1994:RRT, author = "Colleen D. Schieber and Eric E. Johnson", title = "{RATCHET}: real-time address trace compression hardware for extended traces", journal = j-SIGMETRICS, volume = "21", number = "3--4", pages = "22--32", month = apr, year = "1994", CODEN = "????", DOI = "https://doi.org/10.1145/181840.181842", ISSN = "0163-5999 (print), 1557-9484 0^= @Article{Scheuermann:1994:CBI, author = "P. Scheuermann and A. Yaagoub and M. Aris Ouksel", title = "Compression of Binary Images on a Hypercube Machine", journal = j-J-PAR-DIST-COMP, volume = "23", number = "1", pages = "49--59", month = oct, year = "1994", CODEN = "JPDCER", DOI = "https://doi.org/10.1006/jpdc.1994.1118", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L . @Article{Schelkens:1999:WBC, author = "Peter Schelkens and Adrian Munteanu and Jan Cornelis", title = "Wavelet-based compression of medical images: {Protocols} to improve resolution and quality scalability and region-of-interest coding", journal = j-FUT-GEN-COMP-SYS, volume = "15", number = "2", pages = "171--184", day = "11", month = mar, year = "1999", CODEN = *IY3)[=3[57Ey;WI[[A?articledatacompression.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.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.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.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.", }I PP kW @Article{Dunlavey:1981:LES, author = "Michael R. Dunlavey", title = "Letter to the {Editor}: On Spelling Correction and Beyond", journal = j-CACM, volume = "24", number = "9", pages = "608--608", month = sep, year = "1981", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/358746.383429", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782"ys @Article{Dunham:1980:AAS, author = "James G. Dunham", title = "Abstract Alphabet Sliding-Block Entropy Compression Coding with a Fidelity Criterion", journal = j-ANN-PROBAB, volume = "8", number = "6", pages = "1085--1092", month = dec, year = "1980", CODEN = "APBYAE", DOI = "https://doi.org/10.1214/aop/1176994570", ISSN = "0091-1798", ISSN-L = "0091-1798", bibdate = "Sun Apr 20 10:44:17 MDT 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/annprobab1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "htt={ @Article{Disque:1988:SCT, author = "Tom Disque", title = "Simple Compression Technique Works With Text and Graphics", journal = j-CUJ, volume = "6", number = "8", pages = "23--??", month = aug, year = "1988", ISSN = "0898-9788", bibdate = "Fri Aug 30 16:52:23 MDT 1996", bibsource = "http://www.cuj.com/cbklist.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "C Users Journal", }R% @Article{Dickman:1992:PCS, author = "Chris Dickman", title = "The {President} and {CEO} of {Storm Technology} discusses file compression issues", journal = j-ELECT-COMPOSITION-IMAGING, volume = "6", number = "??", pages = "52--??", month = mar, year = "1992", ISSN = "0838-9535", bibdate = "Mon May 20 11:04:41 MDT 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "Electronic Composition and Imaging", }F @Article{Donoho:1998:DCH, author = "David L. Donoho and Martin Vetterli and R. A. DeVore and Ingrid Daubechies", title = "Data compression and harmonic analysis", journal = j-IEEE-TRANS-INF-THEORY, volume = "44", number = "6", pages = "2435--2476", month = oct, year = "1998", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/18.720544", ISSN = "0018-9448 (print), 1557 @Article{Do:2014:FRL, author = "Huy Hoang Do and Jesper Jansson and Kunihiko Sadakane and Wing-Kin Sung", title = "Fast relative {Lempel--Ziv} self-index for similar sequences", journal = j-THEOR-COMP-SCI, volume = "532", number = "??", pages = "14--30", day = "1", month = may, year = "2014", CODEN = "TCSCDI", DOI = "https://doi.org/10.1016/j.tcs.20tP{ @Article{Disque:1988:SCT, author = "Tom Disque", title = X1 @Article{Dion:1993:CPC, author = "Pierre J. Dion", title = "Cross-Platform Compression", journal = j-DDJ, volume = "18", number = "12", pages = "32, 34, 36--37", month = dec, year = "1993", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 03 09:15:45 1996", bibsource = "http://www.ddj.com/index/author/index.htm; http://www.math.utah.edu/pub/tex/bib/datacompr9 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", } ^M[3+SoW57E ;o?EWc!#oWoarticledatacompression.bibJordan:1974:CORB. W. Jordan, Jr. and R. C. BarrettA Cell Organized Raster Display for Line Drawingsj-CACM17270--77feb21974CACMA2https://doi.org/10.1145/360827.3608360001-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 equipment; computer graphics; computer peripheral equipment; di\]L\ 3'!sW57E;U?uEc!AU!sarticledatacompression.bibHahn:1974:NTCBruce HahnA New Technique for Compression and Storage of Dataj-CACM178434--436aug81974CACMA2https://doi.org/10.1145/361082.3610860001-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.Z$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.maW: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", }Luni-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.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", DOI = "https://doi.org/10.1145/361082.361086", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:47:50 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Hahn74; 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", } = "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", }Mscrete; 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", DOI = "https://doi.org/10.1145/360827.360836", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#JordanB74; 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", } l glxPX 3);]57E};[7 articledatacompression.bibElias:1975:UCSP. EliasUniversal Codeword Sets and Representations of the Integersj-IEEE-TRANS-INF-THEORYIT-212194--203mar31975IETTAWhttps://doi.org/10.1109/tit.1975.10553490018-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", DOI = "https://doi.org/10.1109/tit.1975.1055349", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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", }"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.", }Pnt), 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.", }Q 16RY'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.", }LQX3/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--230mar31975IETTAWhttps://doi.org/10.1109/tit.1975.10553570018-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", DOI = "https://doi.org/10.1109/tit.1975.1055357", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", } ~: .] @PhdThesis{Gooda:2003:ATD, author = "Abdel-Hamid Mohamed Gooda", title = "Application of the techniques of data compression and nearest neighbor classification to information retrieval", type = "{D.Sc.} thesis", school = "The George Washington University", address = "Washington, DC, USA", pages = "????", year = "2003", 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/305328703", acknowledgement = ack-nhfb, classification = "0984: Computer science", dissertation-thesis-number = "0388180", subject = "Computer science", }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", address = "New York, NY, USA", pages = "126", 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/304209689", acknowledgement = ack-nhfb, advisor = "Seung P. Kim", classification = "0463: Statistics; 0544: Electrical engineering; 0984: Computer science", dissertation-thesis-number = "9529903", subject = "Electrical engineering; Computer science; Statistics", }o&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", } vT\3'?YS57E;[k=A'G?YYarticledatacompression.bibLing:1975:BOIH. Ling and F. P. PalermoBlock-Oriented Information Compressionj-IBM-JRD192141--145mar31975IBMJAEhttps://doi.org/10.1147/rd.192.01410018-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.maftSV 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", }: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", }Tth.utah.edu/pub/tex/bib/ibmjrd.bib1997.03.25 14:26:59 MSTA new scheme is presented for information compression that does not use information statistics. Each information block is represented by two 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", DOI = "https://doi.org/10.1147/rd.192.0141", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Tue Mar 25 14:26:59 MST 1997", bibsource = "Compendex database; 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", } 5Fk|pa @Article{Wang:2017:MIL, author = "Jianguo Wang and Chunbin Lin and Ruining He and Moojin Chae and Yannis Papakonstantinou and Steven Swanson", title = "{MILC}: inverted list compression in memory", journal = j-PROC-VLDB-ENDOWMENT, volume = "10", number = "8", pages = "853--864", month = apr, year = "2017", CODEN = "????", DOI = "https://doi.org/10.14778/3090163.3090164", ISS= @Article{Wang:2016:DBS, author = "Changda Wang and Syed Rafiul Hussain and Elisa Bertino", title = "Dictionary Based Secure Provenance Compression for Wireless Sensor Networks", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "27", number = "2", pages = "405--418", month = feb, year = "2016", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2015.2402156", 9Y3 @Article{Wang:2015:CSP, author = "Chao Wang and Xi Li and Peng Chen and Xuehai Zhou", title = "A case study of parallel {JPEG} encoding on an {FPGA}", journal = j-J-PAR-DIST-COMP, volume = "78", number = "??", pages = "1--5", month = apr, year = "2015", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2014.09.010", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Sat Mar 21 09:26:08 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731514001737", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } l @Article{Wang:2012:NFS, author = "Hui Wang and Anthony T. S. Ho and Xi Zhao", title = "A Novel Fast Self-restoration Semi-fragile Watermarking Algorithm for Image Content Authentication Resistant to {JPEG} Compression", journal = j-LECT-NOTES-COMP-SCI, volume = "7128", pages = "72--85", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-32205-1_8", ISSZ5 @Article{Wang:2012:GSD, author = "Cong Wang and Hongzhi Wang", title = "Graph-Structured Data Compression Based on Frequent Subgraph Contraction", journal = j-LECT-NOTES-COMP-SCI, volume = "7419", pages = "11--18", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-33050-6_2", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:22:10 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/lncs2012g.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-33050-6_2/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-33050-6", book-URL = "http://www.springerlink.com/content/978-3-642-33050-6", fjournal = "Lecture Notes in Computer Science", } :u @Article{Wang:2011:SRB, author = "Jin Wang and Yunhui Shi and Dehui Kong and Wenpeng Ding and Chunjing Li and Baocai Yin", title = "Sparse representation based down-sampling image compression", journal = j-J-COMPUT-APPL-MATH, volume = "236", number = "5", pages = "675--683", day = "1", month = oct, year = "2011", CODEN = "JCAMDI", DOI = "https://doi lY @Article{Dahmen:1993:WAM, author = "W. Dahmen and S. Pr{\"o}ssdorf and R. Schneider", title = "Wavelet approximation methods for pseudodifferential equations. {II}. {Matrix} compression and fast solution", journal = j-ADV-COMPUT-MATH, volume = "1", number = "3", pages = "259--335", month = oct, year = "1993", CODEN = "ACMHEX", DOI = "https://doi.org/10.1007/BF{w @Article{Curewitz:1993:PPD, author = "Kenneth M. Curewitz and P. Krishnan and Jeffrey Scott Vitter", title = "Practical prefetching via data compression", journal = j-SIGMOD, volume = "22", number = "2", pages = "257--266", month = jun, year = "1993", CODEN = "SRECD8", DOI = "https://doi.org/10.1145/170036.170077", ISBN = "0-89791-592-5", ISBN-13 = "978-0-8979 Æ @Article{Davidson:2005:FDC, author = "Michael Davidson and Lucian Ilie", title = "Fast Data Compression with Antidictionaries", journal = j-FUND-INFO, volume = "64", number = "1--4", pages = "119--134", month = jul, year = "2005", CODEN = "FUMAAJ", ISSN = "0169-2968 (print), 1875-8681 (electronic)", ISSN-L = "0169-2968", bibdate = "Sat Mar 5 17:02:46 MST 2016", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib", acknowledgement = ack-nhfb, fjournal = "Fundamenta Informaticae", journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae", }9s @Article{DeAgostino:1996:LVL, author = "Sergio {De Agostino} and James A. Storer", title = "On-line versus off-line computation in dynamic text compression", journal = j-INFO-PROC-LETT, volume = "59", number = "3", pages = "169--174", day = "12", month = aug, year = "1996", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(96)00068-3", ISSN = "002}{ @Article{Davis:1996:IIM, author = "Geoffrey Davis", title = "Implicit image models in image fractal compression", journal = j-PROC-SPIE, volume = "2569", number = "??", pages = "88--97", month = "????", year = "1996", CODEN = "PSISDG", ISBN = "0-8194-2213-4", ISBN-13 = "978-0-8194-2213-2", ISSN = "????", ISSN-L = "0277-786X", LCCN = "TS510.S63 v.2825", bibdate = "Sat Sep 8 13:53:06 2012", bibsource = "http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", fjournal = "Proceedings of the SPIE --- The International Society for Optical Engineering", }N @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", DOI = "https://doi.org/10.1109/5.892711", ISSN = "0018-9219 (print), 1558-2256 (electronic)", ISSN- vVY 31+_3[57Ey;=I+Acarticledatacompression.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.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.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", } 3YY3-Os-e57Ek;I?wGOs7articledatacompression.bibBentley:1976:AOAJ. L. Bentley and A. Chi-Chih YaoAn Almost Optimal Algorithm for Unbounded Searchingj-INFO-PROC-LETT5382--87aug81976IFPLAThttps://doi.org/10.1016/0020-0190(76)90071-50020-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", DOI = "https://doi.org/10.1016/0020-0190(76)90071-5", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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", } 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", }Y . 3D."qc @Article{Fredriksson:2004:ESM, author = "Kimmo Fredriksson and Jorma Tarhio", title = "Efficient String Matching in {Huffman} Compressed Texts", journal = j-FUND-INFO, volume = "63", number = "1", pages = "1--16", month = jan, year = "2004", CODEN = "FUMAAJ", ISSN = "0169-2968 (print), 1875-8681 (electronic)", ISSN-L = "0169-2968", bibdate = "Sat Mar 5 17:02:27 MST 2016", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib; http://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Fundamenta Informaticae", journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae", }e @Article{Frank:1980:PIT, author = "Amalie J. Frank and J. D. Daniels and Diane R. Unangst", title = "Progressive Image Transmission Using a Growth-Geometry Coding", journal = j-PROC-IEEE, volume = "68", number = "7", pages = "897--909", month = jul, year =<y @Article{Fredriksson:2009:SRA, author = "Kimmo Fredriksson and Fedor Nikitin", title = "Simple Random Access Compression", journal = j-FUND-INFO, volume = "92", number = "1--2", pages = "63--81", month = jan, year = "2009", CODEN = "FUMAAJ", DOI = "https://doi.org/10.3233/FI-2009-0066", ISSN = "0169-2968 (print), 1875-8681 (electronic)", ISSN-L = "0169-2968", bibdate = "Sat Mar 5 17:08:27 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", }ilY @Article{Fraser:2006:IDI, author = "Christopher W. Fraser", title = "An instruction for direct interpretation of {LZ77}-compressed programs", journal = j-SPE, volume = "36", number = "4", pages = "397--411", month = "????", year = "2006", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.702", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0[,[ @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:349s @Article{Fu:2016:FPP, author = "Yongquan Fu and Ernst Biersack", title = "False-Positive Probability and Compression Optimization for Tree-Structured {Bloom} Filters", journal = j-TOMPECS, volume = "1", number = "4", pages = "19:1--19:39", month = sep, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2940324", ISSN = "2376-3639 (print), 2376-3647 (electr0c @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# 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.msSZY 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", } ^V3+5W;]57E};[5W3articledatacompression.bibLempel:1976:CFSA. Lempel and J. ZivOn the Complexity of Finite Sequencesj-IEEE-TRANS-INF-THEORY22175--811976IETTAWhttps://doi.org/10.1109/tit.1976.10555010018-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", DOI = "https://doi.org/10.1109/tit.1976.1055501", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", } 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.", }_ $$Y_Z 313wW57E;qe33wiarticledatacompression.bibMcCreight:1976:SESEdward M. McCreightA Space-Economical Suffix Tree Construction Algorithmj-J-ACM232262--272apr41976JACOAHhttps://doi.org/10.1145/321941.3219460004-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", DOI = "https://doi.org/10.1145/321941.321946", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib; 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.", }: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", }` BaX 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", }_`W 3+-ye77CC;Y'wG1yarticledatacompression.bibMorrin:1976:CLCT. H. Morrin, IIChain-Link Compression of Arbitrary Black-White Imagesj-CGIP52172--189jun61976CGIPBGhttps://doi.org/10.1016/0146-664x(76)90026-50146-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", DOI = "https://doi.org/10.1016/0146-664x(76)90026-5", ISSN = "0146-664X", ISSN-L = "0146-664X", bibdate = "Fri Feb 7 08:07:49 MST 1997", bibsource = "Compendex database; Graphics/imager/imager.76.bib; 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 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", }, 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", }c XdW 3/))Y7E};_)articledatacompression.bibRoetling:1976:HMEP. G. RoetlingHalftone Method with Edge Enhancement and Moire Suppressionj-J-OPT-SOC-AM66985--9891976JOSAAHhttps://doi.org/10.1364/josa.66.0009850030-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", DOI = "https://doi.org/10.1364/josa.66.000985", 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.", }cY 3/)qS57!E+;[mM%G)u5articledatacompression.bibRissanen:1976:GKIJ. J. RissanenGeneralized Kraft Inequality and Arithmetic Codingj-IBM-JRD203198--203may51976IBMJAEhttps://doi.org/10.1147/rd.203.01980018-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", DOI = "https://doi.org/10.1147/rd.203.0198", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", MRclass = "94A10", MRnumber = "54 \#12359", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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", }", 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", }e 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", DOI = "https://doi.org/10.1145/360363.360368", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:17:30 MST 2001", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/cacm/cacm19.html#Rubin76; 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", } Z ZlgV 3)'c!!CQ%E_;g'cbookdatacompression.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.", }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", }ZeZ 3)#UW57E ;W?{MAc!C[#Ucarticledatacompression.bibRubin:1976:ETFFrank RubinExperiments in Text File Compressionj-CACM1911617--623nov111976CACMA2https://doi.org/10.1145/360363.3603680001-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/bib/datacompression.bib2001.01.22 07:17:30 MSTA system for~ aG \ G/_ @InProceedings{X1 @InProceedings{Wu:2000:OPE, author = "Xiaolin Wu and Zixiang Xiong", title = "Optimal packetization of embedded bitstreams", crossref = "Storer:2000:DPD", pages = "??--??", year = "2000", DOI = "https://doi.org/10.1109/DCC.2000.838227", bibdate = "Tue Feb 5 14:06:51 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838227", acknowledgement = ack-nhfb, }Gy @InProceedings{Xue:1997:ACI, author = "Xiaohui Xue and W7 @InProceedings{Wu:2003:CHD, author = "Xintao Wu and D. Barbara", title = "Compressing high dimensional datasets by fractals", crossref = "Storer:2003:DPD", pages = "??--??", year = "2003", DOI = "https://doi.org/10.1109/DCC.2003.1194071", bibdate = "Tue Feb 5 14:07:20 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194071", acknowledgement = ack-nhfb, }V; @InProceedings{Wu:2002:OMR, author = "Xiaolin Wu and S. Dumitrescu", title = "On optimal multi-resolution scalar quantization", crossref = "Storer:2002:DPD", pages = "322--331", year = "2002", DOI = "https://doi.org/10.1109/DCC.2002.999970", bibdate = "Tue Feb 5 14:07:05 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999970", acknowledgement = ack-nhfb, }Ƅ2e @InProceedings{Wu:1999:LCH, author = "X. Wu", title = "Low complexity high-order context modeling of embedded wavelet bit streams", crossref = "Storer:1999:DPD", pages = "112--120", year = "1999", DOI = "https://doi.org/10.1109/DCC.1999.755660", bibdate = "Tue Feb 5 08:44:09 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755660", acknowledgement = ack-nhfb, }\B @InProceedings{Wu:1999:CQF, author = "X. Wu", title = "Context quantization with {Fisher} discriminant for adaptive embedded wavelet image coding", crossref = "Storer:1999:DPD", pages = "102--111", year = "1999", DOI = "https://doi.org/10.1109/DCC.1999.755659", bibdate = "Tue Feb 5 08:44:09 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755659", acknowledgement = ack-nhfb, }[@ @InProceedings{Wu:1998:LII, author = "X. Wu and Wai-Kin Choi and N. Memon", title = "Lossless interframe image compression via context modeling", crossref = "Storer:1998:PDD", pages = "378--387", year = "1998", DOI = "https://doi.org/10.1109/DCC.1998.672169", bibdate = "Tue Feb 5 08:38:49 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672169", acknowledgement = ack-nhfb, }`A @InProceedings{Wu:1997:CHF, author = "Xiaolin Wu and Wai Kin Choi and P. Bao", title = "{$ L_\infty $}-constrained high-fidelity image compression via adaptive context modeling", crossref = "Storer:1997:DDC", pages = "91--100", year = "1997", DOI = "https://doi.org/10.1109/DCC.1997.581978", bibdate = "Tue Feb 5 08:32:18 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581978", acknowledgement = ack-nhfb, }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.", } ss i[ 3-1IS57'!E+;[C+G1I articledatacompression.bibChaitin:1977:AITGregory J. ChaitinAlgorithmic Information Theoryj-IBM-JRD214350--359jul71977IBMJAEhttps://doi.org/10.1147/rd.214.03500018-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", DOI = "https://doi.org/10.1147/rd.214.0350", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", MRclass = "94A15 (68A20)", MRnumber = "56 \#15151", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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", }_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 noiseler = "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", }i $$\kX3'{ /!_57E};S{ Carticledatacompression.bibChen:1977:FCAWen-Hsiung Chen and C. Harrison Smith and S. C. FralickA Fast Computational Algorithm For the Discrete Cosine Transformj-IEEE-TRANS-COMM2591004--1009sep91977IECMBThttps://doi.org/10.1109/tcom.1977.10939410090-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", DOI = "https://doi.org/10.1109/tcom.1977.1093941", ISSN = "0090-6778 (print), 1558-0857 (electronic)", ISSN-L = "0090-6778", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", }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", }"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.", }k I ? zI 3? @Article{Pournelle:1993:QOC, authsg @Article{Przelaskowski:1998:DPW, author = "Artur Przelaskowski", title = "Detail Preserving Wavelet-based Compression with Adaptive Context-based Quantisation", journal = j-FUND-INFO, volume = "34", number = "4", pages = "369--388", month = jul, year = "1998", CODEN = "FUMAAJ", DOI = "https://doi.org/10.3233/FI-1998-34402", 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", }iS @Article{Prenter:1986:TAD, author = "P. M. Prenter and E. R. Westwater", title = "Three Adaptive Discrete Least Squares Cubic Spline Procedures for the Compression of Data", journal = j-CVGIP, volume = "33", number = "3", pages = "327--345", month = mar, year = "1986", CODEN = "CVGPDB", DOI = "https://doi.org/10.1016/0734-189x(86)90181-7", ISSN = "0734-189X", ISSN-0K @Article{Prasad:2006:PID, author = "M. V. N. K. Prasad and K. K. Shukla", title = "Parallel Implementation of Domain Decomposition Based Image Compression Algorithm", journal = j-INT-J-COMPUT-APPL, volume = "28", number = "4", pages = "334--341", year = "2006", DOI = "https://doi.org/10.1080/1206212X.2006.11441819", ISSN = "1206-212X (print), 1925-7074 (electronic)", ISSN-L = "1206-212X", bibdate = "Sat Apr 21 17:23:29 MDT 2018", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ijca.bib", URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2006.11441819", acknowledgement = ack-nhfb, fjournal = "International Journal of Computer Applications", journal-URL = "https://www.tandfonline.com/loi/tjca20", online-date = "11 Jul 2015", } C @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-LECT-NOTES-COMP-SCI, volume = "2275", pages = "375--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat Feb 2 13:07:51 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2275.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2275/22750375.htm; http://link.springer-ny.com/link/service/series/0558/papers/2275/22750375.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", }4? @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", } ;lX 3/- ;]57E};[- articledatacompression.bibLawrence:1977:NUCJohn C. LawrenceA New Universal Coding Scheme for the Binary Memoryless Sourcej-IEEE-TRANS-INF-THEORY234466--472jul71977IETTAWhttps://doi.org/10.1109/tit.1977.10557490018-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", DOI = "https://doi.org/10.1109/tit.1977.1055749", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", }5)", MRnumber = "0471493 (57 \#11224)", MRreviewer = "Leon Glass", bibdate = "Wed Sep 5 09:26:37 2012", bibsource = "http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Translated from the French", ZMnumber = "Zbl 0376.28020", acknowledgement = ack-nhfb, tableofcontents = "I. Introduction \\ II. How long is the coast of Britain? \\ III. Uses of nonconstrained chance \\ IV. Fractal events and noises \\ V. Fractal clusters of stellar matter \\ VI. Turbulence, intermittency and curdling \\ VII. Meteorites, moon craters and soap \\ VIII. Uses of self constrained chance \\ IX. Fractional Brownian facets of rivers, relief and turbulence \\ X. Miscellany \\ XI. Biographical and historical sketches \\ XII. Mathematical lexicon and addenda", }m ''lnU 3/)i/77E};U)i/articledatacompression.bibRoetling:1977:BACP. G. RoetlingBinary Approximation of Continuous Tone Imagesj-PHOTOGR-SCI-ENG2160--651977PSENAC0031-8760 OR 003187600031-8760 OR 00318760Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTPhotographic Science and Engineeringack-dsP. G. RoetlingBinary Approximation of Continuous Tone Images @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", }gmY 335W+3)E1'5!;;Ao)?AW]}bookdatacompression.bibMandelbrot:1977:FFCBenoit B. MandelbrotFractals: form, chance, and dimensionpub-W-H-FREEMANpub-W-H-FREEMAN:adrRevisedxvi + 36519770-7167-0473-0, 0-7167-0474-9 (paperback) OR 0716704730, 0716704749 (paperback)978-0-7167-0473-7, 978-0-7167-0474-4 (paperback) OR 9780716704737, 9780716704744 (paperback)QA447 .M3613 1977a69.00 (92A05)0471493 (57 \#11224)Leon GlassWed Sep 5 09:26:37 2012http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2012.09.05 09:26:37 ???Translated from the FrenchI. Introduction II. How long is the coast of Britain? III. Uses of nonconstrained chance IV. Fractal events and noises V. Fractal clusters of stellar matter VI. Turbulence, intermittency and curdling VII. Meteorites, moon craters and soap VIII. Uses of self constrained chance IX. Fractional Brownian facets of rivers, relief and turbulence X. Miscellany XI. Biographical and historical sketches XII. Mathematical lexicon and addendaZbl 0376.28020ack-nhfbBeno{\^\i}t B. MandelbrotTranslated from the FrenchFractals: form, chance, and dimension @Book{Mandelbrot:1977:FFC, author = "Beno{\^\i}t B. Mandelbrot", title = "Fractals: form, chance, and dimension", publisher = pub-W-H-FREEMAN, address = pub-W-H-FREEMAN:adr, edition = "Revised", pages = "xvi + 365", year = "1977", ISBN = "0-7167-0473-0, 0-7167-0474-9 (paperback)", ISBN-13 = "978-0-7167-0473-7, 978-0-7167-0474-4 (paperback)", LCCN = "QA447 .M3613 1977a", MRclass = "69.00 (92A05)", MRnumber = "0471493 (57 \#11224)", MRreviewer = "Leon Glass", bibdate = "Wed Sep 5 09:26:37 2012", bibsource = "http://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Translated from the French", ZMnumber = "Zbl 0376.28020", acknowledgement = ack-nhfb, tableofcontents = "I. Introduction \\ II. How long is the coast of Britain? \\ III. Uses of nonconstrained chance \\ IV. Fractal events and noises \\ V. Fractal clusters of stellar matter \\ VI. Turbulence, intermittency and curdling \\ VII. Meteorites, moon craters and soap \\ VIII. Uses of self constrained chance \\ IX. Fractional Brownian facets of rivers, relief and turbulence \\ X. Miscellany \\ XI. Biographical and historical sketches \\ XII. Mathematical lexicon and addenda", } "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "School of Information and Computer Sci., Georgia Inst. of Technol., Atlanta, GA, USA", fjournal = "International Journal of Computer and Information Sciences", keywords = "data compression; decoding; encoding; homogeneous text; numerical coding method; storage; storage allocation; storage space; text compaction; text editing; text information", treatment = "G General Review", }o i$pW3%;w;]57Ek;[;warticledatacompression.bibZiv:1977:UASJacob Ziv and A. LempelA Universal Algorithm for Sequential Data Compressionj-IEEE-TRANS-INF-THEORYIT-233337--343may51977IETTAWhttps://doi.org/10.1109/TIT.1977.10557140018-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/computer1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsJacob Ziv and A. LempelA Universal Algorithm for Sequential Data Compression @Article{Ziv:1977:UAS, author = "Jacob Ziv and A. Lempel", title = "A Universal Algorithm for Sequential Data Compression", journal = j-IEEE-TRANS-INF-THEORY, volume = "IT-23", number = "3", pages = "337--343", month = may, year = "1977", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/TIT.1977.1055714", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "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 = "IEEE Transactions on Information Theory", rawdata-1 = "Ziv, Jacob, and A. Lempel (1977) ``A Universal Algorithm for Sequential Data Compression,'' {\it IEEE Transactions on Information Theory}, {\bf IT-23}(3):337--343.", rawdata-2 = "Ziv, J., and A. Lempel (1977) ``A Universal Algorithm for Sequential Data Compression,'' {\it IEEE Transactions on Information Theory}, IT-23(3):337--343.", }oX 3'!}9Q7E};e5-!}iarticledatacompression.bibTing:1977:CHTT. C. TingCompacting homogeneous text for minimizing storage spacej-INT-J-COMPUT-INF-SCI63211--221sep91977IJCIAHhttps://doi.org/10.1007/bf010023320091-7036 OR 00917036Sat Apr 26 12:20:22 MDT 1997http://www.math.utah.edu/pub/tex/bib/datacompression.bib1997.04.26 12:20:22 MDTInternational Journal of Computer and Information Sciencesdata compression; decoding; encoding; homogeneous text; numerical coding method; storage; storage allocation; storage space; text compaction; text editing; text informationack-nhfbSchool of Information and Computer Sci., Georgia Inst. of Technol., Atlanta, GA, USAG General ReviewT. C. TingCompacting homogeneous text for minimizing storage space @Article{Ting:1977:CHT, author = "T. C. Ting", title = "Compacting homogeneous text for minimizing storage space", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "3", pages = "211--221", month = sep, year = "1977", CODEN = "IJCIAH", DOI = "https://doi.org/10.1007/bf01002332", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "School of Information and Computer Sci., Georgia Inst. of Technol., Atlanta, GA, USA", fjournal = "International Journal of Computer and Information Sciences", keywords = "data compression; decoding; encoding; homogeneous text; numerical coding method; storage; storage allocation; storage space; text compaction; text editing; text information", treatment = "G General Review", } "0018-9448", 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 = "IEEE Transactions on Information Theory", rawdata-1 = "Ziv, Jacob, and A. Lempel (1977) ``A Universal Algorithm for Sequential Data Compression,'' {\it IEEE Transactions on Information Theory}, {\bf IT-23}(3):337--343.", rawdata-2 = "Ziv, J., and A. Lempel (1977) ``A Universal Algorithm for Sequential Data Compression,'' {\it IEEE Transactions on Information Theory}, IT-23(3):337--343.", }p [rX3'GgW57-Ea;? M[cGGgqarticledatacompression.bibEven:1978:EECShimon Even and Michael RodehEconomical Encoding of Commas Between Stringsj-CACM214315--317apr41978CACMA2https://doi.org/10.1145/359460.3594800001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 0001078268A1058 3648John CherniavskySat Jan 26 12:46:16 MST 2013http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#EvenR78; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTCommunications of the ACMcommas; data handling; delimiters; encoding; extra cost; stringsack-dsC6130 (Data handling techniques)Israel Inst. of Technol., Haifa, Israelhttp://portal.acm.org/browse_dl.cfm?idx=J79T Theoretical or MathematicalShimon Even and Michael RodehEconomical Encoding of Commas Between Strings @Article{Even:1978:EEC, author = "Shimon Even and Michael Rodeh", title = "Economical Encoding of Commas Between Strings", journal = j-CACM, volume = "21", number = "4", pages = "315--317", month = apr, year = "1978", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/359460.359480", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68A10", MRnumber = "58 3648", MRreviewer = "John Cherniavsky", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#EvenR78; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds # " and " # ack-nhfb, classcodes = "C6130 (Data handling techniques)", corpsource = "Israel Inst. of Technol., Haifa, Israel", fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", keywords = "commas; data handling; delimiters; encoding; extra cost; strings", oldlabel = "EvenR78", rawdata = "Even, S. and M. Rodeh (1978) ``Economical Encoding of Commas Between Strings,'' {\it Communications of the ACM}, {\bf21}(4):315--317, April.", treatment = "T Theoretical or Mathematical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/EvenR78", }qX 3G_a%3/C7;e9cephdthesisdatacompression.bibCapitantdeVillebonne:1978:DIDPatrice Jean-Marie Capitant de VillebonneDesign and Implementation of Distortion-Free Compression Techniques for LANDSAT Data and Television ImagesPh.D. thesisStanford UniversityStanford, CA, USA791978Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302940557Electrical engineeringack-nhfbPatrice Jean-Marie {Capitant de Villebonne}Design and Implementation of Distortion-Free Compression Techniques for {LANDSAT} Data and Television Images @PhdThesis{CapitantdeVillebonne:1978:DID, author = "Patrice Jean-Marie {Capitant de Villebonne}", title = "Design and Implementation of Distortion-Free Compression Techniques for {LANDSAT} Data and Television Images", type = "{Ph.D.} thesis", school = "Stanford University", address = "Stanford, CA, USA", pages = "79", year = "1978", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302940557", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "7822484", subject = "Electrical engineering", }10", MRnumber = "58 3648", MRreviewer = "John Cherniavsky", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#EvenR78; http://www.math.utah.edu/pub/tex/bib/cacm1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds # " and " # ack-nhfb, classcodes = "C6130 (Data handling techniques)", corpsource = "Israel Inst. of Technol., Haifa, Israel", fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", keywords = "commas; data handling; delimiters; encoding; extra cost; strings", oldlabel = "EvenR78", rawdata = "Even, S. and M. Rodeh (1978) ``Economical Encoding of Commas Between Strings,'' {\it Communications of the ACM}, {\bf21}(4):315--317, April.", treatment = "T Theoretical or Mathematical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/EvenR78", }r "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 = "Gallager, Robert G. (1978) ``Variations On a Theme By Huffman,'' {\it IEEE Transactions on Information Theory}, {\bf IT-24}(6):668--674, November.", rawdata-2 = "Gallager, Robert G. (1978) ``Variations on a Theme by Huffman,'' {\it IEEE Transactions on Information Theory}, {\bf24}(6):668--674, November.", }s $ ~$WtX 3+9'%K-C7;e99'phdthesisdatacompression.bibHooker:1978:OSQLawrence Eugene HookerOptimum Sampling and Quantizing for Multiple Channel Data Compression SystemsPh.D. thesisNorth Carolina State UniversityRaleigh, NC, USA3061978Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302897622Electrical engineeringack-nhfbLawrence Eugene HookerOptimum Sampling and Quantizing for Multiple Channel Data Compression Systems @PhdThesis{Hooker:1978:OSQ, author = "Lawrence Eugene Hooker", title = "Optimum Sampling and Quantizing for Multiple Channel Data Compression Systems", type = "{Ph.D.} thesis", school = "North Carolina State University", address = "Raleigh, NC, USA", pages = "306", year = "1978", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302897622", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "7905490", subject = "Electrical engineering", }sV 3/1M;]57E};[1Qarticledatacompression.bibGallager:1978:VTHRobert G. GallagerVariations On a Theme By Huffmanj-IEEE-TRANS-INF-THEORYIT-246668--674nov111978IETTAWhttps://doi.org/10.1109/tit.1978.10559590018-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. GallagerVariations On a Theme By {Huffman} @Article{Gallager:1978:VTH, author = "Robert G. Gallager", title = "Variations On a Theme By {Huffman}", journal = j-IEEE-TRANS-INF-THEORY, volume = "IT-24", number = "6", pages = "668--674", month = nov, year = "1978", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/tit.1978.1055959", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, fjournal = "IEEE Transactions on Information Theory", rawdata-1 = "Gallager, Robert G. (1978) ``Variations On a Theme By Huffman,'' {\it IEEE Transactions on Information Theory}, {\bf IT-24}(6):668--674, November.", rawdata-2 = "Gallager, Robert G. (1978) ``Variations on a Theme by Huffman,'' {\it IEEE Transactions on Information Theory}, {\bf24}(6):668--674, November.", }", MRclass = "94B25", MRnumber = "80f:94026", MRreviewer = "Ram Autar", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bit vector compression; codes, symbolic; compression gain; data compression; encoding; Huffman coding; information theory --- Data Compression", treatment = "T Theoretical or Mathematical", }u )vZ 3%{Y57CS;5-}Og{carticledatacompression.bibLea:1978:TCAR. M. LeaText Compression with an Associative Parallel Processorj-COMP-J21145--56feb21978CMPJA6https://doi.org/10.1093/comjnl/21.1.450010-4620 (print), 1460-2067 (electronic) OR 00104620 (print), 14602067 (electronic)0010-4620 OR 00104620Tue Dec 4 14:48:02 MST 2012Compendex database; http://comjnl.oxfordjournals.org/content/21/1.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/2012.12.04 14:48:02 MSThttp://comjnl.oxfordjournals.org/content/21/1/45.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/45.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/46.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/47.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/48.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/49.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_?uX 31%]-e57E;I)yw-G%aarticledatacompression.bibJakobsson:1978:HCBM. JakobssonHuffman coding in bit-vector compressionj-INFO-PROC-LETT76304--307oct101978IFPLAThttps://doi.org/10.1016/0020-0190(78)90023-60020-0190 (print), 1872-6119 (electronic) OR 00200190 (print), 18726119 (electronic)0020-0190 OR 0020019094B2580f:94026Ram AutarTue Nov 17 10:49:43 MST 1998Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib1998.11.17 10:49:43 MSTInformation Processing Lettersbit vector compression; codes, symbolic; compression gain; data compression; encoding; Huffman coding; information theory --- Data Compressionack-nhfbDept. of Computer Sci., Univ. of Turku, Turku, Finlandhttp://www.sciencedirect.com/science/journal/00200190Inf Process LettT Theoretical or MathematicalM. Jakobsson{Huffman} coding in bit-vector compression @Article{Jakobsson:1978:HCB, author = "M. Jakobsson", title = "{Huffman} coding in bit-vector compression", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "304--307", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(78)90023-6", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94B25", MRnumber = "80f:94026", MRreviewer = "Ram Autar", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bit vector compression; codes, symbolic; compression gain; data compression; encoding; Huffman coding; information theory --- Data Compression", treatment = "T Theoretical or Mathematical", } "Tue Dec 4 14:48:02 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/21/1.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/", URL = "http://comjnl.oxfordjournals.org/content/21/1/45.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/45.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/46.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/47.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/48.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/49.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/50.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/51.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/52.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/53.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/54.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/55.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/56.tif", acknowledgement = ack-nhfb, classcodes = "C0310 (EDP management); C6130 (Data handling techniques)", classification = "723; 901", corpsource = "Dept. of Electrical Engng. and Electronics, Brunel Univ., Uxbridge, UK", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "associative parallel processor; byte; compression; computer selection and evaluation; data compression; data processing; fixed record length system; hardware; information retrieval systems; microprocessor system; organised variable record length; parallel processing; text editing; textual information; textual information decompression", treatment = "T Theoretical or Mathematical; X Experimental", }v21/Issue_01/tiff/50.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/51.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/52.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/53.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/54.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/55.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/56.tifThe Computer Journalassociative parallel processor; byte; compression; computer selection and evaluation; data compression; data processing; fixed record length system; hardware; information retrieval systems; microprocessor system; organised variable record length; parallel processing; text editing; textual information; textual information decompressionack-nhfbC0310 (EDP management); C6130 (Data handling techniques)Dept. of Electrical Engng. and Electronics, Brunel Univ., Uxbridge, UKhttp://comjnl.oxfordjournals.org/T Theoretical or Mathematical; X ExperimentalR. M. LeaText Compression with an Associative Parallel Processor @Article{Lea:1978:TCA, author = "R. M. Lea", title = "Text Compression with an Associative Parallel Processor", journal = j-COMP-J, volume = "21", number = "1", pages = "45--56", month = feb, year = "1978", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/21.1.45", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:02 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/21/1.toc; http://www.math.utah.edu/pub/tex/bib/compj.bib; http://www.math.utah.edu/pub/tex/bib/compj1970.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/", URL = "http://comjnl.oxfordjournals.org/content/21/1/45.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/45.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/46.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/47.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/48.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/49.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/50.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/51.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/52.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/53.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/54.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/55.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/56.tif", acknowledgement = ack-nhfb, classcodes = "C0310 (EDP management); C6130 (Data handling techniques)", classification = "723; 901", corpsource = "Dept. of Electrical Engng. and Electronics, Brunel Univ., Uxbridge, UK", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "associative parallel processor; byte; compression; computer selection and evaluation; data compression; data processing; fixed record length system; hardware; information retrieval systems; microprocessor system; organised variable record length; parallel processing; text editing; textual information; textual information decompression", treatment = "T Theoretical or Mathematical; X Experimental", } + @PhdThesis{Haghighat:2007:DCU, author = "Javad Haghighat", title = "Data compression using error correcting codes", type = "{Ph.D.} thesis", school = "Department of Electrical and Computer Engineering, Concordia University", address = "Montr{\'e}al, QC, Canada", pages = "xiii + 86", month = mar, year = "2007", ISBN = "0-494-30135-X", ISBN-13 = "978-0-494-30135-7", 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", note = "2 microfiches.", series = "Canadian theses = Th{\`e}ses canadiennes.", URL = "http://www.collectionscanada.gc.ca/obj/thesescanada/vol2/002/NR30135.PDF", acknowledgement = ack-nhfb, pagecount = "100", } O @PhdThesis{Hooker:1978:OSQ, author = "Lawrence Eugene Hooker", title = "Optimum Sampling and Quantizing for Multiple Channel Data Compression Systems", type = "{Ph.D.} thesis", school = "North Carolina State Universi% @PhdThesis{Haley:2011:PCC, author = "Brent Kreh Haley", title = "A Pipeline for the Creation, Compression, and Display of Streamable {$3$D} Motion Capture Based Skeletal Animation Data", type = "{Ph.D.} thesis", school = "The Ohio State University", address = "Columbus, OH, USA", pages = "158", year = "2011", ISBN = "1-124-57872-2", ISBN-13 = "978-1-124-57872-9", LCCN mZ7 @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", }Sxq @PhdThesis{Hatton:1995:ODC, author = "Edward Douglas Hatton", title = "Optimized data compression in the absence of a priori probabilities", type = "{Ph.D.} thesis", school = "University of Waterloo", address = "Waterloo, ON, Canada", pages = "141", year = "1995", ISBN = "0-315-99808-3", ISBN-13 = "978-0-315-99808-7", 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/304299385", acknowledgement = ack-nhfb, advisor = "George H. Freeman", classification = "0544: Electrical engineering", dissertation-thesis-number = "NN99808", subject = "Electrical engineering", }uxq @PhdThesis{Hamidi:1994:WTI, author = "Seyed Mostafa Hamidi", title = "Wavelet transform for image data compression", type = "{Ph.D.} thesis", school = "The University of Alabama in Huntsville", address = "Huntsville, AL, USA", pages = "150", year = "1994", 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/304121118", acknowledgement = ack-nhfb, advisor = "Reza Adhami", classification = "0544: Electrical engineering", dissertation-thesis-number = "9519086", subject = "Electrical engineering", } , ,myV 3!%-%S-C7;e9%-Qphdthesisdatacompression.bibMa:1978:DCJoong Soo MaData CompressionPh.D. thesisUniversity of Massachusetts AmherstAmherst, MA, USA1481978Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302919063Electrical engineeringack-nhfbJoong Soo MaData Compression @PhdThesis{Ma:1978:DC, author = "Joong Soo Ma", title = "Data Compression", type = "{Ph.D.} thesis", school = "University of Massachusetts Amherst", address = "Amherst, MA, USA", pages = "148", year = "1978", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302919063", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "7903802", subject = "Electrical engineering", }yx[ 35+;qE;9I59+[uarticledatacompression.bibLouis-Gavet:1978:DAIGuy Louis-GavetDiverses applications issues d'une fonction $f$ de compactage basee sur une etude mathematique du langage naturel (compactage de donnees, comparaison de textes, hash-coding). [Various Applications Issued from a Compression Function $f$ Based on a Mathematical Study of the Natural Language (Data Compression, Comparison of Texts, Hash-Coding)]RAIRO Informatique/Computer Science (Revue Francaise d'Automatique, d'Informatique et de Recherche Operationnelle)12147--711978RSINDNSat Jan ]wV 3)%{%3/C7;e9%{+phdthesisdatacompression.bibLinde:1978:DTTYoseph LindeThe Design of Tree and Trellis Data Compression SystemsPh.D. thesisStanford UniversityStanford, CA, USA1421978Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302929849Electrical engineeringack-nhfbYoseph LindeThe Design of Tree and Trellis Data Compression Systems @PhdThesis{Linde:1978:DTT, author = "Yoseph Linde", title = "The Design of Tree and Trellis Data Compression Systems", type = "{Ph.D.} thesis", school = "Stanford University", address = "Stanford, CA, USA", pages = "142", year = "1978", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302929849", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "7808809", subject = "Electrical engineering", } (Data Compression, Comparison of Texts, Hash-Coding)]", journal = "RAIRO Informatique/Computer Science (Revue Fran{\c{c}}aise d'Automatique, d'Informatique et de Recherche Operationnelle)", volume = "12", number = "1", pages = "47--71", month = "????", year = "1978", CODEN = "RSINDN", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Various compression techniques are discussed, along with numerous applications. A method of compression is considered which is based on a mathematical study concerned with the repartition of characters in a set natural language. A high rate of compression without risk of redundancies is obtained. It is about 1/30 (sometimes much higher) when operating in an interrogational mode and about one quarter when we want to find again the original data. The applications described demonstrate the interest of this approach: compression of keywords of a thesaurus, of names-first names, of titles-authors of books; comparison of texts, and applications in Hash-coding.", acknowledgement = ack-nhfb, classification = "723", journalabr = "RAIRO Inf Comput Sci", keywords = "computer programming languages", language = "French", }x t 2tCc# @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", DOI = zu @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) ҇^= @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", DOI = "https://doi.org/10.1016/s0304-3975(02)00777-6", 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", }A @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 = M]= @Article{Rudner:1971:CMR, author = "B. Rudner", title = "Construction of Minimum-Redundancy Codes with an Optimum Synchronization Property", journal = j-IEEE-TRANS-INF-THEORY, volume = "17", number = "4", pages = "478--487", month = jul, year = "1971", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/tit.1971.1054657", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", }5cG @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 ^n T^n{Ga/ @Article{Knutsson:1998:OGW, author = "Lukas Knutsson", title = "Optimized {GIFs} from {Windows DIBs}", journal = j-CCCUJ, volume = "16", number = "12", pages = "??--??", month = dec, year = "1998", CODEN = "CCUJEX", ISSN = "1075-2838", bibdate = "Tue May 14 18:09:18 MDT 2002", bibsource = "http://www.cuj.com/articles/1998/9812/9812toc.htm?topic=articles; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", abstract = "Much of the ``World Wide Wait'' is spent downloading poorly encoded images. Anything that helps make images smaller is a boon.", acknowledgement = ack-nhfb, fjournal = "C/C++ Users Journal", }mD @Article{Kroeker:2000:PIM, author = "Kirk L. Kroeker", title = "Products: {iCompression}'s {MPEG-2} Encoder Reference Design Kit for {USB}; Free Project Management Support Tools; {Force Computers}' Protocol Software for Telecom Integration; {Data Junction}'s Free {XML} Tool; {Fookes Software}'s Text Editor for Programmers; {Research Systems}' {IDL} Wavelet Toolkit; {Be} Opens SouQ# @Article{Koyuturk:2006:NDB, author = "Mehmet Koyut{\"u}rk and Ananth Grama and Naren Ramakrishnan", title = "Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis", journal = j-TOMS, volume = "32", number = "1", pages = "33--69", month = mar, year = "2006", CODEN = "ACMSCU", DOI = "https://doi.org/10.1145/1132973.113297r Tuk @Article{L:2017:BDW, author = "Biji C. L. and Achuthsankar S. Nair", title = "Benchmark Dataset for Whole Genome Sequence Compression", journal = j-TCBB, volume = "14", number = "6", pages = "1228--1236", month = nov, year = "2017", CODEN = "ITCBCY", DOI = "https://doi.org/10.1109/TCBB.2016.2568186", ISSN = "1545-5963 (print), 1557-9964 (electronic)", ISSN-L = m(~} @Article{Klein:2003:PHD, author = "S. T. Klein and Y. Wiseman", title = "Parallel {Huffman} Decoding with Applications to {JPEG} Files", journal = j-COMP-J, volume = "46", number = "5", pages = "487--497", month = sep, year = "2003", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/46.5.487", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = (x3g @Article{Kundu:1982:CLM, author = "S. Kundu", title = "On a Class of Linear Maps for Data Compression", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "SE-8", number = "5", pages = "530--532", month = sep # "\slash " # oct, year = "1982", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/TSE.1982.235877", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Thu Feb 1 08:07:37 MST 2018", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1702981", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", }25 17:38:12 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib1997.01.25 17:38:12 MSTVarious compression techniques are discussed, along with numerous applications. A method of compression is considered which is based on a mathematical study concerned with the repartition of characters in a set natural language. A high rate of compression without risk of redundancies is obtained. It is about 1/30 (sometimes much higher) when operating in an interrogational mode and about one quarter when we want to find again the original data. The applications described demonstrate the interest of this approach: compression of keywords of a thesaurus, of names-first names, of titles-authors of books; comparison of texts, and applications in Hash-coding.computer programming languagesFrenchack-nhfbRAIRO Inf Comput SciVarious compression techniques are discussed, along with numerous applications. A method of compression is considered which is based on a mathematical study concerned with the repartition of characters in a set natural language. A high rate of compression without risk of redundancies is obtained. It is about 1/30 (sometimes much higher) when operating in an interrogational mode and about one quarter when we want to find again the original data. The applications described demonstrate the interest of this approach: compression of keywords of a thesaurus, of names-first names, of titles-authors of books; comparison of texts, and applications in Hash-coding.Guy Louis-GavetDiverses applications issues d'une fonction $f$ de compactage bas{\'e}e sur une {\'e}tude math{\'e}matique du langage naturel (compactage de donn{\'e}es, comparaison de textes, hash-coding). [Various Applications Issued from a Compression Function $f$ Based on a Mathematical Study of the Natural Language (Data Compression, Comparison of Texts, Hash-Coding)] @Article{Louis-Gavet:1978:DAI, author = "Guy Louis-Gavet", title = "Diverses applications issues d'une fonction $f$ de compactage bas{\'e}e sur une {\'e}tude math{\'e}matique du langage naturel (compactage de donn{\'e}es, comparaison de textes, hash-coding). [Various Applications Issued from a Compression Function $f$ Based on a Mathematical Study of the Natural Language (Data Compression, Comparison of Texts, Hash-Coding)]", journal = "RAIRO Informatique/Computer Science (Revue Fran{\c{c}}aise d'Automatique, d'Informatique et de Recherche Operationnelle)", volume = "12", number = "1", pages = "47--71", month = "????", year = "1978", CODEN = "RSINDN", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/hash.bib", abstract = "Various compression techniques are discussed, along with numerous applications. A method of compression is considered which is based on a mathematical study concerned with the repartition of characters in a set natural language. A high rate of compression without risk of redundancies is obtained. It is about 1/30 (sometimes much higher) when operating in an interrogational mode and about one quarter when we want to find again the original data. The applications described demonstrate the interest of this approach: compression of keywords of a thesaurus, of names-first names, of titles-authors of books; comparison of texts, and applications in Hash-coding.", acknowledgement = ack-nhfb, classification = "723", journalabr = "RAIRO Inf Comput Sci", keywords = "computer programming languages", language = "French", } <{V'3+[}%E-;[}9 inproceedingsdatacompression.bibStorer:1978:MMDJames A. Storer and Thomas G. SzymanskiThe macro model for data compression (Extended Abstract)ACM:1978:CRT30--391978Wed Feb 20 18:33:31 MST 2002http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2002.02.20 18:33:31 MSTack-nhfbJames A. Storer and Thomas G. SzymanskiThe macro model for data compression (Extended Abstract) @InProceedings{Storer:1978:MMD, author = "James A. Storer and Thomas G. Szymanski", title = "The macro model for data compression (Extended Abstract)", crossref = "ACM:1978:CRT", pages = "30--39", year = "1978", bibdate = "Wed Feb 20 18:33:31 MST 2002", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, }zzU3-_U!E};__Uwbookdatacompression.bibRabiner:1978:DPSLawrence R. Rabiner and Ronald W. SchaferDigital Processing of Speech Signalspub-PHpub-PH:adr1978Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTPrentice-Hall Series in Signal Processingack-dsLawrence R. Rabiner and Ronald W. SchaferDigital Processing of Speech Signals @Book{Rabiner:1978:DPS, author = "Lawrence R. Rabiner and Ronald W. Schafer", title = "Digital Processing of Speech Signals", publisher = pub-PH, address = pub-PH:adr, pages = "??", year = "1978", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", series = "Prentice-Hall Series in Signal Processing", acknowledgement = ack-ds, rawdata = "Rabiner, Lawrence R. and Ronald W. Schafer (1978) {\it Digital Processing of Speech Signals}, Englewood Cliffs, NJ, Prentice-Hall Series in Signal Processing.", }190", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-ds # " and " # ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "clustered bit vectors; codes, symbolic; compression method; data compression; encoding; fixed to variable encoding; information theory --- Data Compression; variable to fixed encoding; variable to variable encoding", rawdata = "Teuhola, J. (1978) ``A Compression Method for Clustered Bit-Vectors,'' {\it Information Processing Letters}, {\bf7}:308--311, October.", treatment = "T Theoretical or Mathematical", }| " 3g+ @Article{Sriram:1991:VPC, author = "Kotikalapudi Sriram and R. Scott McKinney and Mossg @Article{Segall:2007:SSW, author = "C. Andrew Segall and Gary J. Sullivan",/_ @Article{Senapati:2014:ILE, author = "Ranjan Kumar Senapati and Prasanth Mankar", title = "Improved Listless Embedded Block Partitioning Algorithms for Image Compression", journal = j-INT-J-IMAGE-GRAPHICS, volume = "14", number = "4", pages = "1450020", month = oct, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1142/S021946781450020X", ISSN = "0219-4678", ISSN-L = "0219-4678", bibdate = "Wed Dec 3 09:27:35 MST 2014", 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", } L!C @Article{Selgrad:2017:CRR, author = "Kai Selgrad and Alexander Lier and Magdalena Martinek and Christoph Buchenau and Michael Guthe and Franziska Kranz and Henry Sch{\"a}fer and Marc Stamminger", title = "A Compressed Representation for Ray Tracing Parametric Surfaces", journal = j-TOG, volume = "36", number = "1", pages = "5:1--5:??", month = feb, year = "2017",.] @Article{Seidel:2005:TAP, author = "Raimund Seidel and Micha Sharir", title = "Top-Down Analysis of Path Compression", journal = j-SIAM-J-COMPUT, volume = "34", number = "3", pages = "515--525", month = jun, year = "2005", CODEN = "SMJCAT", DOI = "https://doi.org/10.1137/S0097539703439088", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", bibdate = "Fri Dec 30 06:20:28 MST 2005", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/34/3; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/siamjcomput.bib", URL = "http://epubs.siam.org/sam-bin/dbq/article/43908", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } Esg @Article{Segall:2007:SSW, author = "C. Andrew Segall and Gary J. Sullivan", title = "Spatial Scalability Within the {H.264\slash AVC} Scalable Video Coding Extension", journal = j-IEEE-TRANS-CIRCUITS-SYST-VIDEO-TECH, volume = "17", number = "9", pages = "1121--1135", month = sep, year = "2007", CODEN = "ITCTEM", DOI = "https://doi.org/10.1109/tcsvt.2007.906824", ISSN = %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", pages = "44--??", year = "2000", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-97@!C @Article{Searfoss:1990:BBD, author = "Glenn Searfoss", title = "Bounding Box Data Compression", journal = j-DDJ, volume = "15", number = "4", pages = "56--64, 108", month = apr, year = "1990", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 03 09:12:37 1996", bibsource = "http://www.ddj.com/index/author/index.htm; http://www.math.utah.edu/pub/tex/bib/dataco s}X 3-%%-3C7;e9%9phdthesisdatacompression.bibYalabik:1978:CDCNese YalabikContour Data Compression Exploiting Curve-To-Curve DependencePh.D. thesisBrown UniversityProvidence, RI, USA1001978Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302882442Electrical engineeringack-nhfbNese YalabikContour Data Compression Exploiting Curve-To-Curve Dependence @PhdThesis{Yalabik:1978:CDC, author = "Nese Yalabik", title = "Contour Data Compression Exploiting Curve-To-Curve Dependence", type = "{Ph.D.} thesis", school = "Brown University", address = "Providence, RI, USA", pages = "100", year = "1978", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302882442", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "7906632", subject = "Electrical engineering", }_|X 3-'i-e57E;I9yw-G'iMarticledatacompression.bibTeuhola:1978:CMCJukka TeuholaA Compression Method for Clustered Bit-Vectorsj-INFO-PROC-LETT76308--311oct101978IFPLAThttps://doi.org/10.1016/0020-0190(78)90024-80020-0190 (print), 1872-6119 (electronic) OR 00200190 (print), 18726119 (electronic)0020-0190 OR 00200190Sat Jan 26 12:46:16 MST 2013Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib2013.01.26 12:46:16 MSTInformation Processing Lettersclustered bit vectors; codes, symbolic; compression method; data compression; encoding; fixed to variable encoding; information theory --- Data Compression; variable to fixed encoding; variable to variable encodingack-dsDept. of Computer Sci., Univ. of Turku, Turku, Finlandhttp://www.sciencedirect.com/science/journal/00200190Inf Process LettT Theoretical or MathematicalJukka TeuholaA Compression Method for Clustered Bit-Vectors @Article{Teuhola:1978:CMC, author = "Jukka Teuhola", title = "A Compression Method for Clustered Bit-Vectors", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "308--311", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(78)90024-8", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "Compendex database; 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 = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "clustered bit vectors; codes, symbolic; compression method; data compression; encoding; fixed to variable encoding; information theory --- Data Compression; variable to fixed encoding; variable to variable encoding", rawdata = "Teuhola, J. (1978) ``A Compression Method for Clustered Bit-Vectors,'' {\it Information Processing Letters}, {\bf7}:308--311, October.", treatment = "T Theoretical or Mathematical", }SSN-L = "0018-9448", 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 = "IEEE Transactions on Information Theory", rawdata-1 = "Ziv, Jacob and A. Lempel (1978) ``Compression of Individual Sequences via Variable-Rate Coding,'' {\it IEEE Transactions on Information Theory}, {\bf IT-24}(5):530--536.", rawdata-2 = "Ziv, J., and A. Lempel (1978) ``Compression of Individual Sequences via Variable-Rate Coding,'' {\it IEEE Transactions on Information Theory} IT-24(5):530--536.", }~ 62V !3)1I'1Istechreportdatacompression.bibBeebe:1979:IFDNelson H. F. BeebeIntegral File Data Compressioninst-CLSCinst-CLSC:adr3918may51979http://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bibNelson H. F. BeebeIntegral File Data Compression @TechReport{Beebe:1979:IFD, author = "Nelson H. F. Beebe", title = "Integral File Data Compression", institution = inst-CLSC, address = inst-CLSC:adr, pages = "39", day = "18", month = may, year = "1979", bibsource = "http://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", }G~Y3%;;]57Ek;[;'articledatacompression.bibZiv:1978:CISJacob Ziv and A. LempelCompression of Individual Sequences via Variable-Rate Codingj-IEEE-TRANS-INF-THEORYIT-245530--536sep91978IETTAWhttps://doi.org/10.1109/TIT.1978.10559340018-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/computer1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTIEEE Transactions on Information Theoryack-dsJacob Ziv and A. LempelCompression of Individual Sequences via Variable-Rate Coding @Article{Ziv:1978:CIS, author = "Jacob Ziv and A. Lempel", title = "Compression of Individual Sequences via Variable-Rate Coding", journal = j-IEEE-TRANS-INF-THEORY, volume = "IT-24", number = "5", pages = "530--536", month = sep, year = "1978", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/TIT.1978.1055934", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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 = "IEEE Transactions on Information Theory", rawdata-1 = "Ziv, Jacob and A. Lempel (1978) ``Compression of Individual Sequences via Variable-Rate Coding,'' {\it IEEE Transactions on Information Theory}, {\bf IT-24}(5):530--536.", rawdata-2 = "Ziv, J., and A. Lempel (1978) ``Compression of Individual Sequences via Variable-Rate Coding,'' {\it IEEE Transactions on Information Theory} IT-24(5):530--536.", } X 3-;U%=-C7;e-;Uphdthesisdatacompression.bibHouston:1979:AFMGeorge Branston HoustonThe Application of Formal Models to a Fully Adaptive General Purpose Digital Data Compression SystemPh.D. thesisUniversity of WashingtonSeattle, WA, USA3591979Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302947120Computer scienceack-nhfbGeorge Branston HoustonThe Application of Formal Models to a Fully Adaptive General Purpose Digital Data Compression System @PhdThesis{Houston:1979:AFM, author = "George Branston Houston", title = "The Application of Formal Models to a Fully Adaptive General Purpose Digital Data Compression System", type = "{Ph.D.} thesis", school = "University of Washington", address = "Seattle, WA, USA", pages = "359", year = "1979", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302947120", acknowledgement = ack-nhfb, classification = "0984: Computer science", dissertation-thesis-number = "7927805", subject = "Computer science", }aV'3)Ag%E-;Ageinproceedingsdatacompression.bibGalil:1979:NFGZvi Galil and Amnon NaamadNetwork flow and generalized path compressionACM:1979:CRE13--261979Wed Feb 20 18:33:31 MST 2002http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2002.02.20 18:33:31 MSTack-nhfbZvi Galil and Amnon NaamadNetwork flow and generalized path compression @InProceedings{Galil:1979:NFG, author = "Zvi Galil and Amnon Naamad", title = "Network flow and generalized path compression", crossref = "ACM:1979:CRE", pages = "13--26", year = "1979", bibdate = "Wed Feb 20 18:33:31 MST 2002", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, }|X 3)1%9GC7;e31phdthesisdatacompression.bibEvans:1979:SREArnold Kerry EvansStatistical Representation of Electrocardiographic Body Surface Maps for Feature Identification, Data Compression and ClassificationPh.D. thesisThe University of UtahSalt Lake City, UT 84112, USA961979Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302988278Biomedical researchack-nhfbArnold Kerry EvansStatistical Representation of Electrocardiographic Body Surface Maps for Feature Identification, Data Compression and Classification @PhdThesis{Evans:1979:SRE, author = "Arnold Kerry Evans", title = "Statistical Representation of Electrocardiographic Body Surface Maps for Feature Identification, Data Compression and Classification", type = "{Ph.D.} thesis", school = "The University of Utah", address = "Salt Lake City, UT 84112, USA", pages = "96", year = "1979", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302988278", acknowledgement = ack-nhfb, classification = "0541: Biomedical research", dissertation-thesis-number = "7924352", subject = "Biomedical research", } ;*D ;}} @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.y1 @PhdThesis{Mohammed:2004:HDR, author = "Falah H. M. Ahmad Mohammed", title = "High Data Rate Pulse Compression Using Non-Linear Transmission Line ({NLTL}) Technology", type = "{Ph.D.} thesis", school = "Queen's University of Belfast", address = "Belfast, Northern Ireland", pages = "249", year = "2004", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/305088588", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "C819979", subject = "Electrical engineering", }9s @PhdThesis{Nevill-Manning:1996:ISS, author = "C. G. Nevill-Manning", title = "Inferring Sequential Structure", type = "{Ph.D.} Thesis", school = "Department of Computer Science, University of Waikato", address = "Waikato, NZ", pages = "??", year = "1996", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, rawdata = "Nevill-Manning, C. G. (1996) ``Inferring Sequential Structure,'' Ph.D. thesis, Department of Computer Science, University of Waikato, New Zealand.", }Lum @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", }a @PhdThesis{Namphol:1991:NNB, author = "Aran Namphol", title = "Neural network based data compression", type = "{Ph.D.} thesis", school = "The Catholic University of America", address = "Washington, DC, USA", pages = "276", year = "1991", bibdate = "Fri Feb 1 08:42:55 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303929431", acknowledgement = ack-nhfb, advisor = "Mohammed Arozullah", classification = "0317: Neurology; 0544: Electrical engineering", dissertation-thesis-number = "9123107", subject = "Electrical engineering; Neurology", } , ? ",}} @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 kW @PhdThesis{Lelewer:1991:DCM, author = "Debra Ann Lelewer", title = "Data compression on machines with limited memory", type = "{Ph.D.} thesis", school = "University of California, Irvine", address = "Irvine, CA, USA", pages = "99", year = "1991", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303921041", acknowledgement = ack-nhfb, advisor = "Daniel S. Hirschberg", classification = "0984: Computer science", dissertation-thesis-number = "9120543", subject = "Computer science", } @PhdThesis{Lehman:2002:AAG, author = "Eric Allen Lehman", title = "Approximation algorithms for grammar-based data compression", type = "{Ph.D.} thesis", school = "Massachusetts Institute of Technology", address = "Cambridge, MA, USA", pages = "????", year = "2002", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/305445788", acknowledgement = ack-nhfb, advisor = "Madhu Sudan", classification = "0984: Computer science", dissertation-thesis-number = "0804007", subject = "Computer science", }cG @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", } ? @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", } toV 3)};]57E};[}9articledatacompression.bibRubin:1979:ASCF. RubinArithmetic Stream Coding Using Fixed Precision Registersj-IEEE-TRANS-INF-THEORY256672--675nov111979IETTAWhttps://doi.org/10.1109/tit.1979.10561070018-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-dsF. RubinArithmetic Stream Coding Using Fixed Precision Registers @Article{Rubin:1979:ASC, author = "F. Rubin", title = "Arithmetic Stream Coding Using Fixed Precision Registers", journal = j-IEEE-TRANS-INF-THEORY, volume = "25", number = "6", pages = "672--675", month = nov, year = "1979", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/tit.1979.1056107", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", }U 3')u+?/E};)u5miscdatacompression.bibRice:1979:SPURobert F. RiceSome Practical Universal Noiseless Coding TechniquesJPL Publication79-22Jet Propulsion LaboratoryPasadena, CA, USAmar31979Sat Jan 26 12:46:16 MST 2013http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.26 12:46:16 MSTack-dsRobert F. RiceSome Practical Universal Noiseless Coding Techniques @Misc{Rice:1979:SPU, author = "Robert F. Rice", title = "Some Practical Universal Noiseless Coding Techniques", type = "JPL Publication", number = "79-22", institution = "Jet Propulsion Laboratory", address = "Pasadena, CA, USA", pages = "??", month = mar, year = "1979", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, rawdata = "Rice, Robert F. (1979) ``Some Practical Universal Noiseless Coding Techniques,'' Jet Propulsion Laboratory, JPL Publication 79-22, Pasadena, CA, March.", } z+ @Article{Zhang:2013:FBA, author = "Yan Zhang and Fan Zhang and Zheming Jin and Jason D. Bakos", title = "An {FPGA-Based} Accelerator for Frequent Itemset Mining", journal = j-TRETS, volume = "6", number = "1", pages = "2:1--2:??", month = may, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2457443.2457445", ISSN = "1936-7406 (print), 1SY @Article{Zingirian:1997:CMV, author = "N. Zingirian and P. Baglietto and M. Maresca and M. Migliardi", title = "Customizing {MPEG} Video Compression Algorithms to Specific Application Domains: The %K @Article{Zhao:2015:BSB, author = "Jishen Zhao and Sheng Li and Jichuan Chang and John L. Byrne and Laura L. Ramirez and Kevin Lim and Yuan Xie and Paolo Faraboschi", title = "{Buri}: Scaling Big-Memory Computing with Hardware-Based Memory Expansion", journal = j-TACO, volume = "12", number = "3", pages = "31:1--31:??", month = oct, year = "2015", CODEN = D @Article{Zhao:2015:GSB, author = "Wayne Xin Zhao and Xudong Zhang and Daniel Lemire and Dongdong Shan and Jian-Yun Nie and Hongfei Yan and Ji-Rong Wen", title = "A General {SIMD}-Based Approach to Accelerating Compression Algorithms", journal = j-TOIS, volume = "33", number = "3", pages = "15:1--15:??", month = mar, year = "2015", CODEN = "ATISET", DOI - @Article{Zhang:2002:DCT, author = "Youtao Zhang and Rajiv Gupta", title = "Data Compression Transformations for Dynamically Allocated Data Structures", journal = j-LECT-NOTES-COMP-SCI, volume = "2304", pages = "14--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Sep 10 19:09:22 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2304.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2304/23040014.htm; http://link.springer-ny.com/link/service/series/0558/papers/2304/23040014.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", }ʅ @Article{Zhang:1995:PBLb, author = "Qin Zhang and John M. Danskin", title = "A Pattern-Based Lossy Compression Scheme for Document Images", journal = j-EPODD, volume = "8", number = "2--3", pages = "221--233", month = jun # "\slash " # sep, year = "1995", CODEN = "EPODEU", ISSN = "0894-3982", bibdate = "Fri Jul 11 07:26:02 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", fjournal = "Electronic Pub\-lish\-ing\emdash{}Orig\-i\-na\-tion, Dissemination, and Design", }~} @Article{Zeilberger:1994:TPT, author = "D. Zeilberger", title = "Theorems for a Price: Tomorrow's Semi-Rigorous Mathematical Culture", journal = j-MATH-INTEL, volume = "16", number = "4", pages = "11--14", month = "????", year = "1994", CODEN = "MAINDC", DOI = "https://doi.org/10.1007/bf03024696", ISSN = "0343-6993 (print), 1866-7414 (electronic)", ISSN-L = "0343-6993", bibdate = "Sun Jan 27 16:03:18 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "Reprint of \cite{Zeilberger:1993:TPT}.", acknowledgement = ack-nhfb, fjournal = "The Mathematical Intelligencer", })30 15:38:28 MDT 2008", bibsource = "http://ourworld.compuserve.com/homepages/crypto/BIBALL.HTM; http://www.dean.usma.edu/math/pubs/cryptologia/; http://www.math.utah.edu/pub/tex/bib/cryptologia.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "See also {\em Comm. ACM}, 19 (November 1976): 616--623.", URL = "http://www.informaworld.com/smpp/content~content=a741902806~db=all~order=page", acknowledgement = ack-nhfb, fjournal = "Cryptologia", journal-URL = "http://www.tandfonline.com/loi/ucry20", romanvolume = "III", xxtitle = "Crypto of Data Compression Codes", xxtitle = "Experiments in Text File Compression", } trgZ 3+3qW57E;'q=e3-3q)articledatacompression.bibTarjan:1979:APCRobert Endre TarjanApplications of Path Compression on Balanced Treesj-J-ACM264690--715oct101979JACOAHhttps://doi.org/10.1145/322154.3221610004-5411 (print), 1557-735X (electronic) OR 00045411 (print), 1557735X (electronic)0004-5411 OR 00045411Wed Jan 15 18:12:53 MST 1997Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://~V 3)7%3/C7;e97Aphdthesisdatacompression.bibSmith:1979:SPAGeorge Heavener SmithSpectral Peak Amplitude Coding for Voice Data CompressionPh.D. thesisStanford UniversityStanford, CA, USA1011979Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/302972664Electrical engineeringack-nhfbGeorge Heavener SmithSpectral Peak Amplitude Coding for Voice Data Compression @PhdThesis{Smith:1979:SPA, author = "George Heavener Smith", title = "Spectral Peak Amplitude Coding for Voice Data Compression", type = "{Ph.D.} thesis", school = "Stanford University", address = "Stanford, CA, USA", pages = "101", year = "1979", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302972664", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8002017", subject = "Electrical engineering", }X 3)#k'_57EC;u'#W#{kGarticledatacompression.bibRubin:1979:CADFrank RubinCryptographic Aspects of Data Compression Codesj-CRYPTOLOGIA34202--205oct101979CRYPE6https://doi.org/10.1080/0161-1179918540610161-1194 (print), 1558-1586 (electronic) OR 01611194 (print), 15581586 (electronic)0161-1194 OR 01611194Mon Jun 30 15:38:28 MDT 2008http://ourworld.compuserve.com/homepages/crypto/BIBALL.HTM; http://www.dean.usma.edu/math/pubs/cryptologia/; http://www.math.utah.edu/pub/tex/bib/cryptologia.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2008.06.30 15:38:28 MDTSee also em Comm. ACM, 19 (November 1976): 616--623.http://www.informaworld.com/smpp/content~content=a741902806~db=all~order=pageCryptologiaack-nhfbhttp://www.tandfonline.com/loi/ucry20Frank RubinSee also {\em Comm. ACM}, 19 (November 1976): 616--623.Cryptographic Aspects of Data Compression Codes @Article{Rubin:1979:CAD, author = "Frank Rubin", title = "Cryptographic Aspects of Data Compression Codes", journal = j-CRYPTOLOGIA, volume = "3", number = "4", pages = "202--205", month = oct, year = "1979", CODEN = "CRYPE6", DOI = "https://doi.org/10.1080/0161-117991854061", ISSN = "0161-1194 (print), 1558-1586 (electronic)", ISSN-L = "0161-1194", bibdate = "Mon Jun 30 15:38:28 MDT 2008", bibsource = "http://ourworld.compuserve.com/homepages/crypto/BIBALL.HTM; http://www.dean.usma.edu/math/pubs/cryptologia/; http://www.math.utah.edu/pub/tex/bib/cryptologia.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", note = "See also {\em Comm. ACM}, 19 (November 1976): 616--623.", URL = "http://www.informaworld.com/smpp/content~content=a741902806~db=all~order=page", acknowledgement = ack-nhfb, fjournal = "Cryptologia", journal-URL = "http://www.tandfonline.com/loi/ucry20", romanvolume = "III", xxtitle = "Crypto of Data Compression Codes", xxtitle = "Experiments in Text File Compression", }an 15 18:12:53 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Several fast algorithms are presented for computing functions defined on paths in trees under various assumptions. The algorithms are based on tree manipulation methods first used to efficiently represent equivalence relations. The algorithms have $ O((m + n) \alpha (m + n, n)) $ running times, where $m$ and $n$ are measures of the problem size and $ \alpha $ is a functional inverse of Ackermann's function. By using one or more of these algorithms in combination with other techniques, it is possible to solve several graph problems in $ O(m \alpha (m, n))$ time, where $m$ is the number of edges and $n$ is the number of vertices in the problem graph.", acknowledgement = ack-nhfb, classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Subroutines; data processing; mathematical techniques --- Trees", }www.math.utah.edu/pub/tex/bib/jacm.bib1997.01.15 18:12:53 MSTSeveral fast algorithms are presented for computing functions defined on paths in trees under various assumptions. The algorithms are based on tree manipulation methods first used to efficiently represent equivalence relations. The algorithms have $ O((m + n) alpha (m + n, n)) $ running times, where $m$ and $n$ are measures of the problem size and $ alpha $ is a functional inverse of Ackermann's function. By using one or more of these algorithms in combination with other techniques, it is possible to solve several graph problems in $ O(m alpha (m, n))$ time, where $m$ is the number of edges and $n$ is the number of vertices in the problem graph.Journal of the Association for Computing Machinerycomputer programming --- Subroutines; data processing; mathematical techniques --- Treesack-nhfbhttp://portal.acm.org/browse_dl.cfm?idx=J401J Assoc Comput MachSeveral fast algorithms are presented for computing functions defined on paths in trees under various assumptions. The algorithms are based on tree manipulation methods first used to efficiently represent equivalence relations. The algorithms have $ O((m + n) \alpha (m + n, n)) $ running times, where $m$ and $n$ are measures of the problem size and $ \alpha $ is a functional inverse of Ackermann's function. By using one or more of these algorithms in combination with other techniques, it is possible to solve several graph problems in $ O(m \alpha (m, n))$ time, where $m$ is the number of edges and $n$ is the number of vertices in the problem graph.Robert Endre TarjanApplications of Path Compression on Balanced Trees @Article{Tarjan:1979:APC, author = "Robert Endre Tarjan", title = "Applications of Path Compression on Balanced Trees", journal = j-J-ACM, volume = "26", number = "4", pages = "690--715", month = oct, year = "1979", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/322154.322161", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 15 18:12:53 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Several fast algorithms are presented for computing functions defined on paths in trees under various assumptions. The algorithms are based on tree manipulation methods first used to efficiently represent equivalence relations. The algorithms have $ O((m + n) \alpha (m + n, n)) $ running times, where $m$ and $n$ are measures of the problem size and $ \alpha $ is a functional inverse of Ackermann's function. By using one or more of these algorithms in combination with other techniques, it is possible to solve several graph problems in $ O(m \alpha (m, n))$ time, where $m$ is the number of edges and $n$ is the number of vertices in the problem graph.", acknowledgement = ack-nhfb, classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Subroutines; data processing; mathematical techniques --- Trees", } OOG X 3++5%!Y77Em;i7[+5sarticledatacompression.bibDunham:1980:AASJames G. DunhamAbstract Alphabet Sliding-Block Entropy Compression Coding with a Fidelity Criterionj-ANN-PROBAB861085--1092dec121980APBYAEhttps://doi.org/10.1214/aop/11769945700091-1798 OR 009117980091-1798 OR 00911798Sun Apr 20 10:44:17 MDT 2014http://www.math.utah.edu/pub/tex/bib/annprobab1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2014.04.20 10:44:17 MDThttp://projecteuclid.org/euclid.aop/1176994570Annals of Probabilityack-nhfbhttp://projecteuclid.org/all/euclid.aopJames G. DunhamAbstract Alphabet Sliding-Block Entropy Compression Coding with a Fidelity Criterion @Article{Dunham:1980:AAS, author = "James G. Dunham", title = "Abstract Alphabet Sliding-Block Entropy Compression Coding with a Fidelity Criterion", journal = j-ANN-PROBAB, volume = "8", number = "6", pages = "1085--1092", month = dec, year = "1980", CODEN = "APBYAE", DOI = "https://doi.org/10.1214/aop/1176994570", ISSN = "0091-1798", ISSN-L = "0091-1798", bibdate = "Sun Apr 20 10:44:17 MDT 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/annprobab1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://projecteuclid.org/euclid.aop/1176994570", acknowledgement = ack-nhfb, fjournal = "Annals of Probability", journal-URL = "http://projecteuclid.org/all/euclid.aop", }bX 31/;+/%E7;7;phdthesisdatacompression.bibBorjesson:1980:DCSPer Ola BorjessonData compression and signal estimation with application to digitized electrocardiogramsDoctoral thesisLunds universitetLund, Sweden441980Mon Jan 28 15:23:08 MST 2013catalog.crl.edu:210/INNOPAC; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.01.28 15:23:08 MSTack-nhfbPer Ola B{\"o}rjessonData compression and signal estimation with application to digitized electrocardiograms @PhdThesis{Borjesson:1980:DCS, author = "Per Ola B{\"o}rjesson", title = "Data compression and signal estimation with application to digitized electrocardiograms", type = "Doctoral thesis", school = "Lunds universitet", address = "Lund, Sweden", pages = "44", year = "1980", LCCN = "????", bibdate = "Mon Jan 28 15:23:08 MST 2013", bibsource = "catalog.crl.edu:210/INNOPAC; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, } CC !2{w @Article{Hawley:1990:POAb, author = "Michael Hawley", title = "The Personal Orchestra, or Audio Data Compression by 10,000:1", journal = j-COMP-SYS, volume = "3", number = "2", pages = "289--329", month = "SprQ# @Article{Hashempour:2005:AAC, author = "H. Hashempour and F. Lombardi", title = "Application of arithmetic coding to compression of {VLSI} test data", journal = j-IEEE-TRANS-COMPUT, volume = "54", number = "9", pages = "1166--1177", month = sep, year = "2005", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2005.136", ISSN = "0018-9340 (print), 1557-9956 (D @Article{Han:2017:CCF, author = "Yunheng Han and Weiwei Sun and Baihua Zheng", title = "{COMPRESS}: a Comprehensive Framework of Trajectory Compression in Road Networks", journal = j-TODS, volume = "42", number = "2", pages = "11:1--11:??", month = jun, year = "2017", CODEN = "ATDSD3", DOI = "https://doi.org/10.1145/3015457", ISSN = "0362-5915 (print), 1557-4644 (eleWdI @Article{Hart:1996:FIC, author = "John C. Hart", title = "Fractal image compression and recurrent iterated function systems", journal = j-IEEE-CGA, volume = "16", number = "4", pages = "25--33", month = jul, year = "1996", CODEN = "ICGADZ", DOI = "https://doi.org/10.1109/38.511849", ISSN = "0272-1716 (print), 1558-1756 (electronic)", ISSN-L = "0272-1716", bkW @Article{Hans:2001:LCD, author = "Mat Hans and R. W. Schafer", title = "Lossless Compression of Digital Audio", journal = j-IEEE-SIGNAL-PROCESS-MAG, volume = "18", number = "4", pages = "21--32", month = jul, year = "2001", CODEN = "ISPRE6", DOI = "https://doi.org/10.1109/79.939834", ISSN = "1053-5888 (print), 1558-0792 (electronic)", ISSN-L = "1053-5888", 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 signal processing magazine", rawdata = "Hans, Mat and R. W. Schafer (2001) ``Lossless Compression of Digital Audio,'' {\it IEEE Signal Processing Magazine}, {\bf18}(4):21--32, July.", } @Article{Hankerson:1999:TMI, author = "Darrel Hankerson and Greg A. Harris", title = "Transform Methods and Image Compression", journal = j-LINUX-J, volume = "57", pages = "??--??", month = jan, year = "1999", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Thu Jun 3 06:33:53 MDT 1999", bibsource = "http://noframes.linuxjournal.com/lj-issues/issue57/index.html; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/linux-journal.bib", abstract = "An introduction to JPEG and wavelet transform techniques.", acknowledgement = ack-nhfb, fjournal = "Linux Journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", } @Article{Han:1997:EDE, author = "Wei-Yu Han and Ja- Chen Lin", title = "Edge detection and edge-preserved compression for error- diffused images", journal = j-COMPUTERS-AND-GRAPHICS, volume = "21", number = "6", pages = "757--767", month = nov # "--" # dec, year = "1997", CODEN = "COGRD2", DOI = "https://doi.org/10.1016/s0097-8493(97)00055-1", ISSN = "0097-8493 (prinrint), 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 = "Frank, Amalie J., J. D. Daniels, and Diane R. Unangst (1980) ``Progressive Image Transmission Using a Growth-Geometry Coding,'' {\it Proceedings of the IEEE}, {\bf68}(7):897--909, July.", } JV3+Em#[57E};;Emarticledatacompression.bibHunter:1980:IDFR. Hunter and A. H. RobinsonInternational Digital Facsimile Coding Standardsj-PROC-IEEE687854--867jul71980IEEPADhttps://doi.org/10.1109/proc.1980.117510018-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=5R. Hunter and A. H. RobinsonInternational Digital Facsimile Coding Standards @Article{Hunter:1980:IDF, author = "R. Hunter and A. H. Robinson", title = "International Digital Facsimile Coding Standards", journal = j-PROC-IEEE, volume = "68", number = "7", pages = "854--867", month = jul, year = "1980", CODEN = "IEEPAD", DOI = "https://doi.org/10.1109/proc.1980.11751", ISSN = "0018-9219 (print), 1558-2256 (electronic)", ISSN-L = "0018-9219", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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 = "Hunter, R., and A. H. Robinson (1980) ``International Digital Facsimile Coding Standards,'' {\it Proceedings of the IEEE}, {\bf68}(7):854--867, July.", } X3)y#[57E};;y articledatacompression.bibFrank:1980:PITAmalie J. Frank and J. D. Daniels and Diane R. UnangstProgressive Image Transmission Using a Growth-Geometry Codingj-PROC-IEEE687897--909jul71980IEEPADhttps://doi.org/10.1109/proc.1980.117550018-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=5Amalie J. Frank and J. D. Daniels and Diane R. UnangstProgressive Image Transmission Using a Growth-Geometry Coding @Article{Frank:1980:PIT, author = "Amalie J. Frank and J. D. Daniels and Diane R. Unangst", title = "Progressive Image Transmission Using a Growth-Geometry Coding", journal = j-PROC-IEEE, volume = "68", number = "7", pages = "897--909", month = jul, year = "1980", CODEN = "IEEPAD", DOI = "https://doi.org/10.1109/proc.1980.11755", ISSN = "0018-9219 (print), 1558-2256 (electronic)", ISSN-L = "0018-9219", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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 = "Frank, Amalie J., J. D. Daniels, and Diane R. Unangst (1980) ``Progressive Image Transmission Using a Growth-Geometry Coding,'' {\it Proceedings of the IEEE}, {\bf68}(7):897--909, July.", } "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 = "Knowlton, Kenneth (1980) ``Progressive Transmission of Grey-Scale and Binary Pictures by Simple, Efficient, and Lossless Encoding Schemes,'' {\it Proceedings of the IEEE}, {\bf68}(7):885--896, July.", } ` V3)Sc/_57E};SScsarticledatacompression.bibLinde:1980:AVQY. Linde and A. Buzo and R. M. GrayAn Algorithm for Vector Quantization Designj-IEEE-TRANS-COMMCOM-2884--95jan11980IECMBThttps://doi.org/10.1109/tcom.1980.10945770090-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-dsY. Linde and A. Buzo and R. M. GrayAn Algorithm for Vector Quantization Design @Article{Linde:1980:AVQ, author = "Y. Linde and A. Buzo and R. M. Gray", title = "An Algorithm for Vector Quantization Design", journal = j-IEEE-TRANS-COMM, volume = "COM-28", pages = "84--95", month = jan, year = "1980", CODEN = "IECMBT", DOI = "https://doi.org/10.1109/tcom.1980.1094577", ISSN = "0090-6778 (print), 1558-0857 (electronic)", ISSN-L = "0090-6778", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, fjournal = "IEEE Transactions on Communications", rawdata-1 = "Linde,~Y., A. Buzo, and R. M. Gray (1980) ``An Algorithm for Vector Quantization Design,'' {\it IEEE Transactions on Communications}, {\bf COM-28}:84--95, January.", rawdata-2 = "Linde,~Y., A. Buzo, and R. M. Gray (1980) ``An Algorithm for Vector Quantization Design,'' {\it IEEE Transactions on Communications}, COM-28:84--95, January.", }IX 3/-i#[57E};;-i5articledatacompression.bibKnowlton:1980:PTGKenneth KnowltonProgressive Transmission of Grey-Scale and Binary Pictures by Simple, Efficient, and Lossless Encoding Schemesj-PROC-IEEE687885--896jul71980IEEPADhttps://doi.org/10.1109/proc.1980.117540018-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=5Kenneth KnowltonProgressive Transmission of Grey-Scale and Binary Pictures by Simple, Efficient, and Lossless Encoding Schemes @Article{Knowlton:1980:PTG, author = "Kenneth Knowlton", title = "Progressive Transmission of Grey-Scale and Binary Pictures by Simple, Efficient, and Lossless Encoding Schemes", journal = j-PROC-IEEE, volume = "68", number = "7", pages = "885--896", month = jul, year = "1980", CODEN = "IEEPAD", DOI = "https://doi.org/10.1109/proc.1980.11754", ISSN = "0018-9219 (print), 1558-2256 (electronic)", ISSN-L = "0018-9219", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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 = "Knowlton, Kenneth (1980) ``Progressive Transmission of Grey-Scale and Binary Pictures by Simple, Efficient, and Lossless Encoding Schemes,'' {\it Proceedings of the IEEE}, {\bf68}(7):885--896, July.", } 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 = "Linde,~Y., A. Buzo, and R. M. Gray (1980) ``An Algorithm for Vector Quantization Design,'' {\it IEEE Transactions on Communications}, {\bf COM-28}:84--95, January.", rawdata-2 = "Linde,~Y., A. Buzo, and R. M. Gray (1980) ``An Algorithm for Vector Quantization Design,'' {\it IEEE Transactions on Communications}, COM-28:84--95, January.", } 5V31C?#[57E};;C??)articledatacompression.bibNetravali:1980:PCPA. Netravali and J. O. LimbPicture Coding: a Previewj-PROC-IEEE68366--4061980IEEPADhttps://doi.org/10.1109/proc.1980.116470018-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=5A. Netravali and J. O. LimbPicture Coding: a Preview @Article{Netravali:1980:PCP, author = "A. Netravali and J. O. Limb", title = "Picture Coding: a Preview", journal = j-PROC-IEEE, volume = "68", pages = "366--406", year = "1980", CODEN = "IEEPAD", DOI = "https://doi.org/10.1109/proc.1980.11647", ISSN = "0018-9219 (print), 1558-2256 (electronic)", ISSN-L = "0018-9219", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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 = "Netravali, A. and J. O. Limb (1980) ``Picture Coding: A Preview,'' {\it Proceedings of the IEEE}, {\bf68}:366--406.", }2X 3'1%K-C7;e91iphdthesisdatacompression.bibMarr:1980:TDPJames Douglas MarrTwo-Dimensional Prediction for Data Rate Compression of Lpc ParametersPh.D. thesisGeorgia Institute of TechnologyAtlanta, GA, USA1541980Fri Feb 1 09:20:32 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:32 MSThttp://search.proquest.com/docview/303008916Electrical engineeringack-nhfbJames Douglas MarrTwo-Dimensional Prediction for Data Rate Compression of Lpc Parameters @PhdThesis{Marr:1980:TDP, author = "James Douglas Marr", title = "Two-Dimensional Prediction for Data Rate Compression of Lpc Parameters", type = "{Ph.D.} thesis", school = "Georgia Institute of Technology", address = "Atlanta, GA, USA", pages = "154", year = "1980", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303008916", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8105828", subject = "Electrical engineering", }-0782", bibdate = "Sun Feb 04 16:47:16 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib", note = "See remarks \cite{Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } u^V 3)-m;]57E};[-marticledatacompression.bibStout:1980:IPEQuentin F. StoutImproved Prefix Encodings of the Natural Numbersj-IEEE-TRANS-INF-THEORY265607--609sep91980IETTAWhttps://doi.org/10.1109/tit.1980.10562370018-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-dsQuentin F. StoutImproved Prefix Encodings of the Natural Numbers @Article{Stout:1980:IPE, author = "Quentin F. Stout", title = "Improved Prefix Encodings of the Natural Numbers", journal = j-IEEE-TRANS-INF-THEORY, volume = "26", number = "5", pages = "607--609", month = sep, year = "1980", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/tit.1980.1056237", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, fjournal = "IEEE Transactions on Information Theory", rawdata = "Stout, Quentin F. (1980) ``Improved Prefix Encodings of the Natural Numbers,'' {\it IEEE Transactions on Information Theory}, {\bf26}(5):607--609, September.", }[ 3/3 W57=C;1?c35 sarticledatacompression.bibPeterson:1980:CPDJames Lyle PetersonComputer Programs for Detecting and Correcting Spelling Errorsj-CACM2312676--687dec121980CACMA2https://doi.org/10.1145/359038.3590410001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 00010782Sun Feb 04 16:47:16 1996http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib1996.02.04 16:47:16 ???See remarks cite Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES.Communications of the ACMack-nhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79James Lyle PetersonSee remarks \cite{Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.Computer Programs for Detecting and Correcting Spelling Errors @Article{Peterson:1980:CPD, author = "James Lyle Peterson", title = "Computer Programs for Detecting and Correcting Spelling Errors", journal = j-CACM, volume = "23", number = "12", pages = "676--687", month = dec, year = "1980", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/359038.359041", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Feb 04 16:47:16 1996", bibsource = "http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib", note = "See remarks \cite{Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", }, 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Thu Jun 26 10:58:02 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/sigmetrics.bib", abstract = "This paper deals with the economic tradeoffs associated with data compression in a packet switching environment. In section II we present the data profile concept and the compression analysis of typical file-transfer data strings. This is followed by a compression cost saving model that is developed in section III. Upper bounds for an economically effective compression service are derived there, and the paper concludes with an example of these bounds based on state of the art technology.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } Y[3'CW%W57E;eeWeCW articledatacompression.bibAleh:1981:DUBAvner Aleh and K. Dan LevinThe determination of upper bounds for economically effective compression in packet switching networksj-SIGMETRICS11164--72Spring1981https://doi.org/10.1145/800047.8016940163-5999 (print), 1557-9484 (electronic) OR 01635999 (print), 15579484 (electronic)0163-5999 OR 01635999Thu Jun 26 10:58:02 MDT 2008http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/sigmetrics.bib2008.06.26 10:58:02 MDTThis paper deals with the economic tradeoffs associated with data compression in a packet switching environment. In section II we present the data profile concept and the compression analysis of typical file-transfer data strings. This is followed by a compression cost saving model that is developed in section III. Upper bounds for an economically effective compression service are derived there, and the paper concludes with an example of these bounds based on state of the art technology.ACM SIGMETRICS Performance Evaluation Reviewack-nhfbhttp://portal.acm.org/toc.cfm?id=J618This paper deals with the economic tradeoffs associated with data compression in a packet switching environment. In section II we present the data profile concept and the compression analysis of typical file-transfer data strings. This is followed by a compression cost saving model that is developed in section III. Upper bounds for an economically effective compression service are derived there, and the paper concludes with an example of these bounds based on state of the art technology.Avner Aleh and K. Dan LevinThe determination of upper bounds for economically effective compression in packet switching networks @Article{Aleh:1981:DUB, author = "Avner Aleh and K. Dan Levin", title = "The determination of upper bounds for economically effective compression in packet switching networks", journal = j-SIGMETRICS, volume = "11", number = "1", pages = "64--72", month = "Spring", year = "1981", CODEN = "????", DOI = "https://doi.org/10.1145/800047.801694", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Thu Jun 26 10:58:02 MDT 2008", bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/sigmetrics.bib", abstract = "This paper deals with the economic tradeoffs associated with data compression in a packet switching environment. In section II we present the data profile concept and the compression analysis of typical file-transfer data strings. This is followed by a compression cost saving model that is developed in section III. Upper bounds for an economically effective compression service are derived there, and the paper concludes with an example of these bounds based on state of the art technology.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } X 3)% %C/C7;e9% Iphdthesisdatacompression.bibBarba:1981:MADJoseph BarbaA Modified Adaptive Delta Modulator for Video Data CompressionPh.D. thesisCity University of New YorkNew York, NY, USA2191981Fri Feb 1 09:20:36 MST 2013http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2013.02.01 09:20:36 MSThttp://search.proquest.com/docview/303098954Electrical engineeringack-nhfbJoseph BarbaA Modified Adaptive Delta Modulator for Video Data Compression @PhdThesis{Barba:1981:MAD, author = "Joseph Barba", title = "A Modified Adaptive Delta Modulator for Video Data Compression", type = "{Ph.D.} thesis", school = "City University of New York", address = "New York, NY, USA", pages = "219", year = "1981", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303098954", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8203266", subject = "Electrical engineering", }020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "723; 731; C6120 (File organisation); C6130 (Data handling techniques); C7250L (Non-bibliographic retrieval systems)", corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computers, microprocessor; data base systems; data compression; data reduction; data reduction and analysis; database; information retrieval; information theory --- Data Compression; microcomputer systems; storage capacity", treatment = "P Practical", } 2[3)k-e57E;II}w-#kGarticledatacompression.bibDavis:1981:DCLR. H. Davis and C. Rinaldi and C. J. TrebilcockData Compression in Limited Capacity Microcomputer Systemsj-INFO-PROC-LETT134--5138--141End1981IFPLAThttps://doi.org/10.1016/0020-0190(81)90043-00020-0190 (print), 1872-6119 (electronic) OR 00200190 (print), 18726119 (electronic)0020-0190 OR 00200190Wed Nov 11 12:16:26 MST 1998Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib1998.11.11 12:16:26 MSTInformation Processing Letterscomputers, microprocessor; data base systems; data compression; data reduction; data reduction and analysis; database; information retrieval; information theory --- Data Compression; microcomputer systems; storage capacityack-nhfbThis issue was labelled End 1981, instead of Day Month 1981.Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh, UKhttp://www.sciencedirect.com/science/journal/00200190Inf Process LettP PracticalR. H. Davis and C. Rinaldi and C. J. TrebilcockData Compression in Limited Capacity Microcomputer Systems @Article{Davis:1981:DCL, author = "R. H. Davis and C. Rinaldi and C. J. Trebilcock", title = "Data Compression in Limited Capacity Microcomputer Systems", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "138--141", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(81)90043-0", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "723; 731; C6120 (File organisation); C6130 (Data handling techniques); C7250L (Non-bibliographic retrieval systems)", corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computers, microprocessor; data base systems; data compression; data reduction; data reduction and analysis; database; information retrieval; information theory --- Data Compression; microcomputer systems; storage capacity", treatment = "P Practical", }, 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", } XY 3/3{W57=C;!?c3%Warticledatacompression.bibDunlavey:1981:LESMichael R. DunlaveyLetter to the Editor: On Spelling Correction and Beyondj-CACM249608--608sep91981CACMA2https://doi.org/10.1145/358746.3834290001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)0001-0782 OR 00010782Sun Feb 04 16:48:13 1996http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/spell.bib1996.02.04 16:48:13 ???See cite Peterson:1980:CPD,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES.Communications of the ACMack-nhfbhttp://portal.acm.org/browse_dl.cfm?idx=J79Michael R. DunlaveySee \cite{Peterson:1980:CPD,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.Letter to the {Editor}: On Spelling Correction and Beyond @Article{Dunlavey:1981:LES, author = "Michael R. Dunlavey", title = "Letter to the {Editor}: On Spelling Correction and Beyond", journal = j-CACM, volume = "24", number = "9", pages = "608--608", month = sep, year = "1981", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/358746.383429", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Feb 04 16:48:13 1996", bibsource = "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", }81.tb00315.x", ISSN = "0005-8580", bibdate = "Tue Nov 9 11:15:56 MST 2010", bibsource = "http://bstj.bell-labs.com/oldfiles/year.1981/BSTJ.1981.6009.html; http://www.alcatel-lucent.com/bstj/vol60-1981/bstj-vol60-issue09.html; http://www.math.utah.edu/pub/tex/bib/bstj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://bstj.bell-labs.com/BSTJ/images/Vol60/bstj60-9-2167.pdf; http://www.alcatel-lucent.com/bstj/vol60-1981/articles/bstj60-9-2167.pdf", acknowledgement = ack-nhfb, fjournal = "The Bell System Technical Journal", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/", } ||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", }Z3%;w1!q7Cu;O;{Carticledatacompression.bibEng:1981:SPBK. Y. Eng and O. C. YueSpectral Properties and Band-Limiting Effects of Time-Compressed TV Signals in a Time-Compression Multiplexing Systemj-BELL-SYST-TECH-J6092167--2185nov111981BSTJANhttps://doi.org/10.1002/j.1538-7305.1981.tb00315.x0005-8580 OR 00058580Tue Nov 9 11:15:56 MST 2010http://bstj.bell-labs.com/oldfiles/year.1981/BSTJ.1981.6009.html; http://www.alcatel-lucent.com/bstj/vol60-1981/bstj-vol60-issue09.html; http://www.math.utah.edu/pub/tex/bib/bstj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib2010.11.09 11:15:56 MSThttp://bstj.bell-labs.com/BSTJ/images/Vol60/bstj60-9-2167.pdf; http://www.alcatel-lucent.com/bstj/vol60-1981/articles/bstj60-9-2167.pdfThe Bell System Technical Journalack-nhfbhttp://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/K. Y. Eng and O. C. YueSpectral Properties and Band-Limiting Effects of Time-Compressed {TV} Signals in a Time-Compression Multiplexing System @Article{Eng:1981:SPB, author = "K. Y. Eng and O. C. Yue", title = "Spectral Properties and Band-Limiting Effects of Time-Compressed {TV} Signals in a Time-Compression Multiplexing System", journal = j-BELL-SYST-TECH-J, volume = "60", number = "9", pages = "2167--2185", month = nov, year = "1981", CODEN = "BSTJAN", DOI = "https://doi.org/10.1002/j.1538-7305.1981.tb00315.x", ISSN = "0005-8580", bibdate = "Tue Nov 9 11:15:56 MST 2010", bibsource = "http://bstj.bell-labs.com/oldfiles/year.1981/BSTJ.1981.6009.html; http://www.alcatel-lucent.com/bstj/vol60-1981/bstj-vol60-issue09.html; http://www.math.utah.edu/pub/tex/bib/bstj1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://bstj.bell-labs.com/BSTJ/images/Vol60/bstj60-9-2167.pdf; http://www.alcatel-lucent.com/bstj/vol60-1981/articles/bstj60-9-2167.pdf", acknowledgement = ack-nhfb, fjournal = "The Bell System Technical Journal", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/", } 9{ z{ Sj!C @PhdThesis{Ramamurthi:1985:VQI, author = "Bhaskar Ramamurthi", title = "Vector Quantization of Images Based on a Composite Source Model (Coding, Data Compression, Picture)", type = "{Ph.D.} thesis", school = "University of California, Santa Barbara"2e @PhdThesis{Pigeon:2001:CCD, author = "Steven Pigeon", title = "Contributions {\`a} la compression de donn{\'e}es. ({French}) [Contributions to Data Compression]", type = "{Ph.D.} Thesis", school = "D{\'e}partement d'informatique et de recherche op{\'e}rationnelle, Facult{\'e} des Arts \& Sciences, Universit{\'e} de Montr{\'e}al", address = "Montr{\'e}al, QC, Canada", pages = "xviM @PhdThesis{Ramabadran:1987:ASM, author = "Tenkasi V. Ramabadran", title = "Adaptive Source Models for Data Compression", type = "{Ph.D.} thesis", school = "University of Notre Dame", address = "Notre Dame, IN, USA", pages = "162", year = "1987", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303617541", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "8712954", subject = "Electrical engineering", }QC @PhdThesis{Ramamurthi:1985:VQI, author = "Bhaskar Ramamurthi", tn] @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", }W/ @PhdThesis{Perkins:1988:DCS, author = "Michael G. Perkins", title = "Data compression of stereopairs", type = "{Ph.D.} thesis", school = "Stanford University", address = "Stanford, CA, USA", pages = "187", year = "1988", bibdate = "Fri Feb 1 08:42:55 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303695164", acknowledgement = ack-nhfb, advisor = "Peter M. Banks", classification = "0544: Electrical engineering", dissertation-thesis-number = "8815037", subject = "Electrical engineering", }$+Y @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", }G cV3-U}/_57E};SU}7 articledatacompression.bibLangdon:1981:CBWGlen G. Langdon and ~and J. RissanenCompression of Black White Images with Arithmetic Codingj-IEEE-TRANS-COMMCOM-296858--867jun61981IECMBThttps://doi.org/10.1109/tcom.1981.10950520090-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", DOI = "https://doi.org/10.1109/tcom.1981.1095052", ISSN = "0090-6778 (print), 1558-0857 (electronic)", ISSN-L = "0090-6778", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", }V33SS;]57E};[SS3 articledatacompression.bibKrichevsky:1981:PUCR. E. Krichevsky and V. K. TrofimovThe Performance of Universal Codingj-IEEE-TRANS-INF-THEORYIT-27199--207mar31981IETTAWhttps://doi.org/10.1109/tit.1981.10563310018-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", DOI = "https://doi.org/10.1109/tit.1981.1056331", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", } 6m~S' @AJ @Article{Larmore:1995:CHT, author = "Lawrence L. Larmore and Teresa M. Przytycka", title = "Constructing {Huffman} Trees in Parallel", journal = j-SIAM-J-COMPUT, volume = "24", number = "6", pages = "1163--1169", month = dec, year = "1995", CODEN = "SMJCAT", DOI = "https://doi.org/10.1137/S0097539792233245", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-57 @Article{Larsson:2000:LDB, author = "Larsson and Moffat", title = "Off-Line Dictionary-Based Compression", journal = j-PROC-IEEE, volume = "88", number = "11", pages = "1722--1732", year = "2000", CODEN = "IEEPAD", DOI = "https://doi.org/10.1109/5.892708", ISSN = "0018-9219 (print), 1558-2256 (electronic)", ISSN-L = "0018-9219", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibso#c @Article{Lea:1978:TCA, author = "R. M. Lea", title = "Text Compression with an Associative Parallel Processor", journal = j-COMP-J, volume = "21", number = "1", pages = "45--56", month = feb, year = "1978", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/21.1.45", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = V- @Article{LeGall:1991:MVC, author = "Didier {Le Gall}", title = "{MPEG}: a video compression standard for multimedia applications", journal = j-CACM, volume = "34", number = "4", pages = "46--58", month = apr, year = "1991", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/103085.103090", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782" G @Article{Lawrence:1977:NUC, author = "John C. Lawrence", title = "A New Universal Coding Scheme for the Binary Memoryless Source", journal = j-IEEE-TRANS-INF-THEORY, volume = "23", number = "4", pages = "466--472", month = jul, year = "1977", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/tit.1977.1055749", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", }lH @Article{Latendresse:2005:GFI, author = "Mario Latendresse and Marc Feeley", title = "Generation of fast interpreters for {Huffman} compressed bytecode", journal = j-SCI-COMPUT-PROGRAM, volume = "57", number = "3", pages = "295--317", month = sep, year = "2005", CODEN = "SCPGD4", DOI = "https://doi.org/10.1016/j.scico.2004.07.005", ISSN = "0167-6423 (print), 1872-7964 (electronic)", ISSN-L = "0167-6423", bibdate = "Fri Apr 1 18:38:50 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib; http://www.sciencedirect.com/science/journal/01676423", acknowledgement = ack-nhfb, fjournal = "Science of Computer Programming", journal-URL = "http://www.sciencedirect.com/science/journal/01676423", } } @Article{Li:2016:TLL, author = "Yimei Li and Yao Liang", title = "Temporal Lossless and Lossy Compression in Wireless Sensor Networks", journal = j-TOSN, volume = "12", number = "4", pages = "37:1--37:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2990196", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-485S' @Article{Lefebvre:2002:CLL, author = "Arnaud Lefebvre and Thierry Lecroq", title = "{Compror}: On-line lossless data compression with a factor oracle", journal = j-INFO-PROC-LETT, volume = "83", number = "1", pages = "1--6", day = "16", month = jul, year = "2002", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/s0020-0190(01)00308-8", ISSN = "002O^= @Article{Lelewer:1987:DC, author = "Debra A. Lelewer and Daniel S. Hirschberg", title = "Data Compression", journal = j-COMP-SURV, volume = "19", number = "3", pages = "261--296", month = sep, year = "1987", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/45072.45074", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat Jan 26 12:4A @Article{LeGia:2014:DCS, author = "Q. T. {Le Gia} and H. Wendland", title = "Data compression on the sphere using multiscale radial basis function approximation", journal = j-ADV-COMPUT-MATH, volume = "40", number = "4", pages = "923--943", month = aug, year = "2014", CODEN = "ACMHEX", DOI = "https://doi.org/10.1007/s10444-013-9334-z", ISSN = "1019-7168 (print), 1572|$X3 @Article{Lempel:1976:CFS, author = "A. Lempel and J. Ziv", title = "On the Complexity of Finite Sequences", journal = j-IEEE-TRANS-INF-THEORY, volume = "22", number = "1", pages = "75--81", year = "1976", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/tit.1976.1055501", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", }^+Z5 @Article{Langdon:1983:NZL, author = "Glen G. Langdon", title = "A Note on the {Ziv--Lempel} Model for Compressing Individual Sequences", journal = j-IEEE-TRANS-INF-THEORY, volume = "IT-29", number = "2", pages = "284--287", month = mar, year = "1983", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/tit.1983.1056645", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", } G G,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", }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", } @1.] @PhdThesis{Cabrera-Mercader:1999:RCM, author = "Carlos R. Cabrera-Mercader", title = "Robust compression of multispectral remote sensing data", type = "{Ph.D.} thesis", school = "Massachusetts Institute of Technology", address = "Cambridge, MA, USA", pages = "????", year = "1999", ISBN = "0-315-79189-6", ISBN-13 = "978-0-315-79189-3", 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/304562114", acknowledgement = ack-nhfb, advisor = "David H. Staelin", classification = "0544: Electrical engineering; 0799: Remote sensing", dissertation-thesis-number = "0801276", subject = "Electrical engineering; Remote sensing", }ք^= @PhdThesis{Buttigieg:1995:VLE, author = "Victor Buttigieg", title = "Variable-Length Error-Correcting Codes", type = "{Ph.D.} Thesis", school = "University of Manchester", address = "????", pages = "??", year = "1995", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, rawdata = "Buttigieg, Victor (1995a) {\it Variable-Length Error-Correcting Codes}, PhD thesis, University of Manchester.", }Fqe @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", },:w @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", }.> @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", }Z 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", }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", } V2xg$B @Arti+ @Article{Sriram:1991:VPC, author = "Kotikal>} @Article{Skarbek:1999:MOO! @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", 6o @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 &O @Article{Shannon:1951:PEP, author = "Claude E. Shannon", title = "Prediction and Entropy of Printed {English}", journal = j-BELL-SYST-TECH-J, volume = "30", number = "1", pages = "50--64", month = jan, year = "1951", CODEN = "BSTJAN", DOI = "https://doi.org/10.1002/j.1538-7305.1951.tb01366.x", ISSN = "0005-8580", ISSN-L = "", bibdate = "Sat Jan 26 12:46:16 MST 2013", t7 @Article{Shepard:1990:DCM, author = "Ron Shepard", title = "A data compression method applic%K @Article{Seo:2011:CDM, author = "Jaewoo Seo and Geoffrey Irving and J. P. Lewis and Junyong Noh", title = "Compression and direct manipulation of complex blendshape models", journal = j-TOG, volume = "30", number = "6", pages = "164:1--164:??", month = dec, year = "2011", CODEN = "ATGRDF", DOI = "https://doi.org/10.1145/2070781.2024198", ISSN = "0730 wo @Article{Shalinie:2006:MPF, author = "S. Mercy Shalinie", title = "Modeling parallel feed-forward based compression network", journal = j-INT-J-PAR-EMER-DIST-SYS, volume = "21", number = "4", pages = "227--237", month = "????", year = "2006", CODEN = "????", DOI = "https://doi.org/10.1080/17445760600567859", ISSN = "1744-5760 (print), 1744-5779 (electronic)", ISSN-L = "1744-5760", bibdate = "Thu Jul 10 22:10:57 MDT 2008", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib", URL = "http://www.informaworld.com/smpp/content~content=a747880320", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/gpaa20", } L @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.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 Y Y,V 3/)a![57E};)aCarticledatacompression.bibReghbati:1981:ODCH. K. ReghbatiAn Overview of Data Compression Techniquesj-COMPUTER14471--761981CPTRB4https://doi.org/10.1109/c-m.1981.2204160018-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", DOI = "https://doi.org/10.1109/c-m.1981.220416", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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", } 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", } 99C W3/ISW57EO;?cISyarticledatacompression.bibRobinson:1981:ASCP. J. Robinson and Dave SingerAnother Spelling Correction Programj-CACM245296--2971981CACMA2https://doi.org/10.1145/358645.3586520001-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", DOI = "https://doi.org/10.1145/358645.358652", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#RobinsonS81; 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", } 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.", } zz"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", }p!W3)qW57EQ;qequ articledatacompression.bibRodeh:1981:LADMichael Rodeh and Vaughan R. Pratt and Shimon EvenLinear Algorithm for Data Compression via String Matchingj-J-ACM28116--24jan11981JACOAHhttps://doi.org/10.1145/322234.3222370004-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", DOI = "https://doi.org/10.1145/322234.322237", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; 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", }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", }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", } P~(V 3)#O;]57E};[#S! articledatacompression.bibLloyd:1982:LSQS. P. LloydLeast Squares Quantization in PCMj-IEEE-TRANS-INF-THEORYIT-28129--137mar31982IETTAWhttps://doi.org/10.1109/tit.1982.10564890018-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", DOI = "https://doi.org/10.1109/tit.1982.1056489", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:12 MST 2013", bibsource = "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.", },'Y 3)i9[57C};_igarticledatacompression.bibKundu:1982:CLMS. KunduOn a Class of Linear Maps for Data Compressionj-IEEE-TRANS-SOFTW-ENGSE-85530--532sep91982IESEDJhttps://doi.org/10.1109/TSE.1982.2358770098-5589 (print), 1939-3520 (electronic) OR 00985589 (print), 19393520 (electronic)0098-5589 OR 00985589Thu Feb 1 08:07:37 MST 2018http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib2018.02.01 08:07:37 MSThttp://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1702981IEEE Transactions on Software Engineeringack-nhfbhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32S. KunduOn a Class of Linear Maps for Data Compression @Article{Kundu:1982:CLM, author = "S. Kundu", title = "On a Class of Linear Maps for Data Compression", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "SE-8", number = "5", pages = "530--532", month = sep # "\slash " # oct, year = "1982", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/TSE.1982.235877", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Thu Feb 1 08:07:37 MST 2018", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1702981", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", }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}.", } :*W 3-1kW57Ee;?c1kQarticledatacompression.bibPechura:1982:FATMichael A. PechuraFile Archival Techniques Using Data Compressionj-CACM259605--6091982CACMA2https://doi.org/10.1145/358628.3586350001-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", DOI = "https://doi.org/10.1145/358628.358635", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:11:57 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Pechura82; 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", }_)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}.", } X,W3+[_W57E;qe[_oarticledatacompression.bibStorer:1982:DCTJames A. Storer and Thomas G. SzymanskiData Compression via Textual Substitutionj-J-ACM294928--951oct101982JACOAHhttps://doi.org/10.1145/322344.3223460004-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", DOI = "https://doi.org/10.1145/322344.322346", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", }L+Y'3+=E%!E};=Ewinproceedingsdatacompression.bibRonson:1982:ABTJ. Ronson and J. DewitteProceedings of the IEEE International Conference on Acoustics, Speech, and Signal ProcessingAdaptive Block Truncation Coding Scheme Using an Edge Following 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.", } "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.", } ' 0/ u' @InProceedings{Zipstein:1991:DCF, author = "M. Zipstein", title = "Data compression with factor automata", crossref = "Storer:1991:DDC", pages = "??--??", year = "1991", DOI = "https://doi.org/10.1109/DCC.1991.213333", bibdate = "Tue Feb 5 14:06:15 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213333", acknowledgement = ack-nhfb, }D @InProceedings{Zhou:2012:CMC, author = "Jiantao Zhou and Xiaolin Wu", title = "Context Modeling and Correction of Quantization Errors in Prediction Loop", crossref = "Storer:2012:DDC", pages = "82--88", year = "2012", DOI = "https://doi.org/10.1109/DCC.2012.16", bibdate = "Tue Feb 5 12:15:47 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189239", acknowledgement = ack-nhfb, } ~} @InProceedings{Zhu:2011:ITB, author = "Lingchen Zhu and Hongkai Xiong", title = "Iterative Thresholding-Based Sparse Directional Representation for Efficient Low Bit-Rate Embedded Video Coding", crossref = "Storer:2011:DDC", pages = "93--102", year = "2011", DOI = "https://doi.org/10.1109/DCC.2011.16", bibdate = "Tue Feb 5 11:58:09 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749467", acknowledgement = ack-nhfb, } @InProceedings{Zhao:2011:CIP, author = "Hua Zhao and Songfeng Lu", title = "Compressed Index for Property Matching", crossref = "Storer:2011:DDC", pages = "133--142", year = "2011", DOI = "https://doi.org/10.1109/DCC.2011.20", bibdate = "Tue Feb 5 11:58:09 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749471", acknowledgement = ack-nhfb, }(Q @InProceedings{Zhu:1992:IRH, author = "Q.-F. Zhu and Y. Wang and L. Shaw", title = "Image reconstruction for hybrid video coding systems", crossref = "Storer:1992:DCC", pages = "229--238", year = "1992", DOI = "https://doi.org/10.1109/DCC.1992.227458", bibdate = "Tue Feb 5 14:06:23 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227458", acknowledgement = ack-nhfb, }UjU @InProceedings{Zheng:2006:AMA, author = "J. Zheng and E. Duni and B. D. Rao", title = "Analysis of multiple antenna systems with finite-rate feedback using high resolution quantization theory", crossref = "Storer:2006:DPD", pages = "73--82", year = "2006", DOI = "https://doi.org/10.1109/DCC.2006.6", bibdate = "Tue Feb 5 14:07:32 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607242", acknowledgement = ack-nhfb, } "bE @InProceedings{Zhao:2009:FPS, author = "Fan Zhao and Guizhong Liu and Feifei Ren and Na Zhang", title = "Flexible Predictions Selection for Multi-view Video Coding", crossref = "Storer:2009:DPD", pages = "471--471", year = "2009", DOI = "https://doi.org/10.1109/DCC.2009.35", bibdate = "Tue Feb 5 12:39:10 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976525", acknowledgement = ack-nhfb, } .V3#=ge77C;YgwG=g articledatacompression.bibWu:1982:ABAJ. K. Wu and R. E. BurgeAdaptive Bit Allocation for Image Compressionj-CGIP194392--400aug81982CGIPBGhttps://doi.org/10.1016/0146-664x(82)90024-70146-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", DOI = "https://doi.org/10.1016/0146-664x(82)90024-7", ISSN = "0146-664X", ISSN-L = "0146-664X", bibdate = "Fri Feb 7 08:36:21 MST 1997", bibsource = "Compendex database; 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", }L-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", } D? @Article{Gallager:1978:VTH, author = "Robert G. Gal5 @Article{Funasaka:2017:ALL, author = "Shunji Funasaka and Koji Nakano and Yasuaki Ito", title = "Adaptive loss-less data compression method optimized for {GPU} decompression", journal = j-CCPE, volume = "29", number = "24", pages = "??--??", day = "25", month = dec, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4283", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Dec 30 09:11:59 MST 2017", bibsource = "http://www.math.utah.edu/pub/tex/bib/ccpe.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } ,Y @Article{Gaither:1998:TDD, author = "Justin Gaither", title = "A Tale of {DXPC}: Differential {X} Protocol Compression", journal = j-LINUX-J, volume = "53", pages = "??--??", month = sep, year = "1998", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Fri Oct 9 08:35:26 MDT 1998", bibsource = "http://noframes.linuxjournal.com/lj-issues/issue53/index.html; http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/linux-journal.bib", acknowledgement = ack-nhfb, fjournal = "Linux Journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", }S}{ @Article{Gage:1997:RAD, author = "Philip Gage", title = "Random Access Data Compression", journal = j-CCCUJ, volume = "15", number = "9", pages = "23--??", month = sep, year = "1997", CODEN = "CCUJEX", ISSN = "1075-2838", bibdate = "Wed Aug 20 10:24:19 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "C/C++ Users Journal", }? @Article{Gage:1994:NAD, author = "Philip Gage", title = "A New Algorithm for Data Compression", journal = j-CUJ, volume = "12", number = "2", pages = "23--28", month = feb, year = "1994", ISSN = "0898-9788", ISSN-L = "", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.cuj.com/cbklist.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", W/ @Article{Furht:1999:PRM, author = "Borko Furht and Raymond Westwater and Jeffrey Ice", title = "Project Reports: Multimedia broadcasting over the {Internet}. {II}. {Video} compression", journal = j-IEEE-MULTIMEDIA, volume = "6", number = "1", pages = "85--89", month = jan # "--" # mar, year = "1999", CODEN = "IEMUE4", ISSN = "1070-986X (print), 1941-0166 (electronic)", ISSN-L = "1070-986X", bibdate = "Mon Jan 29 16:49:44 MST 2001", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib", URL = "http://dlib.computer.org/mu/books/mu1999/pdf/u1085.pdf", acknowledgement = ack-nhfb, fjournal = "IEEE MultiMedia", }' 4AN[P! @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 >} @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", }C1J @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 = :u @Article{Shibata:2000:SPM, author = "Yusuke Shibata and Takuya Kida and Shuichi Fukamachi and Masayuki Takeda and Ayumi Shinohara and Takeshi Shinohara and Setsuo Arikawa", title = "Speeding Up Pattern Matching by Text Compression", journal = j-LECT-NOTES-COMP-SCI, volume = "1767", pages = "306--??", year = "2000", CODEN = "LNCSD9", DOI = "https://doi.org/10.1016/s0304-3975(02CǈQ# @Article{Shapira:2005:PDF, author = "Dana Shapira and James A. Storer", title = "In Place Differential File Compression", journal = j-COMP-J, volume = "48", number = "6", pages = "677--691", month = nov, year = "2005", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxh128", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tu 8q @Article{Sennhauser:1994:DIC, author = "Rene Sennhauser and Krystyna W. Ohnesorge", title = "Document image compression using document analysis and block-class-specific data compression methods", journal = "Proceedings of SPIE --- The International Society for Optical Engineering", volume = "2186", pages = "146--155", year = "1994", CODEN = "PSISDG", ISBN = "0-8194-1481-6", I3RS' @Article{Scott:2002:AAO, author = "David A. Scott", title = "Algorithm Alley: Optimal {EOF} Handling with Arithmetic Compression", journal = j-DDJ, volume = "27", number = "1", pages = "99, 102", month = jan, year = "2002", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Feb 12 05:21:41 MST 2002", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://www.ddj.com/ftp/2002/2002_01/aa0102.zip", abstract = "When it comes to compression, properly handling the end of the bitstream requires modeling what is really happening. David examines one way to do this using arithmetic coding. Additional resources include {\tt aa0102.zip} (source code).", acknowledgement = ack-nhfb, fjournal = "Dr. Dobb's Journal of Software Tools", } J W;HI'Q @PhdThesis{Ma:1978:DC, author = "Joong Soo Ma", title = "Data Compression", type = "{Ph.D.} thesis", school = "University of Massachusetts Amherst", address = "Amherst, MA, USA", pages = "148", year = "1978", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/302919063", acknowledgement = ack-nhfb, classification = "0544: Electrical engineering", dissertation-thesis-number = "7903802", subject = "Electrical engineering", }yjL @PhdThesis{Borjesson:1980:DCS, author = "Per Ola B{\"o}rjesson", title = "Data compression and signal estimation with application to digitized electrocardiograms", type = "Doctoral thesis", school = "Lunds universitet", address = "Lund, Sweden", pages = "44", year = "1980", LCCN = "????", bibdate = "Mon Jan 28 15:23:08 MST 2013", bibsource = "catalog.crl.edu:210/INNOPAC; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, }ڏ) @Article{Tarjan:1979:APC, author = "Robert Endre Tarjan", title = "Applications of Path Compression on Balanced Trees", journal = j-J-ACM, volume = "26", number =]CY 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 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, } G G0Y '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.", }&/V3'Sg/_57E};SSko articledatacompression.bibBurt:1983:LPCPeter J. Burt and Edward H. AdelsonThe Laplacian Pyramid as a Compact Image Codej-IEEE-TRANS-COMMCOM-314532--540apr41983IECMBThttps://doi.org/10.1109/tcom.1983.10958510090-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", DOI = "https://doi.org/10.1109/tcom.1983.1095851", ISSN = "0090-6778 (print), 1558-0857 (electronic)", ISSN-L = "0090-6778", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", }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.", }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", } m42V 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", }1W3/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", } E[4X 3-+;]57E};[+5articledatacompression.bibLangdon:1983:NZLGlen G. LangdonA Note on the Ziv--Lempel Model for Compressing Individual Sequencesj-IEEE-TRANS-INF-THEORYIT-292284--287mar31983IETTAWhttps://doi.org/10.1109/tit.1983.10566450018-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", DOI = "https://doi.org/10.1109/tit.1983.1056645", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", }73U 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.", } wDU 3f"(Q @Article{Lin:2012:FAH, author = "Yih-Kai Lin and Shu-Chien Huang and Cheng-Hsing Yang", title = "A fast algorithm for {Huffman} decoding based on a recursion {Huffman} tree", journal = j-J-SYST-SOFTW, volume = "85", number = "4", pages = "974--980", month = apr, year = "2012", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2011.11.1019", ISSN = "0164-1212 (pr ; @Article{Lin:2003:EDC, author = "Chun-Yuan Lin and Yeh-Ching Chung and Jen-Shiuh Liu", title = "Efficient data compression methods for multidimensional sparse array operations based on the {EKMR} scheme", journal = j-IEEE-TRANS-COMPUT, volume = "52", number = "12", pages = "1640--1646", month = dec, year = "2003", CODEN = "ITCOB4", DOI = "https://doi.org/10.111ys @Article{Linde:1980:AVQ, author = "Y. Linde and A. Buzo and R. M. Gray", title = "An Algorithm for Vector Quantization Design", journal = j-IEEE-TRANS-COMM, volume = "COM-28", pages = "84--95", month = jan, year = "1980", CODEN = "IECMBT", DOI = "https://doi.org/10.1109/tcom.1980.1094577", ISSN = "0090-6778 (print), 1558-0857 (electronic)", ISSN-L = "0090-6778", bibdate = "Satn] @Article{Lin:2011:EPB, author = "Yih-Lon Lin and Ming-Sheng Wu", title = "An edge property-based neighborhood region search strategy for fractal image compression", journal = j-COMPUT-MATH-APPL, volume = "62", number = "1", pages = "310--318", month = jul, year = "2011", CODEN = "CMAPDK", DOI = "https://doi.org/10.1016/j.camwa.2011.05.011", ISSN = "0898-1221 (print), D @Article{Lin:2007:TED, author = "Chin-Feng Lin and Yeh-Ching Chung and Don-Lin Yang", title = "{TRLE} --- an efficient data compression scheme for image composition of volume rendering on distributed memory multicomputers", journal = j-J-SUPERCOMPUTING, volume = "39", number = "3", pages = "321--345", month = mar, year = "2007", CODEN = "JOSUED", DOI = "https:jU @Article{Lin:2014:SSE, author = "Xing Lin and Yebin Liu and Jiamin Wu and Qionghai Dai", title = "Spatial-spectral encoded compressive hyperspectral imaging", journal = j-TOG, volume = "33", number = "6", pages = "233:1--233:??", month = nov, year = "2014", CODEN = "ATGRDF", DOI = "https://doi.org/10.1145/2661229.2661262", ISSN = "0730-0301 (print), ; @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; 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", } PP-6X 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", }{5Z '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", }at 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", } A$8X %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", };7X 3+%g-e57Ea;E}wG%garticledatacompression.bibStorer:1983:TATJ. A. StorerToward an abstract theory of data compressionj-THEOR-COMP-SCI243221--237aug81983TCSCDIhttps://doi.org/10.1016/0304-3975(83)90001-40304-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", DOI = "https://doi.org/10.1016/0304-3975(83)90001-4", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:36:07 MST 1997", bibsource = "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", } T Tx:X3+K/_57E};SKKarticledatacompression.bibCleary:1984:DCUJohn G. Cleary and I. H. WittenData Compression Using Adaptive Coding and Partial String Matchingj-IEEE-TRANS-COMMCOM-324396--402apr41984IECMBThttps://doi.org/10.1109/tcom.1984.10960900090-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", DOI = "https://doi.org/10.1109/tcom.1984.1096090", ISSN = "0090-6778 (print), 1558-0857 (electronic)", ISSN-L = "0090-6778", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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.", },9X 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", }tronic)", 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.", } "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, } V3/SM;]57E};[SQGarticledatacompression.bibFerguson:1984:SSHT. J. Ferguson and J. H. RabinowitzSelf-Synchronizing Huffman codesj-IEEE-TRANS-INF-THEORY304687--693jul71984IETTAWhttps://doi.org/10.1109/tit.1984.10569310018-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", DOI = "https://doi.org/10.1109/tit.1984.1056931", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "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=Z3-E)Q57'C;KqYEarticledatacompression.bibErnvall:1984:ELMJ. Ernvall and O. NevalainenEstimating the length of minimal spanning trees in compression of filesj-BIT24119--32mar31984BITTEL, NBITABhttps://doi.org/10.1007/BF019345120006-3835 (print), 1572-9125 (electronic) OR 00063835 (print), 15729125 (electronic)0006-3835 OR 0006383568R10 (68P05)85b:68040Wed Jan 4 18:52:18 MST 2006http://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.bib2006.01.04 18:52:18 MSThttp://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=24&issue=1&spage=19BIT (Nordisk tidskrift for informationsbehandling)ack-nhfbhttp://link.springer.com/journal/10543J. Ernvall and O. NevalainenEstimating the length of minimal spanning trees in compression of files @Article{Ernvall:1984:ELM, author = "J. Ernvall and O. Nevalainen", title = "Estimating the length of minimal spanning trees in compression of files", journal = j-BIT, volume = "24", number = "1", pages = "19--32", month = mar, year = "1984", CODEN = "BITTEL, NBITAB", DOI = "https://doi.org/10.1007/BF01934512", ISSN = "0006-3835 (print), 1572-9125 (electronic)", ISSN-L = "0006-3835", MRclass = "68R10 (68P05)", MRnumber = "85b:68040", bibdate = "Wed Jan 4 18:52:18 MST 2006", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=24&issue=1; 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", } s?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, }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", } H@\ 3-!7q7=;]9!)articledatacompression.bibGharavi:1984:CVLH. GharaviConditional variable-length coding for gray-level picturesj-ATT-BELL-LAB-TECH-J632249--2601984ABLJERhttps://doi.org/10.1002/j.1538-7305.1984.tb00093.x0748-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", DOI = "https://doi.org/10.1002/j.1538-7305.1984.tb00093.x", 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`zbBW !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.", }AW 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, } %% $Vwo @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 }} @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", }0`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", }xq @PhdThesis{Shalaby:1991:DHT, author = "Hossam M. H. Shalaby", title = "Distributed hypothesis testing with data compression", type = "{Ph.D.} thesis", school = "University of Maryland", address = "College Park, MD, USA", pages = "136", year = "1991", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/304016569", acknowledgement = ack-nhfb, advisor = "Adrian Papamarcou", classification = "0544: Electrical engineering", dissertation-thesis-number = "9133160", subject = "Electrical engineering", } "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", } g # 4EVg"M @Article{Zirkind:2007:ADC, author = "Givon Zirkind", title = "{AFIS} data compression: an A @Article{deRooij:2012:ARD, author = "Steven de Rooij and Paul M. B. Vitanyi", title = "Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising", journal = j-IEEE-TRANS-COMPUT, volume = "61", number = "3", pages = "395--407", month = mar, year = "2012", CODEN = "ITCOB4", DOI = )S @Article{Zipstein:1992:DCF, author = "M. Zipstein", title = "Data compression with factor automata", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "213--221", day = " @Article{Ziviani:2000:CKN, author = "Nivio Ziviani and Edleno Silva de Moura and Gonzalo Navarro and Ricardo Baeza-Yates", title = "Compression: a Key for Next-Generation Text Retrieval Systems", journal = j-COMPUTER, volume = "33", number = "11", pages = "37--44", month = nov, year = "2000", CODEN = "CPTRB4", DOI = "https://doi.org/10.1109/2.881693", ISSN =V' @Article{Ziv:1978:CIS, author = "Jacob Ziv and A. Lempel", title = "Compression of Individual Sequences via Variable-Rate Coding", journal = j-IEEE-TRANS-INF-THEORY, volume = "IT-24", number = "5", pages = "530--536", month = sep, year = "1978", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/TIT.1978.1055934", ISSN = "0018-9448 (print), 1557-9654 (electronic)", I @Article{Ziv:1977:UAS, author = "Jacob Ziv and A. Lempel", title = "A Universal Algorithm for Sequential Data Compression", journal = j-IEEE-TRANS-INF-THEORY, volume = "IT-23", number = "3", pages = "337--343", month = may, year = "1977", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/TIT.1977.1055714", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L =M @Article{Zirkind:2007:ADC, author = "Givon Zirkind", title = "{AFIS} data compression: an example of how domain specific compression algorithms can produce very high compression ratios", journal = j-COMP-GRAPHICS, volume = "41", number = "4", pages = "1--36", month = nov, year = "2007", CODEN = "CGRADI, CPGPBZ", DOI = "https://doi.org/10.1145/1331098.1331103", )S @Article{Zipstein:1992:DCF, author = "M. Zipstein", title = "Data compression with factor automata", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "213--221", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", DOI = "https://doi.org/10.1016/0304-3975(92)90144-5", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", blY @Article{Zingirian:1997:CMV, author = "N. Zingirian and P. Baglietto and M. Maresca and M. Migliardi", title = "Customizing {MPEG} Video Compression Algorithms to Specific Application Domains: The Case of Highway Monitoring", journal = j-LECT-NOTES-COMP-SCI, volume = "1311", pages = "46--??", year = "1997", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Apr 28 08:51:33 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } ^^DZ 3)1Y=)W57E#;k/7w5kY] articledatacompression.bibSmith:1984:PFFAlvy Ray Smith IIIPlants, Fractals, and Formal Languagesj-COMPUTERS-AND-GRAPHICS1831--10jul71984CGRADI, CPGPBZhttps://doi.org/10.1145/964965.8085710097-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", DOI = "https://doi.org/10.1145/964965.808571", ISSN = "0097-8930 (print), 1558-4569 (electronic)", ISSN-L = "0097-8930", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "Ai/alife.bib; 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", } |y @PhdThesis{Chang:1993:SPM, author = "Daniel Kuo-Yee Chang", title = "String pattern matching and lossless data compression", type = "{Ph.D.} thesis", school = "City University of New York", address = "New York, NY, USA", pages = "110", year = "1993", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/304028781", acknowledgement = ack-nhfb, advisor = "Charles Giardina", classification = "0984: Computer science", dissertation-thesis-number = "9325077", subject = "Computer science", }kys @PhdThesis{Chang:1991:UDCb, author = "Soo-Young Chang", title = "Universal data compression by using tree models", type = "{Ph.D.} thesis", school = "The Pennsylvania State University", address = "University Park, PA, USA", pages = "166", year = "1991", bibdate = "Fri Feb 1 09:20:36 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303950372", acknowledgement = ack-nhfb, advisor = "John J. Metzner", classification = "0544: Electrical engineering", dissertation-thesis-number = "9127305", subject = "Electrical engineering", }.] @PhdThesis{Chakreyavanich:1989:RGD, author = "Udomsak Chakreyavanich", title = "Regular Grid {DEM} Data Compression By Using Zero-Crossing: the Automatic Breakline Detection Method", type = "{Ph.D.} thesis", school = "The Ohio State University", address = "Columbus, OH, USA", pages = "149", year = "1989", bibdate = "Fri Feb 1 09:20:32 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303812819", acknowledgement = ack-nhfb, advisor = "Anton F. Schenk", classification = "0370: Earth", dissertation-thesis-number = "9105809", subject = "Earth", }6 @PhdThesis{Cespedes:1991:ACM, author = "Ernesto Raul Cespedes", title = "Adaptive compression of multisensor image data", type = "{Ph.D.} thesis", school = "Mississippi State University", address = "Mississippi State, MS 39762, USA", pages = "204", year = "1991", bibdate = "Fri Feb 1 08:42:55 MST 2013", bibsource = "http://search.proquest.com/; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://search.proquest.com/docview/303923204", acknowledgement = ack-nhfb, advisor = "John K. Owens", classification = "0544: Electrical engineering", dissertation-thesis-number = "9218185", subject = "Electrical engineering", }o_ @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", } |44 P @Article{Boyd:1991:ESD, author = "Colin Boyd", title = "Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects", journal = j-LECT-NOTES-COMP-SCI, volume = "547", pages = "266--??", year = "1991", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Mon Feb 4 12:02:05 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t0547.htm; http://www.math.utah.edu/pub/tex/bib/datacompression.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/0547/05470266.htm; http://link.springer-ny.com/link/service/series/0558/papers/0547/05470266.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } | K @A->} @Article{Baron:2005:ASS, author = "D. Baron and Y. Bresler", title = "Antisequential suffix sorting for {BWT}-based data compression", journal = j-IEEE-TRANS-COMPUT, volume = "54", number = "4", pages = "385--397", month = apr, year = "2005", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2005.56", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Jul 4 16:17:16 MDT 2011", bibsource = "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=1401858", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", },zu @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", }/7"E @Article{Chang:1993:NLA, author = "HP @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", DOI = "https://doi.org/10.1145/256163.256166", ISSN = "1046-8188", ISSN-L = "0734-2047", bnsT) @Article{Cate:1991:CCCa, author = "Vincent Cate and Thomas Gross", title = "Combining the concepts of compression and caching for a two-level filesystem", journal = j-OPER-SYS-REV, volume = "25", number = "3S", pages = "200--211", month = apr, year = "1991", CODEN = "OSRED8", DOI = "https://doi.org/10.1145/106974.106993", ISSN = "0163-5980 (print), 1943-586X (electronic)", ISSN-L = "0163-5980", bibdate = "Sat Aug 26 15:24:15 MDT 2006", bibsource = "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", } | '[5m @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 'BM @Article{Kaplan:2007:SAB, author = "Haim Kaplanj @Article{DeVore:1992:ICT, author = "iS @Article{Fowell:1989:FPF, author = "Richard A. Fowell and David D. McNeil", title = "Faster Plots by Fan Data-Compression", journal = j-IEEE-CGA, volume = "9", number = "2", pages = "58--66", month = mar, year = "1989", CODEN = "ICGADZ", DOI = "https://doi.org/10.1109/38.19052", ISSN = "0272-1716 (print), 1558-1756 (electronic)", ISSN-L = "0272-1716", bibdate = "Sat JaOaC @Article{Eng:1981:SPB, author = "K. Y. Eng and O. C. Yue", title = "Spectral Properties and Band-Limiting Effects of Time-Compressed {TV} Signals in a Time-Compression Multiplexing System", journal = j-BELL-SYST-TECH-J, volume = "60", number = "9", pages = "2167--2185", month = nov, year = "1981", CODEN = "BSTJAN", DOI = "https://doi.org/10.1002/j.1538-7305.19نsg @Article{Galli:2001:THO, author = "N. Galli and B. Seybold and K. Simon", title = "Tetris-Hashing or optimal table compression", journal = j-DISCRETE-APPL-MATH, volume = "1102e @Article{Franz:1997:ACS, author = "M. Franz", title = "Adaptive Compression of Syntax Trees and Iterative Dynamic Code Optimization: Two Basic Technologies for Mobile Object Systems", journal = j-LECT-NOTES-COMP-SCI, volume = "1222", pages = "263--??", year = "1997", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Fri Aug 22 11:59:49 MDT 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", }j @Article{DeVore:1992:ICT, author = "R. DeVore and others", title = "Image Compression Through Wavelet Transform Coding", journal = j-IEEE-TRANS-INF-THEORY, volume = "38", number = "2", pages = "719--746", month = mar, year = "1992", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/18.119733", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, fjournal = "IEEE Transactions on Information Theory", rawdata = "DeVore, R., et al. (1992) ``Image Compression Through Wavelet Transform Coding,'' {\it IEEE Transactions on Information Theory}, {\bf38}(2):719--746, March.", } jU @Article{Cottingham:1985:CDS, author = "Marion S. Cottingham", title = "A Compressed Data Structure for Surface Representation", journal = j-CGF, volume = "4", number = "3", pages = "217--228", month = sep, year = "1985", CODEN = "CGFODY", DOI = "https://doi.org/10.1111/j.1467-8659.1985.tb00222.x", ISSN = "0167-7055 (print), 1467-8659 (electronic)", ISSN-L = oGY 31+}9![57C};_+}articledatacompression.bibBassiouni:1985:DCSM. A. BassiouniData Compression in Scientific and Statistical Databasesj-IEEE-TRANS-SOFTW-ENGSE-11101047--1058oct101985IESEDJhttps://doi.org/10.1109/TSE.1985.2318520098-5589 (print), 1939-3520 (electronic) OR 00985589 (print), 19393520 (electronic)0098-5589 OR 00985589Thu Feb 1 08:07:37 MST 2018http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib2018.02.01 08:07:37 MSThttp://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1701920IEEE Transactions on Software Engineeringack-nhfbhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32M. A. BassiouniData Compression in Scientific and Statistical Databases @Article{Bassiouni:1985:DCS, author = "M. A. Bassiouni", title = "Data Compression in Scientific and Statistical Databases", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "SE-11", number = "10", pages = "1047--1058", month = oct, year = "1985", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/TSE.1985.231852", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Thu Feb 1 08:07:37 MST 2018", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib; http://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1701920", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", }0FX 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/dxEY 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, } "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}.", } x'JY'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.", }IY 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)", }oHU3+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.", } ~" 3 @Article{Benoit:2009:MCS, author = "Anne Benoit and Harald Kosch and Veronika Rehn-Sonigo and Yves Robert", title = "Multi-Criteria Scheduling of Pipeline Workflows (and Application To the {JPEG} Encoder)", journal = j-IJHPCA, volume = "23", number = "2", pages = "171--187", month = may, year = "2009", CODEN = "IHPCFL", DOI = "https://doi.org/10.1177/109434200 ~} @Article{Berger:1990:OEB, author = "T. Berger and R. Yeung", title = "Optimum `1'-Ended Binary Prefix Codes", journal = j-IEEE-TRANS-INF-THEORY, volume = "36", number = "6", pages = "1435--1441", month = nov, year = "1990", CODEN = "IETTAW", DOI = "https://doi.org/10.1109/18.59940", ISSN = "0018-9448 (print), 1557-9654 (electronic)", ISSN-L = "0018-9448", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds, fjournal = "IEEE Transactions on Information Theory", rawdata = "Berger, T. and R. Yeung (1990) ``Optimum `1'-Ended Binary Prefix Codes,'' {\it IEEE Transactions on Information Theory}, {\bf36}(6):1435--1441, November.", }R3g @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", }X A @Article{Bergadano:1998:HDC, author = "Francesco Bergadano and Bruno Crispo and Giancarlo Ruffo", title = "High dictionary compression for proactive password checking", journal = j-TISSEC, volume = "1", number = "1", pages = "3--25", month = nov, year = "1998", CODEN = "ATISBQ", DOI = "https://doi.org/10.1145/290163.290164", ISSN = "1094-9224 (print)/_ @Article{Bentley:1986:LAD, author = "Jon Louis Bentley and Daniel D. Sleator and Robert E. Tarjan and Victor K. Wei", title = "A Locally Adaptive Data Compression Scheme", journal = j-CACM, volume = "29", number = "4", pages = "320--330", month = apr, year = "1986", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/5684.5688", ISSN = "0001-0782 (print), 1557-7317 (ele%7 @Article{Bentley:1976:AOA, author = "J. L. Bentley and A. Chi-Chih Yao", title = "An Almost Optimal Algorithm for Unbounded Searching", journal = j-INFO-PROC-LETT, volume = "5", number = "3", pages = "82--87", day = "??", month = aug, year = "1976", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(76)90071-5", ISSN = "0020-0190 (print), 1872-6119 (electronic)", o q qL[ 3-/W!W57E;?+!Ec/Waarticledatacompression.bibCormack:1985:DCDGordon V. CormackData compression on a database systemj-CACM28121336--1342dec121985CACMA2https://doi.org/10.1145/214956.2149630001-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/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://www.acm.org/pubs/toc/; http://www.math.utah.edu/pub/tex/bib/cacm1980.bib; http://www.math.utah.edu/pub/tex/bib/datacompression.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", DOI = "https://doi.org/10.1145/214956.214963", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu May 30 09:41:10 MDT 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://www.acm.org/pubs/toc/; 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.", }KU 3'![3_77E};g!_1articledatacompression.bibCole:1985:NPPA. J. ColeA Note on Peano Polygons and Gray Codesj-INT-J-COMPUT-MATH183--131985IJCMAThttps://doi.org/10.1080/002071685088034750020-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", DOI = "https://doi.org/10.1080/00207168508803475", 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.", }10 MDT 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://www.acm.org/pubs/toc/; 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.", }