Selected Topics in Information and Coding Theory Series on Coding Theory and Cryptology British Library Cataloguing-in-publication Data Selected Topics in Information and Coding Theory Series on Coding Theory and Cryptology — Vol. 7 Organization and Features
暂无分享,去创建一个
H. Niederreiter | B. S. Rajan | I. Woungang | Michael Huber | P. Hurley | S. Chandra | T. Hurley | Kimberly B. Chua | M. Chin | M. M. Kian | Misra Kanpur | M. Sadeghi | G. Rajan | B. Rajan
[1] Brian Parker Tunstall,et al. Synthesis of noiseless compression codes , 1967 .
[2] Claire Mathieu,et al. SC-2 00 202 Huffman Coding with Unequal Letter Costs [ Extended Abstract ] , 2002 .
[3] S. Golomb. Run-length encodings. , 1966 .
[4] Jukka Teuhola,et al. A Compression Method for Clustered Bit-Vectors , 1978, Inf. Process. Lett..
[5] T. C. Hu,et al. Optimal alphabetic trees for binary search , 1998 .
[6] J. Désarménien. La division par ordinateur des mots français: application à TEX , 1986 .
[7] Ben Varn,et al. Optimal Variable Length Codes (Arbitrary Symbol Cost and Equal Code Word Probability) , 1971, Inf. Control..
[8] E. F. Moore,et al. Variable-length binary encodings , 1959 .
[9] Ronald L. Rivest,et al. Complete variable-length “fix-free” codes , 1995, Des. Codes Cryptogr..
[10] Brian H. Marcus,et al. Variable-length state splitting with applications to average runlength-constrained (ARC) codes , 1991, IEEE Trans. Inf. Theory.
[11] Riccardo Leonardi,et al. Non prefix-free codes for constrained sequences , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[12] Jeffrey H. Kingston. A New Proof of the Garsia-Wachs Algorithm , 1988, J. Algorithms.
[13] Robert J. McEliece,et al. The Theory of Information and Coding , 1979 .
[14] David C. van Voorhis,et al. Optimal source codes for geometrically distributed integer alphabets (Corresp.) , 1975, IEEE Trans. Inf. Theory.
[15] M. Wada,et al. Reversible variable length codes , 1995, IEEE Trans. Commun..
[16] J. Berstel,et al. Theory of codes , 1985 .
[17] Rudolf Ahlswede,et al. Some properties of fix-free codes , 1996 .
[18] Jean Berstel,et al. Rational series and their languages , 1988, EATCS monographs on theoretical computer science.
[19] Edgar N. Gilbert,et al. Synchronization of binary messages , 1960, IRE Trans. Inf. Theory.
[20] Brian H. Marcus,et al. Lossless sliding-block compression of constrained systems , 2000, IEEE Trans. Inf. Theory.
[21] Bernd Girod. Bidirectionally decodable streams of prefix code-words , 1999, IEEE Communications Letters.
[22] Christophe Reutenauer,et al. Ensembles libres de chemins dans un graphe , 1986 .
[23] On an application of semi groups methods to some problems in coding , 1956, IRE Trans. Inf. Theory.
[24] M. Lothaire. Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) , 2005 .
[25] Alon Itai,et al. Optimal Alphabetic Trees , 1976, SIAM J. Comput..
[26] Benjamin Weiss,et al. Equivalence of topological Markov shifts , 1977 .
[27] S. Yekhanin,et al. Improved upper bound for the redundancy of fix-free codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[28] Neri Merhav,et al. Optimal prefix codes for sources with two-sided geometric distributions , 2000, IEEE Trans. Inf. Theory.
[29] T. C. Hu,et al. Optimal Computer Search Trees and Variable-Length Alphabetical Codes , 1971 .
[30] Emmanuel Roche,et al. Finite-State Language Processing , 1997 .
[31] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .
[32] Peter W. Shor,et al. A Counterexample to the Triangle Conjecture , 1985, J. Comb. Theory, Ser. A.
[33] Josef Kittler,et al. Combinatorial Algorithms , 2016, Lecture Notes in Computer Science.
[34] Raymond W. Yeung,et al. Some basic properties of fix-free codes , 2001, IEEE Trans. Inf. Theory.
[35] Gaspard Monge,et al. Extensions of the Method of Poles for Code Construction , 1994 .
[36] Schouhamer Immink,et al. Codes for mass data storage systems , 2004 .
[37] Adriano M. Garsia,et al. A New Algorithm for Minimum Cost Binary Trees , 1977, SIAM J. Comput..
[38] Dominique Perrin,et al. Codes and Automata , 2009, Encyclopedia of mathematics and its applications.
[39] Antonio Restivo. Codes and Local Constraints , 1990, Theor. Comput. Sci..
[40] Peter Elias,et al. Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.
[41] Güney Gönenç. Unique decipherability of codes with constraints with application to syllabification of Turkish words , 1973, COLING 1973.
[42] Donald E. Knuth,et al. The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .
[43] Christian Deppe,et al. On q-ary fix-free codes and directed deBrujin graphs , 2006, 2006 IEEE International Symposium on Information Theory.
[44] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[45] Kees A. Schouhamer Immink. A practical method for approaching the channel capacity of constrained channels , 1997, IEEE Trans. Inf. Theory.
[46] Brian H. Marcus,et al. State splitting for variable-length graphs , 1986, IEEE Trans. Inf. Theory.
[47] Edgar N. Gilbert,et al. Coding with digits of unequal cost , 1995, IEEE Trans. Inf. Theory.
[48] John D. Villasenor,et al. Reversible variable length codes for efficient and robust image and video coding , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).
[49] Robert F. Rice,et al. Some practical universal noiseless coding techniques , 1979 .
[50] A. N. Trahtman,et al. The road coloring problem , 2007, 0709.0099.
[51] Richard M. Karp,et al. Minimum-redundancy coding for the discrete noiseless channel , 1961, IRE Trans. Inf. Theory.
[52] Michel Latteux,et al. Variable-Length Maximal Codes , 1996, ICALP.
[53] Anastasis A. Sofokleous,et al. Review: H.264 and MPEG-4 Video Compression: Video Coding for Next-generation Multimedia , 2005, Comput. J..
[54] M. Schützenberger. On a special class of recurrent events , 1961 .
[55] Leo J. Guibas,et al. Maximal Prefix-Synchronized Codes , 1978 .
[56] David A. Huffman,et al. A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.
[57] Marie-Pierre Béal. The method of poles: A coding method for constrained channels , 1990, IEEE Trans. Inf. Theory.
[58] Jacques Sakarovitch,et al. Elements of Automata Theory , 2009 .
[59] Kurt Mehlhorn,et al. An efficient algorithm for constructing nearly optimal prefix codes , 1980, IEEE Trans. Inf. Theory.
[60] Dominique Perrin,et al. Codes, unambiguous automata and sofic systems , 2006, Theor. Comput. Sci..