共 50 条
- [42] Compressing Multisets With Large Alphabets IEEE Journal on Selected Areas in Information Theory, 2022, 3 (04): : 605 - 615
- [43] Minimax Redundancy for Large Alphabets 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 1488 - 1492
- [44] On the repetition threshold for large alphabets MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 226 - 237
- [46] Compressing Multisets with Large Alphabets DCC 2022: 2022 DATA COMPRESSION CONFERENCE (DCC), 2022, : 322 - 331
- [47] Relative redundancy for large alphabets 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 2672 - +
- [48] Localisation-Resistant Random Words with Small Alphabets COMBINATORICS ON WORDS, WORDS 2019, 2019, 11682 : 193 - 206
- [50] Universal Compression of Memoryless Sources over Large Alphabets via Independent Component Analysis 2015 DATA COMPRESSION CONFERENCE (DCC), 2015, : 213 - 222