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

Jareena Tharnnukhroh

dblp:242/9386 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0003-2854-5814ORCID · reported

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

Theory of computation · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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 · 75% Graph algorithms and graph theory · 25%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › spectral graph theory
eigenvalue bounds
0.512021
A Comparison of Distance Bounds for Quasi-Twisted Codes · IEEE Trans. Inf. Theory 2021
Coding theory › error-correcting codes › coding bounds
minimum distance bounds
0.512021
A Comparison of Distance Bounds for Quasi-Twisted Codes · IEEE Trans. Inf. Theory 2021
Coding theory › error-correcting codes › block codes › linear code
quasi-twisted codes
0.512021
A Comparison of Distance Bounds for Quasi-Twisted Codes · IEEE Trans. Inf. Theory 2021
Coding theory › error-correcting codes › coding bounds
spectral bounds
0.512021
A Comparison of Distance Bounds for Quasi-Twisted Codes · IEEE Trans. Inf. Theory 2021

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

polynomial matrix · 0.5concatenated codes · 0.5
YearPublicationVenuePosition
2021 A Comparison of Distance Bounds for Quasi-Twisted Codes
abstract
Spectral bounds on the minimum distance of quasi-twisted codes over finite fields are proposed, based on eigenvalues of polynomial matrices and the corresponding eigenspaces. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a way similar to how the Roos and shift bounds extend the BCH and HT bounds for cyclic codes. The eigencodes of a quasi-twisted code in the spectral theory and the outer codes in its concatenated structure are related. A comparison based on this relation verifies that the Jensen bound always outperforms the spectral bound under special conditions, which yields a similar relation between the Lally and the spectral bounds. The performances of the Lally, Jensen and spectral bounds are presented in comparison with each other.
Martianus Frederic Ezerman, John Mark Lampos, San Ling, Buket Özkaya, Jareena Tharnnukhroh
IEEE Trans. Inf. Theory5
2019 Spectral Bounds for Quasi-Twisted Codes
abstract
New lower bounds on the minimum distance of quasi-twisted codes over finite fields are proposed. They are based on spectral analysis and eigenvalues of polynomial matrices. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a manner similar to how the Roos and shift bounds extend the BCH and HT bounds for cyclic codes.
Martianus Frederic Ezerman, San Ling, Buket Özkaya, Jareena Tharnnukhroh
ISIT4