PROBABILISTIC ALGORITHM FOR LIST VITERBI DECODING by Janani Kalyanam

First Page		Document Content
Date: 2014-02-18 12:35:40 Error detection and correction Computing Convolutional code Viterbi algorithm Discrete mathematics Viterbi decoder Mathematics Forward error correction List decoding Andrew Viterbi Algorithm Turbo code		PROBABILISTIC ALGORITHM FOR LIST VITERBI DECODING by Janani Kalyanam Add to Reading List Source URL: acsweb.ucsd.edu Download Document from Source Website File Size: 533,73 KB Share Document on Facebook

	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 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 DocID: 1tax6 - View Document
	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 DocID: 1riYP - View Document