On an extension of Krivovichev's complexity measures

DOI10.1107/S2053273320006634MaRDI QIDQ6563684zbMATHWikidataFDO

Authors Wolfgang Hornfeck

Publication date 27 June 2024

Published in Acta Crystallographica. Section A (Search for Journal in Brave)

zbMATH Keywords

Shannon entropystructural complexitystrong additivitycrystal structure classificationKrivovichev complexity

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17) Communication complexity, information complexity (68Q11)

Recommendations

• On the combinatorics of crystal structures. II: Number of Wyckoff sequences of a given subdivision complexity
• On computation and analysis of entropy measures for crystal structures
• A simple method for the evaluation of the information content and complexity in atoms. A proposal for scalability
• Defining statistical relative complexity measure: application to diversity in atoms
• Measuring static complexity

Cites work

• A Mathematical Theory of Communication
• A characterization of entropy in terms of information loss
• Axiomatic characterizations of information measures
• International tables for crystallography. Vol. A. Space-group symmetry
• On measures of information and their characterizations
• On the complexity of graphs and molecules
• Quantitative crystal structure descriptors from multiplicative congruential generators
• Why the Shannon and Hartley entropies are ‘natural’

Cited in

(2)

• On the combinatorics of crystal structures. II: Number of Wyckoff sequences of a given subdivision complexity
• On computation and analysis of entropy measures for crystal structures

This page was built for publication: On an extension of Krivovichev's complexity measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563684)