"Efficient methods for bounding the fractional distance of LDPC codes and ..."

David Burshtein, Idan Goldenberg (2011)

> Home

Details and statistics

DOI: 10.1109/ISIT.2011.6033739

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isit/BurshteinG11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/BurshteinG11
David Burshtein, Idan Goldenberg:
Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes. ISIT 2011: 1263-1267

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.