Constrained sequences and optimization

P.J.M. Veugen

Constrained sequences and optimization

P.J.M. Veugen

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Hoofdstuk › Academic

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

Citeer dit

@inbook{0fc5e7e0a57d45e2aed1e8cac4420b4a,

title = "Constrained sequences and optimization",

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.",

author = "P.J.M. Veugen",

year = "1994",

language = "English",

isbn = "90-75332-01-7",

pages = "22--",

editor = "\{Tilborg, van\}, H.C.A. and F.M.J. Willems",

booktitle = "Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology",

note = "conference; Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Veldhoven, Netherlands, 19-21 December 1994 ; Conference date: 01-01-1994",

}

TY - CHAP

T1 - Constrained sequences and optimization

AU - Veugen, P.J.M.

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

M3 - Chapter

SN - 90-75332-01-7

SP - 22-

BT - Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology

A2 - Tilborg, van, H.C.A.

A2 - Willems, F.M.J.

T2 - conference; Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Veldhoven, Netherlands, 19-21 December 1994

Y2 - 1 January 1994

ER -

Constrained sequences and optimization

Samenvatting

Congres

Vingerafdruk

Citeer dit