16 citations · 57 across the 29 of their papers we have counts for
12 papers · 1 filter
On maximum distance separable and completely regular codes
Joaquim Borges, Josep Rifà, Victor Zinoviev
We investigate when a maximum distance separable () code over is also completely regular (). For lengths and we provide a complete classification of…
On completely regular and completely transitive codes derived from Hamming codes
J. Borges, J. Rifà, V. A. Zinoviev
Given a parity-check matrix of a -ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as…
Hadamard full propelinear codes with associated group ; rank and kernel
Ivan Bailera, Joaquim Borges, Josep Rifà
We introduce the Hadamard full propelinear codes that factorize as direct product of groups such that their associated group is . We study the rank, the dimension…
Circulant Hadamard matrices as HFP-codes of type
Josep Rifà
We prove that a circulant Hadamard code of length can always be seen as an HFP-code (Hadamard full propelinear code) of type , where o…
Hadamard Full Propelinear Codes of type Q. Rank and Kernel
J. Rifà, E. Suárez Canedo
Hadamard full propelinear codes (HFP-codes) are introduced and their equivalence with Hadamard groups is proven (on the other hand, it is already known the equivalence of Hadamard…
On Completely Regular Codes
J. Borges, J. Rifà, V. A. Zinoviev
This work is a survey on completely regular codes. Known properties, relations with other combinatorial structures and constructions are stated. The existence problem is also discu…