"Code bounds for multiple packings over a nonbinary finite alphabet."

Vladimir M. Blinovsky (2005)

> Home

Details and statistics

DOI: 10.1007/S11122-005-0007-5

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/poit/Blinovsky05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/poit/Blinovsky05
Vladimir M. Blinovsky:
Code bounds for multiple packings over a nonbinary finite alphabet. Probl. Inf. Transm. 41(1): 23-32 (2005)

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.