Abstract
We study double circulant LCD codes over [Formula: see text] for all odd primes [Formula: see text] and self-dual double circulant codes over [Formula: see text] for primes [Formula: see text]. We derive exact enumeration formulae, and asymptotic lower bounds on the minimum distance of the [Formula: see text]-ary images of these codes by the classical Gray maps.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Paper Title
Journal
Date
