"On Upper Bounds for Code Distance and Covering Radius of Designs in ..."

G. Fazekas, Vladimir I. Levenshtein (1995)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2024-06-07

- no documents available
- export record
  dblp key:
  - journals/jct/FazekasL95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/FazekasL95
G. Fazekas, Vladimir I. Levenshtein:
On Upper Bounds for Code Distance and Covering Radius of Designs in Polynomial Metric Spaces. J. Comb. Theory A 70(2): 267-288 (1995)

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.