Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6

July 20, 2015 Β· 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 Pramod Kumar Kewat, Priti Kumari arXiv ID 1507.05506 Category cs.IT: Information Theory Citations 12 Venue Cryptography and Communications Last Checked 4 months ago
Abstract
Let $n_1=ef+1$ and $n_2=ef'+1$ be two distinct odd primes with positive integers $e,\ f,\ f'.$ In this paper, the two-prime Whiteman's generalized cyclotomic sequence of order $e=6$ is employed to construct several classes of cyclic codes over $\mathrm{GF}(q)$ with length $n_1n_2$. The lower bounds on the minimum distance of these cyclic codes are obtained.
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 β€” Information Theory

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