"On Decoding Complexity of Reed-Solomon Codes on the Packet Erasure Channel."

Giuliano Garrammone (2013)

> Home

Details and statistics

DOI: 10.1109/LCOMM.2013.021913.122427

access: closed

type: Journal Article

metadata version: 2020-08-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/icl/Garrammone13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/icl/Garrammone13
Giuliano Garrammone:
On Decoding Complexity of Reed-Solomon Codes on the Packet Erasure Channel. IEEE Commun. Lett. 17(4): 773-776 (2013)

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.