Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes

Using multi-orbit cyclic subspace codes for constructing optical orthogonal 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 Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes Ferruh Ozbudak, Paolo Santonastaso, Ferdinando Zullo This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4495510/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 23 Jan, 2025 Read the published version in Cryptography and Communications → Version 1 posted 9 You are reading this latest preprint version Abstract We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches using combinatorial and additive (character sum) structures of finite fields. Consequently, we immediately obtain new classes of optical orthogonal codes with different parameters. MSC2020: 94B60; 11T30; 11T71 optical orthogonal code cyclic subspace code linearized polynomial Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 23 Jan, 2025 Read the published version in Cryptography and Communications → Version 1 posted Editorial decision: Revision requested 02 Dec, 2024 Reviews received at journal 02 Dec, 2024 Reviews received at journal 15 Jul, 2024 Reviewers agreed at journal 28 Jun, 2024 Reviewers agreed at journal 11 Jun, 2024 Reviewers invited by journal 05 Jun, 2024 Editor assigned by journal 31 May, 2024 Submission checks completed at journal 29 May, 2024 First submitted to journal 29 May, 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-4495510","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":313362876,"identity":"144d3f9e-fbfa-4a90-9569-3e57eac2baad","order_by":0,"name":"Ferruh Ozbudak","email":"","orcid":"","institution":"Sabancı University","correspondingAuthor":false,"prefix":"","firstName":"Ferruh","middleName":"","lastName":"Ozbudak","suffix":""},{"id":313362877,"identity":"3e2612ed-d7ff-4ddd-99c2-1235023db1fe","order_by":1,"name":"Paolo Santonastaso","email":"","orcid":"","institution":"University of Campania \"Luigi Vanvitelli\"","correspondingAuthor":false,"prefix":"","firstName":"Paolo","middleName":"","lastName":"Santonastaso","suffix":""},{"id":313362878,"identity":"07d40930-500a-4a7b-80af-4494d93e3286","order_by":2,"name":"Ferdinando Zullo","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABNUlEQVRIie3RsUrEMBjA8a8Uekuxa26prxAJSAfRV2k4OJezHHQRFKwE6uLdrCj4CgfC4dhSuC59gEhcDsHphoIgFQ4xORBa20E3kfyHEJr8SNsA6HR/sF4EgHw1S9Qw9sD5mgMYchG3iJ00CEbQj5qkZTYE6gQnzR1t0pss+fJhP9jKI/PVxsgl/ChNqtN54Nyw8xLG6xaxc+LRYhD2iwSIJGSXB356uRAhekoZ6nixAzS0EI1NOuM+DCShcz7CGViCRpxGXcTeflHkbEMyRe6vFPkQ9I5TVnURZCmSKWIwRWZIEiMW8gmNO0+xh6ZH45xeFykzbuW3oGKF08lUhDuSeD4m7T+2MB7f4xM6zVlWro73XOdiRMrqTQQuP3zm5dr9Tmqpi6vl18Yf9qvNOp1O96/7BM86dVUpFmpiAAAAAElFTkSuQmCC","orcid":"","institution":"University of Campania \"Luigi Vanvitelli\"","correspondingAuthor":true,"prefix":"","firstName":"Ferdinando","middleName":"","lastName":"Zullo","suffix":""}],"badges":[],"createdAt":"2024-05-29 08:34:45","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4495510/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4495510/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s12095-025-00777-8","type":"published","date":"2025-01-23T15:57:05+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":74858506,"identity":"7ee75bb5-1d6b-4ab2-afcd-7c0ae0359e3a","added_by":"auto","created_at":"2025-01-27 16:10:29","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":218755,"visible":true,"origin":"","legend":"","description":"","filename":"ezyzip.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4495510/v1_covered_a089f927-537e-4d9f-8051-98be154b66ed.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Using multi-orbit cyclic subspace codes for constructing optical orthogonal 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":"optical orthogonal code, cyclic subspace code, linearized polynomial","lastPublishedDoi":"10.21203/rs.3.rs-4495510/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4495510/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eWe present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches using combinatorial and additive (character sum) structures of finite fields. Consequently, we immediately obtain new classes of optical orthogonal codes with different parameters.\u003c/p\u003e\n\u003cp\u003eMSC2020: 94B60; 11T30; 11T71\u003c/p\u003e","manuscriptTitle":"Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-06-12 18:07:18","doi":"10.21203/rs.3.rs-4495510/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2024-12-02T09:38:33+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-12-02T07:08:13+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-07-15T08:53:46+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"287838472401166696202278983786471191446","date":"2024-06-29T01:43:18+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"218117445025318200066439554357289477430","date":"2024-06-12T02:20:36+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2024-06-05T14:27:03+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-05-31T05:10:03+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-05-30T03:38:50+00:00","index":"","fulltext":""},{"type":"submitted","content":"Cryptography and Communications","date":"2024-05-29T08:33:21+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":"84123668-2f98-4282-a0f8-0ae52889025d","owner":[],"postedDate":"June 12th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2025-01-27T16:04:10+00:00","versionOfRecord":{"articleIdentity":"rs-4495510","link":"https://doi.org/10.1007/s12095-025-00777-8","journal":{"identity":"cryptography-and-communications","isVorOnly":false,"title":"Cryptography and Communications"},"publishedOn":"2025-01-23 15:57:05","publishedOnDateReadable":"January 23rd, 2025"},"versionCreatedAt":"2024-06-12 18:07:18","video":"","vorDoi":"10.1007/s12095-025-00777-8","vorDoiUrl":"https://doi.org/10.1007/s12095-025-00777-8","workflowStages":[]},"version":"v1","identity":"rs-4495510","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4495510","identity":"rs-4495510","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}