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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Mohammed El Oued

dblp:135/8913 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2013
—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 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
convolutional codes		 0.212013
MDS Convolutional Codes Over a Finite Ring · IEEE Trans. Inf. Theory 2013
Coding theory › algebraic structure
finite ring		 0.212013
MDS Convolutional Codes Over a Finite Ring · IEEE Trans. Inf. Theory 2013
Coding theory › error-correcting codes › block codes
MDS codes		 0.212013
MDS Convolutional Codes Over a Finite Ring · IEEE Trans. Inf. Theory 2013
Coding theory › error-correcting codes › convolutional codes › algebraic convolutional code
ring convolutional codes		 0.212013
MDS Convolutional Codes Over a Finite Ring · IEEE Trans. Inf. Theory 2013
Coding theory › error-correcting codes › coding bounds › minimum distance bounds
singleton bound		 0.212013
MDS Convolutional Codes Over a Finite Ring · IEEE Trans. Inf. Theory 2013

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

cyclic codes over finite rings · 0.2
YearPublicationVenuePosition
2013 MDS Convolutional Codes Over a Finite Ring
abstract
In this paper, we present an analog of the Singleton bound for convolutional codes over finite rings. Codes meeting that bound are called MDS. A constructive method for the MDS codes, restricted to free codes, is presented via cyclic codes over finite rings. Examples of nonfree MDS codes are provided.
Mohammed El Oued, Patrick Solé
 IEEE Trans. Inf. Theory1