Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

L. Enrique Aguado

dblp:143/3315 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › convolutional codes › convolutional code decoding
bidirectional decoding
0.011998
On Hybrid Stack Decoding Algorithms for Block Codes · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes
block codes
0.011998
On Hybrid Stack Decoding Algorithms for Block Codes · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › decoding
sequential decoding
0.011998
On Hybrid Stack Decoding Algorithms for Block Codes · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › decoding
soft-decision decoding
0.011998
On Hybrid Stack Decoding Algorithms for Block Codes · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › decoding
trellis decoding
0.011998
On Hybrid Stack Decoding Algorithms for Block Codes · IEEE Trans. Inf. Theory 1998

Methods — techniques the papers use, named apart from their topics

stack algorithm · 0.0
YearPublicationVenuePosition
2000 Performance evaluation of mixing real-time and non-real-time services in UTRA
abstract
An investigation on mixing real-time and non-real-time services in UTRA is presented. The main objective of this work is to observe and understand how service characteristics of bit-rate, mean connection duration, required E/sub b//I/sub 0/ and delay tolerance, influence the performance of radio resource management (RRM) in supporting mixed real-time and non-real-time services.
Peter Omiyi, L. Enrique Aguado, Timothy O'Farrell, Jon W. Harris, Richard Townend
PIMRC2
1998 On Hybrid Stack Decoding Algorithms for Block Codes
abstract
This correspondence presents sequential algorithms for soft decision decoding of linear block codes. They use a stack algorithm based on the trellis of the code. We are interested in the trellis as a means to avoid path-decoding repetitions. As well, the possibility of bidirectional decoding offers a chance to increase the likelihood of explored paths. We have developed three successive algorithms that offer a good decrement in the overall complexity, and mainly in the most complex decoding case, while giving near-maximum-likelihood performance. This is important since it determines the maximum buffer size necessary in the decoder.
L. Enrique Aguado, Patrick Guy Farrell
IEEE Trans. Inf. Theory1