{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:48Z","timestamp":1772283588798,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the field reduction of finite geometries and we show that these families contain the non-linear maximum rank distance codes recently provided by Cossidente, Marino and Pavese.<\/jats:p>","DOI":"10.37236\/6106","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:55:03Z","timestamp":1578671703000},"source":"Crossref","is-referenced-by-count":16,"title":["Non-Linear Maximum Rank Distance Codes in the Cyclic Model for the Field Reduction of Finite Geometries"],"prefix":"10.37236","volume":"24","author":[{"given":"Nicola","family":"Durante","sequence":"first","affiliation":[]},{"given":"Alessandro","family":"Siciliano","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2017,6,2]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i2p33\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i2p33\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:56:54Z","timestamp":1579237014000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i2p33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,2]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2017,4,13]]}},"URL":"https:\/\/doi.org\/10.37236\/6106","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,2]]},"article-number":"P2.33"}}