Abstract
An almost affine code is a code C for which the size of all codes obtained by multiple puncturing of C is a power of the alphabet size. Essentially, almost affine codes are the same as ideal perfect secret haring schemes or partial affine geometries. The present paper explores these interrelations, gives short proofs of known and new results, and derives some properties of the distance distribution of almost affine codes.
| Original language | English |
|---|---|
| Pages (from-to) | 179-197 |
| Number of pages | 19 |
| Journal | Designs, Codes and Cryptography |
| Volume | 14 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1998 |