Abstract
An optimization problem for constrained m-ary sequences is considered. It is shown that the
solution to this generally difficult problem is easily found when a fractional generating polynomial for the constrained sequences has been derived.
| Original language | English |
|---|---|
| Title of host publication | Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology |
| Editors | H.C.A. Tilborg, van, F.M.J. Willems |
| Pages | 22- |
| Publication status | Published - 1994 |
| Event | conference; Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Veldhoven, Netherlands, 19-21 December 1994 - Duration: 1 Jan 1994 → … |
Conference
| Conference | conference; Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Veldhoven, Netherlands, 19-21 December 1994 |
|---|---|
| Period | 1/01/94 → … |
| Other | Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Veldhoven, Netherlands, 19-21 December 1994 |