The following pages link to Tor Helleseth (Q188600):
Displaying 50 items.
- On the lifted Melas code (Q267789) (← links)
- Quasi-perfect linear codes from planar and APN functions (Q269565) (← links)
- Linear codes with two or three weights from quadratic bent functions (Q306341) (← links)
- Some classes of monomial complete permutation polynomials over finite fields of characteristic two (Q402557) (← links)
- Optimal ternary cyclic codes with minimum distance four and five (Q405959) (← links)
- The Grey-Rankin bound for nonbinary codes (Q415670) (← links)
- (Q586280) (redirect page) (← links)
- New commutative semifields defined by new PN multinomials (Q662161) (← links)
- Crosscorrelation of \(m\)-sequences, exponential sums, bent functions and Jacobsthal sums (Q662194) (← links)
- Exponential sums and coding theory: A review (Q674552) (← links)
- Codes with the same weight distributions as the Goethals codes and the Delsarte-Goethals codes (Q676918) (← links)
- The nonexistence of ternary [97, 6, 63] codes (Q698038) (← links)
- The weight distribution of the coset leaders for some classes of codes with related parity-check matrices (Q754156) (← links)
- A characterization of some minihypers in a finite projective geometry PG(t,4) (Q804949) (← links)
- Cryptographically strong permutations from the butterfly structure (Q831163) (← links)
- The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd (Q868885) (← links)
- Some classes of complete permutation polynomials over \(\mathbb F_q\) (Q892773) (← links)
- On Niho type cross-correlation functions of \(m\)-sequences (Q946884) (← links)
- Propagation characteristics of \(x\mapsto x^{-1}\) and Kloosterman sums (Q946890) (← links)
- New pairs of \(m\)-sequences with 4-level cross-correlation. (Q955198) (← links)
- Preface to the special issue on the occasion of the 65th birthday of Torleiv Kløve on October 17, 2008 (Q1009040) (← links)
- Editorial to the special issue: In memory of Hans Dobbertin. Selected papers from the Fifth International Workshop on Coding and Cryptography (WCC07) held in Versailles, France, April 16--20, 2007. (Q1009078) (← links)
- A new optimal quaternary sequence family of length \(2(2^{n}-1)\) obtained from the orthogonal transformation of families \({\mathcal{B}}\) and \({\mathcal{C}}\) (Q1039267) (← links)
- Divisibility properties of classical binary Kloosterman sums (Q1043564) (← links)
- On the covering radius of cyclic linear codes and arithmetic codes (Q1065761) (← links)
- On the cosets of the simplex code (Q1072523) (← links)
- De Bruijn sequences, irreducible codes and cyclotomy (Q1126191) (← links)
- Legendre sums and codes related to QR codes (Q1183331) (← links)
- A characterization of some \(\{2v_{\alpha{}+1}+v_{\gamma{}+1},2v_ \alpha{}+v_ \gamma{};k-1,3\}\)-minihypers and some \((n,k,3^{k-1}- 2\cdot{}3^ \alpha{}-3^ \gamma{};3)\)-codes \((k\geq{}3,\;0 \leq{}\alpha{}< \gamma{}< k-1)\) meeting the Griesmer bound (Q1197005) (← links)
- Projective codes meeting the Griesmer bound (Q1199610) (← links)
- On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q]\)-codes meeting the Griesmer bound (Q1200291) (← links)
- A characterization of some \(\{v_ 2+2v_ 3,v_ 1+2v_ 2;k-1,3\}\)-minihypers and some \((v_ k-30,k,3^{k-1}-21;3)\)-codes meeting the Griesmer bound (Q1209669) (← links)
- Some results about the cross-correlation function between two maximal linear sequences (Q1234646) (← links)
- The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\) (Q1239128) (← links)
- The weight enumerator polynomials of some classes of codes with composite parity-check polynomials (Q1244322) (← links)
- Weights of abelian codes (Q1265230) (← links)
- On the number of solutions of polynomial systems (Q1266404) (← links)
- New generalized cyclotomy and its applications (Q1266994) (← links)
- How to build robust shared control systems (Q1273533) (← links)
- An infinite family of 3-designs from Preparata codes over \(\mathbb{Z}_4\) (Q1273536) (← links)
- Two new infinite families of 3-designs from Kerdock codes over \(\mathbb Z_4\). (Q1273540) (← links)
- A \(p\)-adic Serre bound (Q1273723) (← links)
- An upper bound for the extended Kloosterman sums over Galois rings (Q1273725) (← links)
- New linear codes with covering radius 2 and odd basis (Q1283217) (← links)
- On the Hamming weight enumerators of self-dual codes over \(\mathbb{Z}_k\) (Q1284209) (← links)
- Local weight enumerators for binary self-dual codes (Q1291126) (← links)
- New infinite families of 3-designs from Preparata codes over \(\mathbb{Z}_4\) (Q1296979) (← links)
- On the minimum length of quaternary linear codes of dimension five (Q1301710) (← links)
- A new class of nonbinary codes meeting the Griesmer bound (Q1314334) (← links)
- Long binary narrow-sense BCH codes are normal (Q1352424) (← links)
