2 papers
cs.IT2025
Constructions and bounds for subspace codes
Sascha Kurz
Subspace codes are the -analog of binary block codes in the Hamming metric. Here the codewords are vector spaces over a finite field. They have e.g. applications in random linea…
cs.IT2025
Divisible Codes
Sascha Kurz
A linear code over with the Hamming metric is called -divisible if the weights of all codewords are divisible by . They have been introduced by Harold Ward a…