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

Ishay Be'ery

dblp:242/8106 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

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

Computer networks · 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 · 72% Algorithms and data structures · 28%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › learning algorithms
active learning
0.412020
Active Deep Decoding of Linear Codes · IEEE Trans. Commun. 2020
Coding theory › error-correcting codes › decoding › iterative decoding
belief propagation decoding
0.412020
Active Deep Decoding of Linear Codes · IEEE Trans. Commun. 2020
Coding theory › error-correcting codes › decoding › decoding algorithms
error correction decoding
0.412020
Active Deep Decoding of Linear Codes · IEEE Trans. Commun. 2020
Coding theory › error-correcting codes › cyclic codes
BCH codes
0.112020
Active Deep Decoding of Linear Codes · IEEE Trans. Commun. 2020
Coding theory › error-correcting codes › block codes
linear code
0.112020
Active Deep Decoding of Linear Codes · IEEE Trans. Commun. 2020

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

weighted belief propagation · 0.4deep learning · 0.4active learning · 0.4
YearPublicationVenuePosition
2020 Active Deep Decoding of Linear Codes
abstract
High quality data is essential in deep learning to train a robust model. While in other fields data is sparse and costly to collect, in error decoding it is free to query and label thus allowing potential data exploitation. Utilizing this fact and inspired by active learning, two novel methods are introduced to improve Weighted Belief Propagation (WBP) decoding. These methods incorporate machine-learning concepts with error decoding measures. For BCH(63,36), (63,45) and (127,64) codes, with cycle-reduced parity-check matrices, improvement of up to 0.4dB at the waterfall region, and of up to 1.5dB at the error-floor region in FER, over the original WBP, is demonstrated by smartly sampling the data, without increasing inference (decoding) complexity. The proposed methods constitutes an example guidelines for model enhancement by incorporation of domain knowledge from error-correcting field into a deep learning model. These guidelines can be adapted to any other deep learning based communication block.
Ishay Be'ery, Nir Raviv, Tomer Raviv, Yair Be'ery
IEEE Trans. Commun.1