{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T09:37:37Z","timestamp":1771234657212,"version":"3.50.1"},"reference-count":21,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2023,8,1]]},"DOI":"10.1587\/transfun.2022eal2074","type":"journal-article","created":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T22:10:50Z","timestamp":1675030250000},"page":"1062-1066","source":"Crossref","is-referenced-by-count":11,"title":["New Constructions of Sidon Spaces and Cyclic Subspace Codes"],"prefix":"10.1587","volume":"E106.A","author":[{"given":"Xue-Mei","family":"LIU","sequence":"first","affiliation":[{"name":"College of Sciences, Civil Aviation University of China"}]},{"given":"Tong","family":"SHI","sequence":"additional","affiliation":[{"name":"College of Sciences, Civil Aviation University of China"}]},{"given":"Min-Yao","family":"NIU","sequence":"additional","affiliation":[{"name":"School of Sciences, Beijing University of Posts and Telecommunications"}]},{"given":"Lin-Zhi","family":"SHEN","sequence":"additional","affiliation":[{"name":"College of Sciences, Civil Aviation University of China"}]},{"given":"You","family":"GAO","sequence":"additional","affiliation":[{"name":"College of Science, Tianjin Key Lab for Advanced Signal Processing, Civil Aviation University of China"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] T. Etzion and A. Vardy, \u201cError-correcting codes in projective space,\u201d IEEE Trans. Inf. Theory, vol.57, no.2, pp.1165-1173, Feb. 2011. 10.1109\/tit.2010.2095232","DOI":"10.1109\/TIT.2010.2095232"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] R. Koetter and F.R. Kschischang, \u201cCoding for errors and erasures in random network coding,\u201d IEEE Trans. Inf. Theory, vol.54, no.8, pp.3579-3591, Aug. 2008. 10.1109\/tit.2008.926449","DOI":"10.1109\/TIT.2008.926449"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] E. Ben-Sasson, T. Etzion, A. Gabizon, and N. Raviv, \u201cSubspace polynomials and cyclic subspace codes,\u201d IEEE Trans. Inf. Theory, vol.62, no.3, pp.1157-1165, March 2016. 10.1109\/tit.2016.2520479","DOI":"10.1109\/TIT.2016.2520479"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] R. Ahlswede, Ning Cai, S.-Y.R. Li, and R.W. Yeung, \u201cNetwork information flow,\u201d IEEE Trans. Inf. Theory, vol.46, no.4, pp.1204-1216, July 2000. 10.1109\/18.850663","DOI":"10.1109\/18.850663"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] B. Chen and H. Liu, \u201cConstructions of cyclic constant dimension codes,\u201d Des. Codes Cryptogr., vol.86, no.6, pp.1267-1279, July 2017. 10.1007\/s10623-017-0394-9","DOI":"10.1007\/s10623-017-0394-9"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] E. Ben-Sasson, S. Kopparty, and J. Radhakrishnan, \u201cSubspace polynomials and limits to list decoding of Reed-Solomon codes,\u201d IEEE Trans. Inf. Theory, vol.56, no.1, pp.113-120, Jan. 2010. 10.1109\/tit.2009.2034780","DOI":"10.1109\/TIT.2009.2034780"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] K. Otal and F. \u00d6zbudak, \u201cCyclic subspace codes via subspace polynomials,\u201d Des. Codes Cryptogr., vol.85, no.2, pp.191-204, Nov. 2016. 10.1007\/s10623-016-0297-1","DOI":"10.1007\/s10623-016-0297-1"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] R.M. Roth, N. Raviv, and I. Tamo, \u201cConstruction of Sidon spaces with applications to coding,\u201d IEEE Trans. Inf. Theory, vol.64, no.6, pp.4412-4422, June 2018. 10.1109\/tit.2017.2766178","DOI":"10.1109\/TIT.2017.2766178"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Y. Niu, Q. Yue, and Y. Wu, \u201cSeveral kinds of large cyclic subspace codes via Sidon spaces,\u201d Discrete Math., vol.343, no.5, 111788, May 2020. 10.1016\/j.disc.2019.111788","DOI":"10.1016\/j.disc.2019.111788"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] T. Feng and Y. Wang, \u201cNew constructions of large cyclic subspace codes and Sidon spaces,\u201d Discrete Math, vol.344, no.4, 112273, April 2021. 10.1016\/j.disc.2020.112273","DOI":"10.1016\/j.disc.2020.112273"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] C. Bachoc, O. Serra, and G. Zemor, \u201cAn analogue of Vosper's theorem for extension fields,\u201d Math. Proc. Cambridge Philos. Soc., vol.163, no.3, pp.423-452, Nov. 2017. 10.1017\/s0305004117000044","DOI":"10.1017\/S0305004117000044"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] H. Gluesing-Luerssen, K. Morrison, and C. Troha, \u201cCyclic orbit codes and stabilizer subfields,\u201d Adv. Math. Commun., vol.9, no.2, pp.177-197, May 2015. 10.3934\/amc.2015.9.177","DOI":"10.3934\/amc.2015.9.177"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] H. Gluesing-Luerssen and H. Lehmann, \u201cDistance distributions of cyclic orbit codes,\u201d Des. Codes Cryptogr., vol.89, no.3, pp.447-470, Jan.2021. 10.1007\/s10623-020-00823-x","DOI":"10.1007\/s10623-020-00823-x"},{"key":"14","unstructured":"[14] Y. Li and H. Liu, \u201cCyclic subspace codes via the sum of Sidon spaces,\u201d arXiv: 2105.12520v1 [cs.IT], 2021. 10.48550\/arXiv.2105.12520"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] A. Trautmann, F. Manganiello, M. Braun, and J. Rosenthal, \u201cCyclic orbit codes,\u201d IEEE Trans. Inf. Theory, vol.59, no.11, pp.7386-7404, Nov. 2013. 10.1109\/tit.2013.2274266","DOI":"10.1109\/TIT.2013.2274266"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] E. Gabidulin, N. Pilipchuk, and M. Bossert, \u201cDecoding of random network codes,\u201d Probl. Inf. Transm., vol.46, no.4, pp.300-320, Jan. 2010. 10.1134\/s0032946010040034","DOI":"10.1134\/S0032946010040034"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] H. Zhang and X. Cao, \u201cConstructions of Sidon spaces and cyclic subspace codes,\u201d Front. Math. China, vol.17, pp.275-288, May 2022. 10.1007\/s11464-022-1011-4","DOI":"10.1007\/s11464-022-1011-4"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] Y. Gao and G. Wang, \u201cError-correcting codes in attenuated space over finite fields,\u201d Finite Fields Appl., vol.33, pp.103-117, May 2015. 10.1016\/j.ffa.2014.12.004","DOI":"10.1016\/j.ffa.2014.12.004"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] M. Braun, \u201cConstruction of linear codes with large minimum distance,\u201d IEEE Trans. Inf. Theory, vol.50, no.8, pp.1687-1691, Aug. 2004. 10.1109\/tit.2004.831742","DOI":"10.1109\/TIT.2004.831742"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] W. Zhao and X. Tang, \u201cA characterization of cyclic subspace codes via subspace polynomials,\u201d Finite Fields Appl., vol.57, pp.1-12, May 2019. 10.1016\/j.ffa.2019.01.002","DOI":"10.1016\/j.ffa.2019.01.002"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] G. Wang, M. Niu, and F. Fu, \u201cDeterministic construction of compressed sensing matrices from constant dimension codes,\u201d Discrete Appl. Math., vol.285, pp.9-17, Oct. 2020. 10.1016\/j.dam.2020.04.032","DOI":"10.1016\/j.dam.2020.04.032"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/8\/E106.A_2022EAL2074\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T04:04:02Z","timestamp":1691208242000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/8\/E106.A_2022EAL2074\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,1]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2022eal2074","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,1]]},"article-number":"2022EAL2074"}}