"On the minimum distance of low-density parity-check codes with ..."

Arvind Sridharan et al. (2005)

> Home

Details and statistics

DOI: 10.1007/S11122-005-0008-4

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/poit/SridharanLTCZ05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/poit/SridharanLTCZ05
Arvind Sridharan, Michael Lentmaier, Dmitri V. Truhachev, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices. Probl. Inf. Transm. 41(1): 33-44 (2005)

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.