A new construction of cyclic subspace codes

A new construction of cyclic subspace codes | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article A new construction of cyclic subspace codes Yuqing Han, Xiwang Cao This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-3908812/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 13 Aug, 2024 Read the published version in Cryptography and Communications → Version 1 posted 9 You are reading this latest preprint version Abstract Subspace codes have attracted a lot of attention in the last few decades due to their applications innoncoherent linear network coding, in particular cyclic subspace codes can be encoded and decoded moreefficiently because of their special algebraic structure. Using the union of several cyclic subspace codes, wepresent a family of cyclic subspace codes with minimum distance 2k − 2 and size seqk(qk − 1)s−1(qn − 1), where k|n, n/k ≥ 2s + 1, s ≥ 2, e = ⌈n/2sk⌉ − 1. Constant dimension codes subspace codes Sidon spaces Random network coding Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 13 Aug, 2024 Read the published version in Cryptography and Communications → Version 1 posted Editorial decision: Revision requested 15 Jun, 2024 Reviews received at journal 13 Jun, 2024 Reviews received at journal 01 May, 2024 Reviewers agreed at journal 09 Feb, 2024 Reviewers agreed at journal 09 Feb, 2024 Reviewers invited by journal 08 Feb, 2024 Editor assigned by journal 01 Feb, 2024 Submission checks completed at journal 31 Jan, 2024 First submitted to journal 29 Jan, 2024 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-3908812","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":270489665,"identity":"f6fd481a-3621-4891-bb73-a4f7c24e026a","order_by":0,"name":"Yuqing Han","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA0ElEQVRIiWNgGAWjYBACgwMMDMw8DBJ29u3NBw58+EG8FotkA55jiQdn9hCphXEGQwXjBokc48McbMRoOX72AMPHNglmc4acD4cZeBjk+cUO4NdifyYvgSGxTYLPsuHshsMFFgyGM2cnEHJYjgFICzPDwd4Nh2fwMCQY3Cak5fwbsBbGhsM8Dw7zsBGj5QbEFsYNx3gYiNUCtCXhnESyZA+bATCQJYjwy3mgLQlldXb88o8ff/jww0aeX5qAFiBgR45yCYLKR8EoGAWjYBQQAQCzQUe66uWOSwAAAABJRU5ErkJggg==","orcid":"","institution":"Nanjing University of Aeronautics and Astronautics","correspondingAuthor":true,"prefix":"","firstName":"Yuqing","middleName":"","lastName":"Han","suffix":""},{"id":270489666,"identity":"0db83254-1c86-41db-9e84-0263f9820324","order_by":1,"name":"Xiwang Cao","email":"","orcid":"","institution":"Nanjing University of Aeronautics and Astronautics","correspondingAuthor":false,"prefix":"","firstName":"Xiwang","middleName":"","lastName":"Cao","suffix":""}],"badges":[],"createdAt":"2024-01-29 11:44:20","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-3908812/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-3908812/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s12095-024-00735-w","type":"published","date":"2024-08-13T15:58:16+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":63071255,"identity":"a4b75b5e-676a-4bae-8871-99c3a3ff35e6","added_by":"auto","created_at":"2024-08-22 20:05:30","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":268283,"visible":true,"origin":"","legend":"","description":"","filename":"Anewconstructionofcyclicsubspacecodes.pdf","url":"https://assets-eu.researchsquare.com/files/rs-3908812/v1_covered_3bd2da25-19b0-441e-8625-aa583b5f0ed9.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"A new construction of cyclic subspace codes","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"cryptography-and-communications","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"ccds","sideBox":"Learn more about [Cryptography and Communications](http://link.springer.com/journal/12095)","snPcode":"12095","submissionUrl":"https://submission.nature.com/new-submission/12095/3","title":"Cryptography and Communications","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Constant dimension codes, subspace codes, Sidon spaces, Random network coding","lastPublishedDoi":"10.21203/rs.3.rs-3908812/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-3908812/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Subspace codes have attracted a lot of attention in the last few decades due to their applications innoncoherent linear network coding, in particular cyclic subspace codes can be encoded and decoded moreefficiently because of their special algebraic structure. Using the union of several cyclic subspace codes, wepresent a family of cyclic subspace codes with minimum distance 2k − 2 and size seqk(qk − 1)s−1(qn − 1), where k|n, n/k ≥ 2s + 1, s ≥ 2, e = ⌈n/2sk⌉ − 1. ","manuscriptTitle":"A new construction of cyclic subspace codes","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-02-02 03:47:23","doi":"10.21203/rs.3.rs-3908812/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2024-06-15T08:40:03+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-06-13T16:24:53+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-05-01T10:28:32+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"4d90eccb-a5b8-43b1-8aba-d3349990c821","date":"2024-02-09T11:50:42+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"3c872590-ed9e-4d11-a5a7-6725215c8bd0","date":"2024-02-09T07:33:00+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2024-02-08T16:55:48+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-02-01T15:41:49+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-01-31T10:21:29+00:00","index":"","fulltext":""},{"type":"submitted","content":"Cryptography and Communications","date":"2024-01-29T11:41:39+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"cryptography-and-communications","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"ccds","sideBox":"Learn more about [Cryptography and Communications](http://link.springer.com/journal/12095)","snPcode":"12095","submissionUrl":"https://submission.nature.com/new-submission/12095/3","title":"Cryptography and Communications","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"49afb442-9aa1-4073-a269-4b17cdc17091","owner":[],"postedDate":"February 2nd, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2024-08-22T19:35:22+00:00","versionOfRecord":{"articleIdentity":"rs-3908812","link":"https://doi.org/10.1007/s12095-024-00735-w","journal":{"identity":"cryptography-and-communications","isVorOnly":false,"title":"Cryptography and Communications"},"publishedOn":"2024-08-13 15:58:16","publishedOnDateReadable":"August 13th, 2024"},"versionCreatedAt":"2024-02-02 03:47:23","video":"","vorDoi":"10.1007/s12095-024-00735-w","vorDoiUrl":"https://doi.org/10.1007/s12095-024-00735-w","workflowStages":[]},"version":"v1","identity":"rs-3908812","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-3908812","identity":"rs-3908812","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}