"Optimal Prefix-Free Codes That End in a Specified Pattern and Similar ..."

Mordecai J. Golin, Hyeon-Suk Na (2001)

> Home

Details and statistics

DOI: 10.1109/DCC.2001.917145

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/dcc/GolinN01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcc/GolinN01
Mordecai J. Golin, Hyeon-Suk Na:
Optimal Prefix-Free Codes That End in a Specified Pattern and Similar Problems: The Uniform Probability Case. Data Compression Conference 2001: 143-152

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.