The following pages link to Cunsheng Ding (Q193602):
Displaying 50 items.
- Weight distribution of cyclic codes with arbitrary number of generalized Niho type zeroes (Q256583) (← links)
- A construction of binary linear codes from Boolean functions (Q297928) (← links)
- Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\) (Q394548) (← links)
- Optimal ternary cyclic codes with minimum distance four and five (Q405959) (← links)
- Corrigenda to ``Permutation polynomials over finite fields from a powerful lemma'', ``Further results on permutation polynomials over finite fields'', ``Permutation polynomials of the form \(L(x) + S_{2k}^a + S_{2k}^b\) over \(\mathbb{F}_{q^{3k}}\)'' (Q405963) (← links)
- Permutation polynomials over finite fields from a powerful lemma (Q650832) (← links)
- Maximal arcs and extended cyclic codes (Q670203) (← links)
- Three constructions of authentication codes with perfect secrecy (Q702184) (← links)
- Permutation polynomials of the form \(L(x) + S_{2k}^a + S_{2k}^b\) over \(\mathbb{F}_{q^{3k}}\) (Q740301) (← links)
- Infinite families of 3-designs from o-polynomials (Q825921) (← links)
- Authentication schemes from highly nonlinear functions (Q851735) (← links)
- A construction of optimal constant composition codes (Q851744) (← links)
- Constructions of external difference families and disjoint difference families (Q851745) (← links)
- A family of skew Hadamard difference sets (Q855845) (← links)
- Nonlinearities of S-boxes (Q865386) (← links)
- Three-weight cyclic codes and their weight distributions (Q898083) (← links)
- Constructions of almost difference families (Q947817) (← links)
- Optimal and perfect difference systems of sets (Q1003626) (← links)
- Codebooks from almost difference sets (Q1008969) (← links)
- Preface to the special issue on the occasion of the 65th birthday of Torleiv Kløve on October 17, 2008 (Q1009040) (← links)
- Binary sequences with optimal autocorrelation (Q1019710) (← links)
- Explicit classes of permutation polynomials of \(\mathbb F_{3^{3m}}\) (Q1041522) (← links)
- The stability theory of stream ciphers (Q1202027) (← links)
- Linear complexity of generalized cyclotomic binary sequences of order 2 (Q1266420) (← links)
- New generalized cyclotomy and its applications (Q1266994) (← links)
- How to build robust shared control systems (Q1273533) (← links)
- Logarithm Cartesian authentication codes. (Q1398375) (← links)
- Cartesian authentication codes from functions with optimal nonlinearity. (Q1401188) (← links)
- Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets (Q1406880) (← links)
- Secret-sharing with a class of ternary codes (Q1583097) (← links)
- Another generalisation of the binary Reed-Muller codes and its applications (Q1654499) (← links)
- A sequence construction of cyclic codes over finite fields (Q1696139) (← links)
- The subfield codes of hyperoval and conic codes (Q1734678) (← links)
- On the nonlinearity of Boolean functions with restricted input (Q1755185) (← links)
- A coding theory construction of new systematic authentication codes (Q1763702) (← links)
- Three constructions of authentication/secrecy codes (Q1770530) (← links)
- Minimal linear codes over finite fields (Q1800699) (← links)
- Several classes of \((2^{m}-1,w,2)\) optical orthogonal codes (Q1811097) (← links)
- A short biography of Harald Niederreiter (On the occasion of his 60th birthday) (Q1827561) (← links)
- Highly nonlinear mappings (Q1827566) (← links)
- Hamming weights in irreducible cyclic codes (Q1937555) (← links)
- A \(q\)-polynomial approach to cyclic codes (Q1943457) (← links)
- A simple stream cipher with proven properties (Q1947647) (← links)
- Constructions of sequences with almost perfect linear complexity profile from curves over finite fields (Q1964068) (← links)
- Duadic sequences of prime lengths (Q1978144) (← links)
- Infinite families of 2-designs and 3-designs from linear codes (Q2012529) (← links)
- The projective general linear group \(\mathrm{PGL}(2,2^m)\) and linear codes of length \(2^m+1\) (Q2035462) (← links)
- Combinatorial \(t\)-designs from special functions (Q2040310) (← links)
- The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes (Q2121020) (← links)
- Constructions of almost difference sets from finite fields (Q2249787) (← links)
