"A branch and cut algorithm for finding the minimum distance of a linear ..."

Ahmet B. Keha, Tolga M. Duman (2008)

> Home

Details and statistics

DOI: 10.1109/ISIT.2008.4594976

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isit/KehaD08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/KehaD08
Ahmet B. Keha, Tolga M. Duman:
A branch and cut algorithm for finding the minimum distance of a linear block code. ISIT 2008: 201-205

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.