Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Helleseth, T.
Kumar, P.V.
Moreno, O.
and
Shanbhag, A.G.
1996.
Improved estimates via exponential sums for the minimum distance of Z/sub 4/-linear trace codes.
IEEE Transactions on Information Theory,
Vol. 42,
Issue. 4,
p.
1212.
Berger, T.P.
and
Charpin, P.
1996.
The permutation group of affine-invariant extended cyclic codes.
IEEE Transactions on Information Theory,
Vol. 42,
Issue. 6,
p.
2194.
Klapper, A.
1996.
Large families of sequences with near-optimal correlations and large linear span.
IEEE Transactions on Information Theory,
Vol. 42,
Issue. 4,
p.
1241.
Guang Gong
1997.
A new class of nonlinear PN sequences over GF(q/sup n/).
IEEE Transactions on Information Theory,
Vol. 43,
Issue. 3,
p.
1007.
Schellwat, H.
and
Wide, P.
1997.
Position detection of an autonomous robot by aperiodic tilings.
Vol. 1,
Issue. ,
p.
576.
van der Vlugt, M.
1997.
Surfaces and the weight distribution of a family of codes.
IEEE Transactions on Information Theory,
Vol. 43,
Issue. 4,
p.
1354.
Paterson, K.G.
1998.
Binary sequence sets with favorable correlations from difference sets and MDS codes.
IEEE Transactions on Information Theory,
Vol. 44,
Issue. 1,
p.
172.
Fontaine, C.
1999.
On some cosets of the first-order Reed-Muller code with high minimum weight.
IEEE Transactions on Information Theory,
Vol. 45,
Issue. 4,
p.
1237.
Paterson, K.G.
and
Tarokh, V.
2000.
On the existence and construction of good codes with low peak-to-average power ratios.
IEEE Transactions on Information Theory,
Vol. 46,
Issue. 6,
p.
1974.
Ray-Chaudhuri, D.K.
and
Blackford, J.T.
2000.
A transform approach to permutation groups of cyclic codes over Galois rings.
IEEE Transactions on Information Theory,
Vol. 46,
Issue. 7,
p.
2350.
Cheon, Jung Hee
2001.
Advances in Cryptology — CRYPTO 2001.
Vol. 2139,
Issue. ,
p.
458.
Jeong-Heon Kim
and
Hong-Yeop Song
2001.
On the linear complexity of Hall's sextic residue sequences.
IEEE Transactions on Information Theory,
Vol. 47,
Issue. 5,
p.
2094.
Charpin, P.
Tietavainen, A.
and
Zinoviev, V.
2001.
On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property.
IEEE Transactions on Information Theory,
Vol. 47,
Issue. 1,
p.
421.
Shum, Kenneth
Kumar, P. Vijay
and
Helleseth, Tor
2001.
Finite Fields and Applications.
p.
418.
Xin, Y.
and
Fair, I.J.
2001.
Polynomials for generating selection sets with complementary quotients in guided scrambling line coding.
Electronics Letters,
Vol. 37,
Issue. 6,
p.
365.
Yang, E.Y.
Jie Xu
and
Bennett, K.H.
2002.
Private information retrieval in the presence of malicious failures.
p.
805.
Yang, E.Y.
Jie Xu
and
Bennett, K.H.
2002.
A fault-tolerant approach to secure information retrieval.
p.
12.
Courtois, Nicolas
Goubin, Louis
Meier, Willi
and
Tacier, Jean-Daniel
2002.
Public Key Cryptography.
Vol. 2274,
Issue. ,
p.
211.
Rizomiliotis, P.
Kolokotronis, N.
and
Kalouptsidis, N.
2002.
Construction of sequences with four-valued autocorrelation from GMW sequences.
p.
183.
Das, Pinaki
and
Mullen, Gary L.
2002.
Finite Fields with Applications to Coding Theory, Cryptography and Related Areas.
p.
80.
