"On a new q-ary combinatorial analog of the binary Grey-Rankin bound and ..."

Leonid A. Bassalygo et al. (2006)

> Home

Details and statistics

DOI: 10.1109/ITW.2006.1633829

access: closed

type: Conference or Workshop Paper

metadata version: 2019-02-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/itw/BassalygoDHZ06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itw/BassalygoDHZ06
Leonid A. Bassalygo, Stefan M. Dodunekov, Tor Helleseth, Victor A. Zinoviev:
On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound. ITW 2006: 278-282

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.