Recursion Polynomials of Unfolded Sequences

Watermarking digital media is one of the important chal- lenges for information hiding. Not only the watermark must be resistant to noise and against attempts of modification, legitimate users should not be aware that it is embedded in the media. One of the techniques for watermarking is using an special variant of spread-spectrum tech- nique, called frequency hopping. It requires ensembles of periodic binary sequences with low off-peak autocorrelation and cross-correlation. Un- fortunately, they are quite rare and difficult to find. The small Kasami, Kamaletdinov, and Extended Rational Cycle constructions are versatile, because they can also be converted into Costas-like arrays for frequency hopping. We study the implementation of such ensembles using linear feedback shift registers. This permits an efficient generation of sequences and arrays in real time in FPGAs. Such an implementation requires minimal memory usage and permits dynamic updating of sequences or arrays. The aim of our work was to broaden current knowledge of sets of se- quences with low correlation studying their implementation using linear feedback shift registers. A remarkable feature of these families is their similarities in terms of implementation and it may open new way to characterize sequences with low correlation, making it easier to gener- ate them. It also validates some conjectures made by Moreno and Tirkel about arrays constructed using the method of composition.Supported by Consejería de Universidades e Investigación, Medio Ambiente y Política Social, Gobierno de Cantabria (ref. VP34

Code design and analysis for multiple access communications

This thesis explores various coding aspects of multiple access communications, mainly for spread spectrum multiaccess(SSMA) communications and collaborative coding multiaccess(CCMA) communications. Both the SSMA and CCMA techniques permit efficient simultaneous transmission by several users sharing a common channel, without subdivision in time or frequency. The general principle behind these two multiaccess schemes is that one can find sets of signals (codes) which can be combined together to form a composite signal; on reception, the individual signals in the set can each be recovered from the composite signal. For the CCMA scheme, the isolation between users is based on the code structure; for the SSMA scheme, on the other hand, the isolation between users is based on the autocorrelation functions(ACFs) and crosscorrelation functions (CCFs) of the code sequences. It is clear that, in either case, the code design is the key to the system design.For the CCMA system with a multiaccess binary adder channel, a class of superimposed codes is analyzed. It is proved that every constant weight code of weight w and maximal correlation λ corresponds to a subclass of disjunctive codes of order T 3, the out-of-phase ACFs and CCFs of the codes are constant and equal to √L. In addition, all codes of the same length are mutually orthogonal.2. Maximal length sequences (m-sequences) over Gaussian integers, suitable for use with QAM modulation, are considered. Two sub-classes of m-sequences with quasi-perfect periodic autocorrelations are obtained. The CCFs between the decimated m-sequences are studied. By applying a simple operation, it is shown that some m-sequences over rational and Gaussian integers can be transformed into perfect sequences with impulsive ACFs.3. Frank codes and Chu codes have perfect periodic ACFs and optimum periodic CCFs. In addition, it is shown that they also have very favourable nonperiodic ACFs; some new results concerning the behaviour of the nonperiodic ACFs are derived. Further, it is proved that the sets of combinedFrank/Chu codes, which contain a larger number of codes than either of the two constituent sets, also have very good periodic CCFs. Based on Frank codes and Chu codes, two interesting classes of real-valued codes with good correlation properties are defined. It is shown that these codes have periodic complementary properties and good periodic and nonperiodic ACF/CCFs.Finally, a hybrid CCMA/SSMA coding scheme is proposed. This new hybrid coding scheme provides a very flexible and powerful multiple accessing capability and allows simple and efficient decoding. Given an SSMA system with K users and a CCMA system with N users, where at most T users are active at any time, then the hybrid system will have K . N users with at most T.K users active at any time. The hybrid CCMA/SSMA coding scheme is superior to the individual CCMA system or SSMA system in terms of information rate, number of users, decoding complexity and external interference rejection capability

Construction of pp-ary Sequence Families of Period (pn−1)/2(p^n-1)/2 and Cross-Correlation of pp-ary m-Sequences and Their Decimated Sequences

학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2015. 2. 노종선.This dissertation includes three main contributions: a construction of a new family of $p$-ary sequences of period $\frac{p^n-1}{2}$ with low correlation, a derivation of the cross-correlation values of decimated $p$-ary m-sequences and their decimations, and an upper bound on the cross-correlation values of ternary m-sequences and their decimations. First, for an odd prime $p = 3 \mod 4$ and an odd integer $n$, a new family of $p$-ary sequences of period $N = \frac{p^n-1}{2}$ with low correlation is proposed. The family is constructed by shifts and additions of two decimated m-sequences with the decimation factors 2 and $d = N-p^{n-1}$. The upper bound on the maximum value of the magnitude of the correlation of the family is shown to be $2\sqrt{N+1/2} = \sqrt{2p^n}$ by using the generalized Kloosterman sums. The family size is four times the period of sequences, $2(p^n-1)$. Second, based on the work by Helleseth \cite{Helleseth1}, the cross-correlation values between two decimated m-sequences by 2 and $4p^{n/2}-2$ are derived, where $p$ is an odd prime and $n = 2m$ is an integer. The cross-correlation is at most 4-valued and their values are $\{\frac{-1\pm p^{n/2}}{2}, \frac{-1+3p^{n/2}}{2}, \frac{-1+5p^{n/2}}{2}\}$. As a result, for $p^m \neq 2 \mod 3$, a new sequence family with the maximum correlation value $\frac{5}{\sqrt{2}} \sqrt{N}$ and the family size $4N$ is obtained, where $N = \frac{p^n-1}{2}$ is the period of sequences in the family. Lastly, the upper bound on the cross-correlation values of ternary m-sequences and their decimations by $d = \frac{3^{4k+2}-3^{2k+1}+2}{4}+3^{2k+1}$ is investigated, where $k$ is an integer and the period of m-sequences is $N = 3^{4k+2}-1$. The magnitude of the cross-correlation is upper bounded by $\frac{1}{2} \cdot 3^{2k+3}+1 = 4.5 \sqrt{N+1}+1$. To show this, the quadratic form technique and Bluher's results \cite{Bluher} are employed. While many previous results using quadratic form technique consider two quadratic forms, four quadratic forms are involved in this case. It is proved that quadratic forms have only even ranks and at most one of four quadratic forms has the lowest rank $4k-2$.Abstract i Contents iii List of Tables vi List of Figures vii 1. Introduction 1 1.1. Background 1 1.2. Overview of Dissertation 9 2. Sequences with Low Correlation 11 2.1. Trace Functions and Sequences 11 2.2. Sequences with Low Autocorrelation 13 2.3. Sequence Families with Low Correlation 17 3. A New Family of p-ary Sequences of Period (p^n−1)/2 with Low Correlation 21 3.1. Introduction 22 3.2. Characters 24 3.3. Gaussian Sums and Kloosterman Sums 26 3.4. Notations 28 3.5. Definition of Sequence Family 29 3.6. Correlation Bound 30 3.7. Size of Sequence Family 35 3.8. An Example 38 3.9. Related Work 40 3.10. Conclusion 41 4. On the Cross-Correlation between Two Decimated p-ary m-Sequences by 2 and 4p^{n/2}−2 44 4.1. Introduction 44 4.2. Decimated Sequences of Period (p^n−1)/2 49 4.3. Correlation Bound 53 4.4. Examples 59 4.5. A New Sequence Family of Period (p^n−1)/2 60 4.6. Discussions 61 4.7. Conclusion 67 5. On the Cross-Correlation of Ternary m-Sequences of Period 3^{4k+2} − 1 with Decimation (3^{4k+2}−3^{2k+1}+2)/4 + 3^{2k+1} 69 5.1. Introduction 69 5.2. Quadratic Forms and Linearized Polynomials 71 5.3. Number of Solutions of x^{p^s+1} − cx + c 78 5.4. Notations 79 5.5. Quadratic Form Expression of the Cross-Correlation Function 80 5.6. Ranks of Quadratic Forms 83 5.7. Upper Bound on the Cross-Correlation Function 89 5.8. Examples 93 5.9. Related Works 94 5.10. Conclusion 94 6. Conclusions 96 Bibliography 98 초록 109Docto

Proofs of two conjectures on ternary weakly regular bent functions

We study ternary monomial functions of the form f(x)=\Tr_n(ax^d), where x\in \Ff_{3^n} and \Tr_n: \Ff_{3^n}\to \Ff_3 is the absolute trace function. Using a lemma of Hou \cite{hou}, Stickelberger's theorem on Gauss sums, and certain ternary weight inequalities, we show that certain ternary monomial functions arising from \cite{hk1} are weakly regular bent, settling a conjecture of Helleseth and Kholosha \cite{hk1}. We also prove that the Coulter-Matthews bent functions are weakly regular.Comment: 20 page