Conference paper · 2010
Study on information entropy of combinatorics coding
International Conference on Computer Design and Applications (ICCDA), 5, V1-105–V1-108 · Published 1 June 2010 · DOI 10.1109/iccda.2010.5541100
In brief
“Study on information entropy of combinatorics coding” is a 2010 conference paper by Jun Lu and Daxin Liu, published in International Conference on Computer Design and Applications (ICCDA). OpenAlex counts 3 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 3
- Most cited in
- 2013 (2)
- Field-weighted impact
- 0.45
- References
- 11
- Authors
- 2
Abstract
Ideas of combinatorics coding and decoding are expatiated in this paper. It predicates that if only repetition exists,redundancy is inevitable. The relation between ordinal space and sequence space is studied. It opens out the characteristic that ordinal space is smaller than sequence space. By making use of this characteristic, combinatorics coding can be used to… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Lu, J., & Liu, D. (2010). Study on information entropy of combinatorics coding. International Conference on Computer Design and Applications (ICCDA), 5, V1-105–V1-108. https://doi.org/10.1109/iccda.2010.5541100
MLA 9
Lu, Jun, and Daxin Liu. “Study on information entropy of combinatorics coding.” International Conference on Computer Design and Applications (ICCDA), vol. 5, 2010, pp. V1-105–V1-108. https://doi.org/10.1109/iccda.2010.5541100.
Chicago
Lu, Jun and Daxin Liu. 2010. “Study on information entropy of combinatorics coding.” International Conference on Computer Design and Applications (ICCDA) 5: V1-105–V1-108. https://doi.org/10.1109/iccda.2010.5541100.
Harvard
Lu, J. and Liu, D. (2010) ‘Study on information entropy of combinatorics coding’, International Conference on Computer Design and Applications (ICCDA), 5, pp. V1-105–V1-108. doi:10.1109/iccda.2010.5541100.
IEEE
J. Lu and D. Liu, “Study on information entropy of combinatorics coding,” International Conference on Computer Design and Applications (ICCDA), vol. 5, pp. V1-105–V1-108, 2010, doi: 10.1109/iccda.2010.5541100.
BibTeX
@inproceedings{lu2010study,
title = {{Study on information entropy of combinatorics coding}},
author = {Lu, Jun and Liu, Daxin},
booktitle = {International Conference on Computer Design and Applications (ICCDA)},
year = {2010},
volume = {5},
pages = {V1-105--V1-108},
doi = {10.1109/iccda.2010.5541100},
url = {https://doi.org/10.1109/iccda.2010.5541100}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Shannon entropy
- universal coding
- data compression
- redundancy
- ordinal spaces
- sequence spaces
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Lu, J., & Liu, D. (2010). Study on information entropy of combinatorics coding. International Conference on Computer Design and Applications (ICCDA), 5, V1-105–V1-108. https://doi.org/10.1109/iccda.2010.5541100
How many times has this paper been cited?
3 times, according to OpenAlex on 15 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Jun Lu, Daxin Liu.
What is the DOI of this paper?
10.1109/iccda.2010.5541100. The permanent link is https://doi.org/10.1109/iccda.2010.5541100.
Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.