{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:39:41Z","timestamp":1725518381363},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859116"},{"type":"electronic","value":"9783540859123"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85912-3_29","type":"book-chapter","created":{"date-parts":[[2008,9,11]],"date-time":"2008-09-11T13:34:32Z","timestamp":1221140072000},"page":"322-331","source":"Crossref","is-referenced-by-count":0,"title":["The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Sol\u00e9","sequence":"first","affiliation":[]},{"given":"Dimitrii","family":"Zinoviev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02451115","volume":"5","author":"Z.D. Dai","year":"1992","unstructured":"Dai, Z.D.: Binary sequences derived from ML-sequences over rings I: period and minimal polynomial. J. Cryptology\u00a05, 193\u2013507 (1992)","journal-title":"J. Cryptology"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.3934\/amc.2007.1.461","volume":"1","author":"D. Dmitriev","year":"2007","unstructured":"Dmitriev, D., Jedwab, J.: Bounds on the growth rate of the peak sidelobe level of binary sequences. Advances in Mathematics of Communications\u00a01, 461\u2013475 (2007)","journal-title":"Advances in Mathematics of Communications"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/11423461_2","volume-title":"Sequences and Their Applications - SETA 2004","author":"J. Jedwab","year":"2005","unstructured":"Jedwab, J.: A survey of the merit factor problem for binary sequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol.\u00a03486, pp. 30\u201355. Springer, Heidelberg (2005)"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1109\/18.623155","volume":"IT-43","author":"S. Koponen","year":"1997","unstructured":"Koponen, S., Lahtonen, J.: On the aperiodic and odd correlations of the binary Shanbhag-Kumar-Helleseth sequences. IEEE Trans. Inform. Theory\u00a0IT-43, 1593\u20131596 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2-3","key":"29_CR5","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.jco.2003.08.014","volume":"20","author":"J. Lahtonen","year":"2004","unstructured":"Lahtonen, J., Ling, S., Sol\u00e9, P., Zinoviev, D.: Z\n                           8-Kerdock codes and pseudo-random binary sequences. Journal of Complexity\u00a020(2-3), 318\u2013330 (2004)","journal-title":"Journal of Complexity"},{"key":"29_CR6","unstructured":"Schmidt, K.U.: PhD thesis, On spectrally bounded codes for multicarrier communications. Vogt Verlag, Dresden, Germany (2007), \n                    \n                      http:\/\/www.ifn.et.tu-dresden.de\/~schmidtk\/#publications"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"1844","DOI":"10.1109\/TIT.2004.831858","volume":"IT-50","author":"P. Sol\u00e9","year":"2004","unstructured":"Sol\u00e9, P., Zinoviev, D.: The most significant bit of maximum length sequences over \n                    \n                      \n                    \n                    ${Z}_{2^l}$\n                  : autocorrelation and imbalance. IEEE Transactions on Information Theory\u00a0IT-50, 1844\u20131846 (2004)","journal-title":"IEEE Transactions on Information Theory"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"5158","DOI":"10.1109\/TIT.2006.883629","volume":"IT-52","author":"P. Sol\u00e9","year":"2006","unstructured":"Sol\u00e9, P., Zinoviev, D.: Low correlation, high nonlinearity sequences for multi-code CDMA. IEEE Transactions on Information Theory\u00a0IT-52, 5158\u20135163 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1109\/TIT.1984.1056930","volume":"IT-30","author":"D.V. Sarwate","year":"1984","unstructured":"Sarwate, D.V.: Upper bound on the aperiodic autocorrelation function for a maximal-length sequence. IEEE Trans. Inform. Theory\u00a0IT-30, 685\u2013687 (1984)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"29_CR10","first-page":"2260","volume":"IT-52","author":"H. Hu","year":"2006","unstructured":"Hu, H., Feng, D., Wu, W.: Incomplete exponential sums over Galois rings with applications to some binary sequences derived from \n                    \n                      \n                    \n                    ${\\mathbb Z}_{2}\\iota$\n                  . IEEE Trans. Inform. Theory,\u00a0IT-52, 2260\u20132265 (2006)","journal-title":"IEEE Trans. Inform. Theory,"}],"container-title":["Lecture Notes in Computer Science","Sequences and Their Applications - SETA 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85912-3_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:54:38Z","timestamp":1619524478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85912-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540859116","9783540859123"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85912-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}