A few constructions and a short table of δ-decodable codepairs for the binary, two-access adder channel

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic


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..
Original languageEnglish
Title of host publicationPapers dedicated to J.J. Seidel
EditorsP.J. Doelder, de, J. Graaf, de, J.H. Lint, van
Place of PublicationEindhoven
PublisherTechnische Hogeschool Eindhoven
Number of pages17
Publication statusPublished - 1984

Publication series


Cite this