Trace codes over \(\mathbb {Z}_4,\) and Boolean functions
From MaRDI portal
Publication:2416943
DOI10.1007/s10623-018-0542-xzbMath1446.94187arXiv1707.00153OpenAlexW2888479874MaRDI QIDQ2416943
Yan Liu, Lin Sok, Hugues Randriambololona, Patrick Solé, Minjia Shi
Publication date: 24 May 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.00153
Related Items
Linear codes over finite rings are trace codes, On generalized quasi-cyclic codes over \(\mathbb{Z}_4\), Type IV-II codes over Z4 constructed from generalized bent functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- MacWilliams duality and a Gleason-type theorem on self-dual bent functions
- An expansion for the coordinates of the trace function over Galois rings
- Linear Codes From Some 2-Designs
- Searching for linear codes with large minimum distance
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Fundamentals of Error-Correcting Codes
- On the weight hierarchy of Kerdock codes over Z/sub 4/