Sequences and Their Applications - SETA 2004 : Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers
by Helleseth, Tor; Sarwate, Dilip; Song, Hong-yeop; Yang, KyeongcheolRent Textbook
Rent Digital
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
Table of Contents
| A survey of some recent results on bent functions | p. 1 |
| A survey of the merit factor problem for binary sequences | p. 30 |
| A survey of feedback with carry shift registers | p. 56 |
| Univariate and multivariate merit factors | p. 72 |
| Discrete Fourier transform, joint linear complexity and generalized joint linear complexity of multisequences | p. 101 |
| Expected value of the linear complexity of two-dimensional binary sequences | p. 113 |
| Asymptotic behavior of normalized linear complexity of multi-sequences | p. 129 |
| A unified view on sequence complexity measures as isometries | p. 143 |
| One-error linear complexity over F[subscript p] of Sidelnikov sequences | p. 154 |
| On the generalized Lauder-Paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequences | p. 166 |
| On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two | p. 179 |
| On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences | p. 185 |
| Almost-perfect and odd-perfect ternary sequences | p. 197 |
| Cross-correlation properties of perfect binary sequences | p. 208 |
| New sets of binary and ternary sequences with low correlation | p. 220 |
| Improved p-ary codes and sequence families from Galois rings | p. 236 |
| Quadriphase sequences obtained from binary quadratic form sequences | p. 243 |
| New families of p-ary sequences from quadratic form with low correlation and large linear span | p. 255 |
| On the distribution of some new explicit nonlinear congruential pseudorandom numbers | p. 266 |
| Distribution of r-patterns in the most significant bit of a maximum length sequence over Z[subscript 2[superscript l]] | p. 275 |
| Algebraic feedback shift registers based on function fields | p. 282 |
| New LFSR-based cryptosystems and the trace discrete log problem (trace-DLP) | p. 298 |
| Cryptanalysis of a particular case of Klimov-Shamir pseudo-random generator | p. 313 |
| Generating functions associated with random binary sequences consisting of runs of lengths 1 and 2 | p. 323 |
| Multi-continued fraction algorithm and generalized B-M algorithm over F[subscript 2] | p. 339 |
| A new search for optimal binary arrays with minimum peak sidelobe levels | p. 355 |
| New constructions of quaternary Hadamard matrices | p. 361 |
| Spectral orbits and peak-to-average power ratio of Boolean functions with respect to the {I, H, N}[superscript n] transform | p. 373 |
| New constructions and bounds for 2-D optical orthogonal codes | p. 389 |
| Topics on optical orthogonal codes | p. 396 |
| Weighted degree trace codes for PAPR reduction | p. 406 |
| Which irreducible polynomials divide trinomials over GF(2)? | p. 414 |
| Autocorrelation properties of resilient functions and three-valued almost-optimal functions satisfying PC(p) | p. 425 |
| Group algebras and correlation immune functions | p. 437 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.
