Editing Even and odd functions (section)

===Finite length sequences===
The definitions of odd and even symmetry are extended to ''N''-point sequences (i.e. functions of the form <math>f: \left\{0,1,\ldots,N-1\right\} \to \mathbb{R}</math>) as follows:<ref name=ProakisManolakis>{{Citation | last1 =Proakis | first1 =John G. | last2 =Manolakis | first2 =Dimitri G. | title =Digital Signal Processing: Principles, Algorithms and Applications | place =Upper Saddle River, NJ | publisher =Prentice-Hall International | year =1996 | edition =3 | language =en | id =sAcfAQAAIAAJ | isbn =9780133942897 | url-access =registration | url =https://archive.org/details/digitalsignalpro00proa }}</ref>{{rp|p. 411}}

'''Even symmetry:'''

A ''N''-point sequence is called ''conjugate symmetric'' if
:<math>f(n) = f(N-n) \quad \text{for all } n \in \left\{ 1,\ldots,N-1 \right\}.</math>

Such a sequence is often called a '''palindromic sequence'''; see also [[Palindromic polynomial]].

'''Odd symmetry:'''

A ''N''-point sequence is called ''conjugate antisymmetric'' if
:<math>f(n) = -f(N-n) \quad \text{for all } n \in \left\{1,\ldots,N-1\right\}. </math>
Such a sequence is sometimes called an '''anti-palindromic sequence'''; see also [[Palindromic polynomial|Antipalindromic polynomial]].