Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 223,670,438 papers from all fields of science
Search
Sign In
Create Free Account
Sequential decoding
Known as:
Fano algorithm
, Fano metric
, Sequential decoder
Sequential decoding is a limited memory technique for decoding tree codes. Sequential decoding is mainly used is as an approximate decoding algorithm…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Binary symmetric channel
Code rate
Convolutional code
Hamming distance
Expand
Broader (1)
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Queuing Analysis and Simulation of Wireless Access and End Point Systems using Fano Decoding
Khalid A. Darabkh
Journal of Communications
2010
Corpus ID: 18361467
Wireless networks are a growing technology due to its ability to receive data in areas where it is very hard to plug-in using…
Expand
2004
2004
Bi-directional soft-output M-algorithm for iterative decoding
Kitty K. Y. Wong
,
P. McLane
IEEE International Conference on Communications
2004
Corpus ID: 6189268
A method to produce soft-outputs is proposed for the M-algorithm. The soft-output M-algorithm (SOMA) reduces the complexity of…
Expand
2004
2004
A scalable architecture for LDPC decoding
M. Cocco
,
J. Dielissen
,
M. Heijligers
,
A. Hekstra
,
J. Huisken
Proceedings Design, Automation and Test in Europe…
2004
Corpus ID: 17396100
Low density parity check (LDPC) codes offer excellent error correcting performance. However, current implementations are not…
Expand
1987
1987
Sequential Decoding with ARQ and Code Combining
S. Kallel
,
D. Haccoun
IEEE Military Communications Conference
1987
Corpus ID: 25017847
In this paper we consider sequential decoding with ARQ and code combining under the time-out condition. That is whenever the…
Expand
Highly Cited
1983
Highly Cited
1983
Hybrid ARQ error control using sequential decoding
A. Drukarev
,
D. Costello
IEEE Transactions on Information Theory
1983
Corpus ID: 27397853
An important feature of ARQ sequential decoding is that a very low undetected error probability can be achieved without…
Expand
Highly Cited
1978
Highly Cited
1978
Syndrome decoding of binary-rate k/n convolutional codes
J. Schalkwijk
,
A. Vinck
,
K. A. Post
IEEE Transactions on Information Theory
1978
Corpus ID: 206733517
A state-space approach to the syndrome decoding of binary rate k/n convolutional codes is described. State-space symmetries of a…
Expand
Highly Cited
1975
Highly Cited
1975
Generalized stack algorithms for decoding convolutional codes
D. Haccoun
,
M. Ferguson
IEEE Transactions on Information Theory
1975
Corpus ID: 28534623
A new class of generalized stack algorithms for decoding convolutional codes is presented. It is based on the Zigangirov-Jelinek…
Expand
Highly Cited
1971
Highly Cited
1971
Rate 1/2 convolutional codes with complementary generators
L. Bahl
,
F. Jelinek
IEEE Transactions on Information Theory
1971
Corpus ID: 20710809
The structure of a class of rate \frac{1}{2} convolutional codes called complementary codes is investigated. Of special interest…
Expand
1966
1966
The Performance of Sequential Decoding in Conjunction with Efficient Modulation
Jr. K.L. Jordan
1966
Corpus ID: 62409278
The design of a communications system consisting of a sequential encoder-decoder, working in conjunction with a modulation…
Expand
1966
1966
The distribution of the sequential decoding computation time
J. Savage
IEEE Transactions on Information Theory
1966
Corpus ID: 31641037
Previous studies of sequential decoding algorithms have shown that the computation time required per decoded digit is small, on…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE