Samenvatting
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.
| Originele taal-2 | Engels |
|---|---|
| Titel | Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology |
| Redacteuren | H.C.A. Tilborg, van, F.M.J. Willems |
| Pagina's | 22- |
| Status | Gepubliceerd - 1994 |
| Evenement | conference; Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Veldhoven, Netherlands, 19-21 December 1994 - Duur: 1 jan. 1994 → … |
Congres
| Congres | conference; Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Veldhoven, Netherlands, 19-21 December 1994 |
|---|---|
| Periode | 1/01/94 → … |
| Ander | Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Veldhoven, Netherlands, 19-21 December 1994 |