Open Access
| Issue |
RAIRO-Oper. Res.
Volume 56, Number 3, May-June 2022
|
|
|---|---|---|
| Page(s) | 1823 - 1839 | |
| DOI | https://doi.org/10.1051/ro/2022066 | |
| Published online | 30 June 2022 | |
- L. Faria, F.S. Oliveira, P.E.D. Pinto and M.S. Sampaio Jr, On the minimum neighborhood of independent sets in the n-cube. Mat. Contemp. 44 (2016) 1–10. [MathSciNet] [Google Scholar]
- R.W. Hamming, Coding and Information Theory. Prentice-Hall (1986). [Google Scholar]
- D.A. Huffman, A method for the construction of minimum redundancy codes. Proc. IRE 40 (1951) 1098–1101. [Google Scholar]
- G.O.H. Katona, The Hamming sphere has minimum boundary. Stud. Sci. Math. Hung. 10 (1977) 131–140. [Google Scholar]
- D.E. Knuth. Art of Computer Programming. Vol. 1. Addison-Wesley (2005). [Google Scholar]
- J. Körner and V.K. Wei, Odd and even Hamming spheres also have minimum boundary. Discrete Math. 51 (1984) 147–165. [CrossRef] [MathSciNet] [Google Scholar]
- J. Körner and V.K. Wei, Addendum to “odd and even Hamming spheres also have minimum boundary”. Discrete Math. 62 (1986) 105–106. [CrossRef] [MathSciNet] [Google Scholar]
- J.B. Kruskal, The number of simplices in a complex. In Mathematical Optimization Techniques, edited by R. Bellman. University of California Press (1963) 251–278. [CrossRef] [Google Scholar]
- A. Pessoa, An approximation algorithm for constructing error detecting prefix codes. Optimization Online (2006). [Google Scholar]
- A. Pessoa, A note on the construction of error detecting/correcting prefix codes. Inf. Process. Lett. 107 (2008) 34–38. [CrossRef] [Google Scholar]
- P.E.D. Pinto, F. Protti and J.L. Szwarcfiter, A Huffman-based error detecting code. In: Proc. of the Experimental and Efficient Algorithms (WEA’2004). Lecture Notes in Computer Science 3059 (2004) 446–457. [CrossRef] [Google Scholar]
- P.E.D. Pinto, F. Protti and J.L. Szwarcfiter, Parity codes. RAIRO – Theor. Inf. Appl. 39 (2005) 263–278. [CrossRef] [EDP Sciences] [Google Scholar]
- P.E.D. Pinto, F. Protti and J.L. Szwarcfiter, Exact and experimental algorithms for a huffman-based error detecting code. Lect. Notes Comput. Sci. 5532 (2009) 311–324. [CrossRef] [Google Scholar]
- P.E.D. Pinto, F. Protti and J.L. Szwarcfiter, Exact and approximation algorithms for error-detecting even codes. Theor. Comput. Sci. 440,441 (2012) 60–72. [CrossRef] [Google Scholar]
- T. Wenisch, P.F. Swaszek and A.K. Uht, Combined error correction and compression codes. In: IEEE International Symposium on Information Theorys (2001) 238. [Google Scholar]
- G.K. Zipf, Human Behaviour and the Principle of Least Effort. Addison-Wesley, (1949). [Google Scholar]
- https://github.com/moysessj/restricted-hamming-huffman-trees.git (Accessed: May 17, 2022). [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.