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.

Raul Antonio Ferraz

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

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

Theory of computation · 2 · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › algebraic coding theory
abelian codes
0.212014
$G$ -Equivalence in Group Algebras and Minimal Abelian Codes · IEEE Trans. Inf. Theory 2014
Coding theory › error-correcting codes
algebraic coding theory
0.212014
$G$ -Equivalence in Group Algebras and Minimal Abelian Codes · IEEE Trans. Inf. Theory 2014
Coding theory › error-correcting codes › block codes › group codes
group algebra code
0.112014
$G$ -Equivalence in Group Algebras and Minimal Abelian Codes · IEEE Trans. Inf. Theory 2014

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

group algebra · 0.2automorphism of finite abelian group · 0.2
YearPublicationVenuePosition
2014 $G$ -Equivalence in Group Algebras and Minimal Abelian Codes
abstract
Let $G$ be a finite Abelian group and $ {\BBF }$ a field such that $ \mathop {\rm char}({\BBF }) $ does not divide $ \vert G\vert $ . Denote by $ {\BBF } G$ the group algebra of $G$ over $ {\BBF }$ . A (semisimple) Abelian code is an ideal of $ {\BBF } G$ . Two codes ${\cal I}_{1}$ and ${\cal I}_{2}$ of $ {\BBF } G$ are $G$ -equivalent if there exists an automorphism $\psi $ of $G$ whose linear extension to $ {\BBF } G$ maps ${\cal I}_{1}$ onto ${\cal I}_{2}$ . In this paper, we give a necessary and sufficient condition for minimal Abelian codes to be $G$ -equivalent and show how to correct some results in the literature.
Raul Antonio Ferraz, Marinês Guerreiro, César Polcino Milies
IEEE Trans. Inf. Theory1
2011 Minimal codes in binary abelian group algebras
abstract
We give counterexamples to show that some results regarding equivalence of abelian group codes, that have been in the literature for quite some time, are not correct. Also, we give examples of special families of abelian groups for which these results do hold.
Marinês Guerreiro, Raul Antonio Ferraz, César Polcino Milies
ITW2