Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"How fast can dense codes achieve the min-cut capacity of line networks?"

Anoosheh Heidarzadeh, Amir H. Banihashemi (2012)

> Home

Details and statistics

DOI: 10.1109/ISIT.2012.6283958

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/HeidarzadehB12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/HeidarzadehB12
Anoosheh Heidarzadeh, Amir H. Banihashemi:
How fast can dense codes achieve the min-cut capacity of line networks? ISIT 2012: 2461-2465

a service of

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.