Bernardo Gabriel Rodrigues

According to our database1, Bernardo Gabriel Rodrigues authored at least 34 papers between 2004 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
On the classification of binary self-dual codes admitting imprimitive rank 3 permutation groups.
Appl. Algebra Eng. Commun. Comput., 2021

LCD codes from weighing matrices.
Appl. Algebra Eng. Commun. Comput., 2021

2020
Designs from maximal subgroups and conjugacy classes of Ree groups.
Adv. Math. Commun., 2020

2019
Special LCD Codes from Peisert and Generalized Peisert Graphs.
Graphs Comb., 2019

Upper bounds on the average eccentricity of K3-free and C4-free graphs.
Discret. Appl. Math., 2019

On primitive geometries of rank two.
Art Discret. Appl. Math., 2019

2018
A Projective Two-Weight Code Related to the Simple Group Co 1 of Conway.
Graphs Comb., 2018

Switched graphs of some strongly regular graphs related to the symplectic graph.
Des. Codes Cryptogr., 2018

On self-orthogonal designs and codes related to Held's simple group.
Adv. Math. Commun., 2018

LCD codes from adjacency matrices of graphs.
Appl. Algebra Eng. Commun. Comput., 2018

2017
Binary Codes and Partial Permutation Decoding Sets from Biadjacency Matrices of the Bipartite Graphs Γ ( 2 k + 1 , k , k + 2 , 1 ).
Graphs Comb., 2017

Quasi-symmetric 2-(64, 24, 46) designs derived from AG(3, 4).
Discret. Math., 2017

2016
Self-orthogonal codes from the strongly regular graphs on up to 40 vertices.
Adv. Math. Commun., 2016

2014
On Quasi-symmetric 2-(64, 24, 46) Designs Derived from Codes.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

2013
Binary codes of some strongly regular subgraphs of the McLaughlin graph.
Des. Codes Cryptogr., 2013

Codes from incidence matrices of graphs.
Des. Codes Cryptogr., 2013

A Characterization of Graphs by Codes from their Incidence Matrices.
Electron. J. Comb., 2013

Self-orthogonal codes from orbit matrices of 2-designs.
Adv. Math. Commun., 2013

2012
Automorphism group and diameter of a graph.
J. Graph Theory, 2012

Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs.
Discret. Math., 2012

Some ternary codes invariant under the group M<sup>c</sup>L: 2.
Ars Comb., 2012

2011
Designs, strongly regular graphs and codes constructed from some primitive groups.
Proceedings of the Information Security, Coding Theory and Related Combinatorics, 2011

Some optimal codes related to graphs invariant under the alternating group A<sub>8</sub>.
Adv. Math. Commun., 2011

2010
Codes associated with triangular graphs and permutation decoding.
Int. J. Inf. Coding Theory, 2010

Codes from lattice and related graphs, and permutation decoding.
Discret. Appl. Math., 2010

2009
Ternary codes from graphs on triples.
Discret. Math., 2009

A self-orthogonal doubly-even code invariant under M<sup>c</sup>L.
Ars Comb., 2009

2008
Self-orthogonal designs and codes from the symplectic groups S<sub>4</sub>(3) and S<sub>4</sub>(4).
Discret. Math., 2008

2007
On the dual binary codes of the triangular graphs.
Eur. J. Comb., 2007

On the stabilizers of the minimum-weight codewords of the binary codes from triangular graphs.
Ars Comb., 2007

2006
Binary codes from graphs on triples and permutation decoding.
Ars Comb., 2006

2005
A self-orthogonal doubly even code invariant under <i>M<sup>c</sup>L</i>: 2.
J. Comb. Theory, Ser. A, 2005

2004
Permutation decoding for the binary codes from triangular graphs.
Eur. J. Comb., 2004

Binary codes from graphs on triples.
Discret. Math., 2004


  Loading...