Almost affine codes

J. Simonis

Research output: Contribution to journalArticleAcademicpeer-review

75 Citations (Scopus)


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 languageEnglish
Pages (from-to)179-197
Number of pages19
JournalDesigns, Codes and Cryptography
Issue number2
Publication statusPublished - 1998


Dive into the research topics of 'Almost affine codes'. Together they form a unique fingerprint.

Cite this