Linear authentication codes: bounds and constructions
From MaRDI portal
Publication:4680057
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)
Related Items
Subspace code based on flats in affine space over finite fields, Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2, A Note on Optimal Constant Dimension Codes, Bounds on subspace codes based on totally isotropic subspaces in unitary spaces, Construction of optimal constant-dimension subspace codes, Rank subcodes in multicomponent network coding, List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques, Galois geometries and coding theory, Johnson type bounds on constant dimension codes, A coding theory construction of new systematic authentication codes, 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, Algebraic geometric codes with applications, Error-correcting codes in attenuated space over finite fields, Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space, Multicomponent codes with maximum code distance, Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields, NETWORK CODING WITH MODULAR LATTICES, AUTHENTICATION CODES FROM DIFFERENCE BALANCED FUNCTIONS, A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM ORTHOGONAL SPACES OVER A FINITE FIELD OF ODD CHARACTERISTIC
