"A computational complexity measure for trellis modules of convolutional codes."

Isaac Benchimol et al. (2013)

> Home

Details and statistics

DOI: 10.1109/TSP.2013.6613908

access: closed

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/tsp/BenchimolPSF13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tsp/BenchimolPSF13
Isaac Benchimol, Cecilio Pimentel, Richard Demo Souza, Bartolomeu F. Uchôa Filho:
A computational complexity measure for trellis modules of convolutional codes. TSP 2013: 144-148

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.