<--- Back to Details
First PageDocument Content
Error detection and correction / Coding theory / Discrete mathematics / Information / Computing / Turbo code / Serial concatenated convolutional codes / Convolutional code / Concatenated error correction code / Puncturing / Encoder / Systematic code
Date: 2007-11-30 00:15:17
Error detection and correction
Coding theory
Discrete mathematics
Information
Computing
Turbo code
Serial concatenated convolutional codes
Convolutional code
Concatenated error correction code
Puncturing
Encoder
Systematic code

Super Codes: A Flexible Multi–Rate Coding System Steven S. Pietrobon Small World Communications, 6 First Avenue, Payneham South SA 5070, Australia. E–mail: Abstract: We define super codes as the

Add to Reading List

Source URL: www.sworld.com.au

Download Document from Source Website

File Size: 125,54 KB

Share Document on Facebook

Similar Documents

Code available  Local Binary Convolutional Neural Networks Felix Juefei Xu 1, Vishnu Naresh Boddeti 2, Marios Savvides 1  IEEE 2017 Conference on

Code available Local Binary Convolutional Neural Networks Felix Juefei Xu 1, Vishnu Naresh Boddeti 2, Marios Savvides 1 IEEE 2017 Conference on

DocID: 1tCaD - View Document

UNIT MEMORY CONVOLUTIONAL CODES WITH MAXIMUM DISTANCE ROXANA SMARANDACHE∗ Abstract. Unit memory codes and in particular, partial unit memory codes are reviewed. Conditions for the optimality of partial unit memory code

UNIT MEMORY CONVOLUTIONAL CODES WITH MAXIMUM DISTANCE ROXANA SMARANDACHE∗ Abstract. Unit memory codes and in particular, partial unit memory codes are reviewed. Conditions for the optimality of partial unit memory code

DocID: 1tgya - View Document

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 5, JULYring [D], with rank G(D) = k . For the purpose of this correspondence, we define the rate k=n convolutional code generated by G(D) as the set  Construct

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 5, JULYring [D], with rank G(D) = k . For the purpose of this correspondence, we define the rate k=n convolutional code generated by G(D) as the set Construct

DocID: 1tax6 - View Document

PROBABILISTIC ALGORITHM FOR LIST VITERBI DECODING by Janani Kalyanam

PROBABILISTIC ALGORITHM FOR LIST VITERBI DECODING by Janani Kalyanam

DocID: 1rlYO - View Document

INTERSECTED LOW-DENSITY PARITY-CHECK AND CONVOLUTIONAL CODES Edward A. Ratzer Cavendish Laboratory, University of Cambridge, Cambridge Key words to describe this work: Low-density parity-check (LDPC) codes, convolutional

INTERSECTED LOW-DENSITY PARITY-CHECK AND CONVOLUTIONAL CODES Edward A. Ratzer Cavendish Laboratory, University of Cambridge, Cambridge Key words to describe this work: Low-density parity-check (LDPC) codes, convolutional

DocID: 1riYP - View Document