{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:41:04Z","timestamp":1648590064256},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,13]],"date-time":"2013-09-13T00:00:00Z","timestamp":1379030400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10623-013-9877-5","type":"journal-article","created":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T15:02:54Z","timestamp":1378998174000},"page":"533-557","source":"Crossref","is-referenced-by-count":1,"title":["On the bounds and achievability about the ODPC of $$\\mathcal{GRM }(2,m)^*$$ GRM ( 2 , m ) \u2217 over prime fields for increasing message length"],"prefix":"10.1007","volume":"74","author":[{"given":"Xiaogang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yuan","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,13]]},"reference":[{"key":"9877_CR1","unstructured":"Ar\u0131kan E.: Channel polarization: a method for constructing capacity-achieving codes for symmetric binaryinput memoryless channels. IEEE Trans. Inf. Theory 55(7), 3051\u20133073 (2009)."},{"key":"9877_CR2","doi-asserted-by":"crossref","unstructured":"Assmus Jr E.F., Key J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992).","DOI":"10.1017\/CBO9781316529836"},{"key":"9877_CR3","unstructured":"Bruen A.: Blocking sets and low-weight codewords in the generalized reed-muller codes. In: Bruen A., Wehlau D., Society C.M. (eds.) Error-Correcting Codes, Finite Geometries, and Cryptography. Contemporary Mathematics, vol. 525. American Mathematical Society, Southport, pp. 161\u2013164 (2010)."},{"key":"9877_CR4","unstructured":"Burnashev M., Dumer I.: Error exponents for recursive decoding of Reed\u2013Muller codes on a binary-symmetric channel. IEEE Trans. Inf. Theory 52(11), 4880\u20134891 (2006)."},{"key":"9877_CR5","doi-asserted-by":"crossref","unstructured":"Cameron P.J., Von Lint J.H.: Graph Theory, Coding Theory and Block Designs. London Mathematical Society. Lecture Note, vol. 19. Cambridge University Press, London (1975).","DOI":"10.1017\/CBO9781107325425"},{"key":"9877_CR6","unstructured":"Chen Y., Han Vinck A.J.: A lower bound on the optimum distance profiles of the second-order Reed\u2013Muller codes. IEEE Trans. Inf. Theory 56(9), 4309\u20134320 (2010)."},{"key":"9877_CR7","unstructured":"Davis J.A., Jedwab J.: Peak-to-mean power control in OFDM, Golay complementary sequences and Reed\u2013Muller codes. IEEE Trans. Inf. Theory 45(7), 2397\u20132417 (1999)."},{"key":"9877_CR8","unstructured":"Delsarte P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 10, (1973)."},{"key":"9877_CR9","doi-asserted-by":"crossref","unstructured":"Delsarte P., Goethals J.M.: Alternating bilinear forms over GF(q). J. Comb. Theory. 19(A), 26\u201350 (1975).","DOI":"10.1016\/0097-3165(75)90090-4"},{"key":"9877_CR10","unstructured":"Delsarte P., Goethals J.M., MacWilliams F.J.: On GRM and their relatives. Inf. Contract. 16(5), 403\u2013442 (1970)."},{"key":"9877_CR11","unstructured":"Ding C.: The weight distribution of some irreducible cyclic codes. IEEE Trans. Inf. Theory 55(3), 955\u2013960 (2009)."},{"key":"9877_CR12","unstructured":"Ding C., Liu Y., Ma C., Zeng L.: The weight distributions of the duals of cyclic codes with two zeros. IEEE Trans. Inf. Theory 57(12), 8000\u20138006 (2011)."},{"key":"9877_CR13","unstructured":"Draper S., Hou X.D.: Explicit evaluation of certain exponential sums of quadratic functions over $${\\mathbb{F}}_{p^n}$$ F p n , p odd. arXiv:0708.3619v1 (2007)."},{"key":"9877_CR14","doi-asserted-by":"crossref","unstructured":"Egawa Y.: Association schemes of quadratic forms. J. Comb. Theory. 38(A), 1\u201314 (1985).","DOI":"10.1016\/0097-3165(85)90016-0"},{"key":"9877_CR15","unstructured":"Elias P.: List decoding for noisy channels. Technical Report 335, Research Laboratory of Electronics, MIT (1957)."},{"key":"9877_CR16","doi-asserted-by":"crossref","unstructured":"Feng K., Luo J.: Weight distribution of some reducible cyclic codes. Finite Fields Appl. 14(2), 390\u2013409 (2008).","DOI":"10.1016\/j.ffa.2007.03.003"},{"key":"9877_CR17","doi-asserted-by":"crossref","unstructured":"Geil O.: On the second weight of generalized Reed\u2013Muller codes. Des. Codes Cryptogr. 48, 323\u2013330 (2008).","DOI":"10.1007\/s10623-008-9211-9"},{"key":"9877_CR18","doi-asserted-by":"crossref","unstructured":"Han Vinck A.J., Luo Y.: Optimum distance profiles of linear block codes. In: Proceedings of IEEE International Symposium on Information Theory, pp. 1958\u20131962 (2008).","DOI":"10.1109\/ISIT.2008.4595331"},{"key":"9877_CR19","unstructured":"Helleseth T., Kl\u00f8ve T., Mykkeltveit J.: The weight distribution of irreducible cyclic codes with block lengths $$n_1((q^l-1)\/N)$$ n 1 ( ( q l - 1 ) \/ N ) . Discret. Math. 18, 179\u2013211 (1977)."},{"key":"9877_CR20","doi-asserted-by":"crossref","unstructured":"Holma H., Toskala A.: WCDMA for UMTSHSPA Evolution and LTE, 4th edn. Wiley, London (2007).","DOI":"10.1002\/9780470512531"},{"key":"9877_CR21","doi-asserted-by":"crossref","unstructured":"Kacewicz A., Wicker S.: Application of Reed\u2013Muller codes for localization of malicious nodes. In: Proceedings of IEEE International Conference on Communications (ICC\u201910), Capetown (2010).","DOI":"10.1109\/ICC.2010.5501749"},{"key":"9877_CR22","unstructured":"Kasami T., Lin S., Peterson W.: New generalization of Reed\u2013Muller codes. Part I: primitive codes. IEEE Trans. Inf. Theory 14, 189\u2013199 (1968)."},{"key":"9877_CR23","unstructured":"Korada S.B., \u015ea\u015fo\u011flu E., Urbanke R.: Polar codes: characterization of exponent, bounds, and constructions. IEEE Trans. Inf. Theory 56(12), 6253\u20136264 (2010)."},{"key":"9877_CR24","doi-asserted-by":"crossref","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997).","DOI":"10.1017\/CBO9780511525926"},{"key":"9877_CR25","doi-asserted-by":"crossref","unstructured":"Liu X., Luo Y.: The weight distributions of some cyclic codes with three or four nonzeros over $${\\mathbb{F}}_3$$ F 3 . arXiv:1302.0394v1.","DOI":"10.1155\/2014\/686138"},{"key":"9877_CR26","unstructured":"Liu X., Luo Y., Shum K.W.: On the optimum cyclic subcode chains of $${\\cal RM}(2,m)^*$$ RM ( 2 , m ) \u2217 for increasing message length. arXiv:1306.0710v1."},{"key":"9877_CR27","doi-asserted-by":"crossref","unstructured":"Luo Y., Han Vinck A.J.: On a classification of cyclic subcode chains. In: 2009 International Conference on Communications and Networking in China (ChinaCom-2009), Xi\u2019an (2009).","DOI":"10.1109\/CHINACOM.2009.5339742"},{"key":"9877_CR28","unstructured":"Luo Y., Han Vinck A.J., Chen Y.: On the optimum distance profiles about linear block codes. IEEE Trans. Inf. Theory 56(3), 1007\u20131014 (2010)."},{"key":"9877_CR29","unstructured":"Luo J., Tang Y., Wang H.: Cyclic codes and sequences: The generalized Kasami case. IEEE Trans. Inf. Theory 56(5), 2130\u20132142 (2010)."},{"key":"9877_CR30","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1988)."},{"key":"9877_CR31","unstructured":"McEliece R.J.: Irreducible cyclic codes and Gauss Sums. In: Combinatorics, Part I: Theory of Designs, Finite Geometry and Coding Theory, vol. 55, pp. 179\u2013196. Mathematical Centre Tracts, Mathematisch Centrum, Amsterdam (1974)."},{"key":"9877_CR32","unstructured":"Paterson K.G.: Generalized Reed\u2013Muller codes and power control in OFDM modulation. IEEE Trans. Inf. Theory 46(1), 104\u2013120 (2000)."},{"key":"9877_CR33","unstructured":"Sloane N.J.A.: An introduction to association schemes and coding theory. In: Askey R. (ed.) Theory and Application of Special Functions, pp. 225\u2013260. Academic Press, New York (1975)."},{"key":"9877_CR34","doi-asserted-by":"crossref","unstructured":"Tanner R., Woodard J.: WCDMA\u2014Requirements and Practical Design. Wiley, London (2004).","DOI":"10.1002\/0470861797"},{"key":"9877_CR35","unstructured":"van Dijk M., Baggen S., Tolhuizen L.: Coding for informed decoders. In: Proceedings of IEEE International Symposium on Information Theory, p. 202. Washington, DC (2001)."},{"key":"9877_CR36","unstructured":"Weldon Jr E.J.: New generalizations of the Reed\u2013Muller codes. Part II: nonprimitive codes. IEEE Trans. Inf. Theory 14(3), 199\u2013205 (1968)."},{"key":"9877_CR37","unstructured":"Wozencraft J.: List Decoding. Technical Report 48, pp. 90\u201395. Quarterly Progress Report, Research Laboratory of Electronics, MIT (1958)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9877-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9877-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9877-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,6]],"date-time":"2022-03-06T03:19:41Z","timestamp":1646536781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9877-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,13]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["9877"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9877-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,13]]}}}