Rank and Kernel of Binary Hadamard Codes
From MaRDI portal
Publication:3547469
DOI10.1109/TIT.2005.856940zbMATH Open1318.94097OpenAlexW2143250996MaRDI QIDQ3547469FDOQ3547469
Authors: Kevin T. Phelps, Josep Rifà, M. Villanueva 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2005.856940
Recommendations
Cited In (13)
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- On kernels and nuclei of rank metric codes
- Switching codes and designs
- On one construction method for Hadamard matrices
- Title not available (Why is that?)
- Hadamard full propelinear codes of type Q; rank and kernel
- Kernels of nonlinear Hamming codes
- ℤ₂ℤ₄-additive codes as codes over rings
- Hadamard matrices and their applications: progress 2007--2010
- On nonlinear 1-quasi-perfect codes and their structural properties
- Properties of sparse random matrices over finite fields
- About some Hadamard full propelinear \((2t,2,2)\)-codes. Rank and kernel
- On perfect codes: Rank and kernel
This page was built for publication: Rank and Kernel of Binary Hadamard Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547469)
