On self-dual double circulant codes
March 02, 2016 Β· Declared Dead Β· π Designs, Codes and Cryptography
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Adel Alahmadi, Funda Γzdemir, Patrick SolΓ©
arXiv ID
1603.00762
Category
cs.IT: Information Theory
Citations
42
Venue
Designs, Codes and Cryptography
Last Checked
3 months ago
Abstract
Self-dual double circulant codes of odd dimension are shown to be dihedral in even characteristic and consta-dihedral in odd characteristic. Exact counting formulae are derived for them and used to show they contain families of codes with relative distance satisfying a modified Gilbert-Varshamov bound.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Information Theory
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
A Vision of 6G Wireless Systems: Applications, Trends, Technologies, and Open Research Problems
R.I.P.
π»
Ghosted
Towards Smart and Reconfigurable Environment: Intelligent Reflecting Surface Aided Wireless Network
R.I.P.
π»
Ghosted
Wireless Communications with Unmanned Aerial Vehicles: Opportunities and Challenges
R.I.P.
π»
Ghosted
Reconfigurable Intelligent Surfaces for Energy Efficiency in Wireless Communication
R.I.P.
π»
Ghosted
An Overview of Signal Processing Techniques for Millimeter Wave MIMO Systems
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted