Linear authentication codes: bounds and constructions

DOI10.1109/TIT.2003.809567zbMath1063.94087MaRDI QIDQ4680057

Huaxiong Wang, Xing, Chaoping, Reihaneh Safavi-Naini

Publication date: 1 June 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Bounds on codes (94B65) Authentication, digital signatures and secret sharing (94A62)

Related Items

Multicomponent codes with maximum code distance ⋮ Construction of optimal constant-dimension subspace codes ⋮ New constant dimension subspace codes from block inserting constructions ⋮ AUTHENTICATION CODES FROM DIFFERENCE BALANCED FUNCTIONS ⋮ Bounds on subspace codes based on totally isotropic subspaces in unitary spaces ⋮ Rank subcodes in multicomponent network coding ⋮ List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques ⋮ Bilateral multilevel construction of constant dimension codes ⋮ Combining subspace codes ⋮ Unnamed Item ⋮ Galois geometries and coding theory ⋮ Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields ⋮ Algebraic geometric codes with applications ⋮ Subspace code based on flats in affine space over finite fields ⋮ Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces ⋮ Bounds for flag codes ⋮ A coding theory construction of new systematic authentication codes ⋮ Error-correcting codes in attenuated space over finite fields ⋮ New constructions of systematic authentication codes from three classes of cyclic codes ⋮ New methods of construction of Cartesian authentication codes from geometries over finite commutative rings ⋮ Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2 ⋮ Johnson type bounds on constant dimension codes ⋮ A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM ORTHOGONAL SPACES OVER A FINITE FIELD OF ODD CHARACTERISTIC ⋮ Error-correcting codes based on partial linear maps of finite-dimensional vector spaces ⋮ NETWORK CODING WITH MODULAR LATTICES ⋮ A Note on Optimal Constant Dimension Codes ⋮ Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space ⋮ Rank-Metric Codes and Their Applications

This page was built for publication: Linear authentication codes: bounds and constructions