João Strapasson

Orcid: 0000-0001-9079-5860

According to our database1, João Strapasson authored at least 18 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Perfect codes in two-dimensional algebraic lattices.
Discret. Math., January, 2024

2021
Perfect codes in Euclidean lattices.
Comput. Appl. Math., 2021

2020
The Fisher-Rao Distance between Multivariate Normal Distributions: Special Cases, Boundsand Applications.
Entropy, 2020

2019
Perfect Codes in Euclidean Lattices: Bounds and Case Studies.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Fisher-Rao Information Metric in the Space of Normal Distributions.
Proceedings of the Geometric Science of Information - 4th International Conference, 2019

2016
A heuristic approach for designing cyclic group codes.
Int. Trans. Oper. Res., 2016

Perfect codes in the l<sub>p</sub> metric.
Eur. J. Comb., 2016

A note on subortogonal lattices.
CoRR, 2016

A totally geodesic submanifold of the multivariate normal distributions and bounds for the Fisher-Rao distance.
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Clustering using the fisher-rao distance.
Proceedings of the 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM), 2016

2015
Optimum commutative group codes.
Des. Codes Cryptogr., 2015

Fisher information distance: A geometrical reading.
Discret. Appl. Math., 2015

Quasi-perfect codes in the ℓ<sub>p</sub> metric.
CoRR, 2015

Perfect codes in the lp metric.
CoRR, 2015

2014
Codes and lattices in the lp metric.
Proceedings of the 2014 Information Theory and Applications Workshop, 2014

2012
On projections of arbitrary lattices
CoRR, 2012

2011
On sequences of projections of the cubic lattice
CoRR, 2011

2005
Fisher information matrix and hyperbolic geometry.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005


  Loading...