1 – 10 of 17
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2012
-
Mark
A Closed Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes
(
- Contribution to journal › Article
-
Mark
Dual convolutional codes and the MacWilliams identities
(
- Contribution to journal › Article
-
Mark
Searching for voltage graph-based LDPC tailbiting codes with large girth
(
- Contribution to journal › Article
-
Mark
A Greedy Search for Improved QC LDPC Codes with Good Girth Profile and Degree Distribution
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
High-Rate QC LDPC Codes of Short and Moderate Length with Good Girth Profile
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2011
-
Mark
Woven convolutional graph codes with large free distances
(
- Contribution to journal › Article
-
Mark
Double-Hamming based QC LDPC codes with large minimum distance
2011) IEEE International Symposium on Information Theory, 2011(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Another look at the exact bit error probability for Viterbi decoding of convolutional codes
2011) International Mathematical Conference '50 Years Of IPPI'(
- Contribution to conference › Paper, not in proceeding
-
Mark
Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth
2011) IEEE International Symposium on Information Theory, 2011(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
LDPC codes with large girth based on voltage graphs
2011)(
- Contribution to conference › Paper, not in proceeding