In the literature one finds only a few d-decodable codepairs for the binary, two-access adder channel. Here a few general constructions for such codepairs are presented. Also a short table is included, which was composed by means of a graph theoretic approach, due to Kasami et al..
|Title of host publication||Papers dedicated to J.J. Seidel|
|Editors||P.J. Doelder, de, J. Graaf, de, J.H. Lint, van|
|Place of Publication||Eindhoven|
|Publisher||Technische Hogeschool Eindhoven|
|Number of pages||17|
|Publication status||Published - 1984|