Good Integers and Applications in Coding Theory

November 14, 2016 Β· Declared Dead Β· πŸ› Cryptography and Communications

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Somphong Jitman arXiv ID 1611.04539 Category math.RA Cross-listed cs.IT, math.NT Citations 17 Venue Cryptography and Communications Last Checked 3 months ago
Abstract
A class of good integers has been introduced by P. Moree in $1997$ together with the characterization of good odd integers. Such integers have shown to have nice number theoretical properties and wide applications. In this paper, a complete characterization of all good integers is given. Two subclasses of good integers are introduced, namely, oddly-good and evenly-good integers. The characterization and properties of good integers in these two subclasses are determined. As applications, good integers and oddly-good integers are applied in the study of the hulls of abelian codes. The average dimension of the hulls of abelian codes is given together with some upper and lower bounds.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” math.RA

Died the same way β€” πŸ‘» Ghosted