Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이윤진 | * |
dc.date.accessioned | 2023-02-27T16:30:03Z | - |
dc.date.available | 2023-02-27T16:30:03Z | - |
dc.date.issued | 2023 | * |
dc.identifier.issn | 1930-5346 | * |
dc.identifier.other | OAK-33000 | * |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/264643 | - |
dc.description.abstract | We characterize the connection between p-ary linear codes and Ramanujan Cayley graphs. We explicitly determine an equivalence between t-weight linear codes over the finite field Fp and Ramanujan Cayley graphs with t + 1 eigenvalues. In particular, we get an explicit criterion on the equivalence between two-weight linear codes and Ramanujan strongly regular graphs with explicit parameters. Using this characterization, we construct several families of Ramanujan Cayley graphs with two or three eigenvalues from known linear codes with two or three weights, respectively. © 2023, American Institute of Mathematical Sciences. All rights reserved. | * |
dc.language | English | * |
dc.publisher | American Institute of Mathematical Sciences | * |
dc.subject | Cayley graph | * |
dc.subject | linear code | * |
dc.subject | Ramanujan graph | * |
dc.subject | strongly regular graph | * |
dc.subject | two-weight code | * |
dc.subject | weakly regular bent function | * |
dc.title | CONNECTION OF p-ARY t-WEIGHT LINEAR CODES TO RAMANUJAN CAYLEY GRAPHS WITH t + 1 EIGENVALUES | * |
dc.type | Article | * |
dc.relation.issue | 2 | * |
dc.relation.volume | 17 | * |
dc.relation.index | SCIE | * |
dc.relation.index | SCOPUS | * |
dc.relation.startpage | 367 | * |
dc.relation.lastpage | 380 | * |
dc.relation.journaltitle | Advances in Mathematics of Communications | * |
dc.identifier.doi | 10.3934/amc.2020133 | * |
dc.identifier.scopusid | 2-s2.0-85146653366 | * |
dc.author.google | Hyun J.Y. | * |
dc.author.google | Lee Y. | * |
dc.author.google | Wu Y. | * |
dc.contributor.scopusid | 이윤진(23100337700) | * |
dc.date.modifydate | 20240123113558 | * |