http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
DIRECTED STRONGLY REGULAR GRAPHS AND THEIR CODES
Alahmadi, Adel,Alkenani, Ahmad,Kim, Jon-Lark,Shi, Minjia,Sole, Patrick Korean Mathematical Society 2017 대한수학회보 Vol.54 No.2
The rank over a finite field of the adjacency matrix of a directed strongly regular graph is studied, with some applications to the construction of linear codes. Three techniques are used: code orthogonality, adjacency matrix determinant, and adjacency matrix spectrum.
Directed strongly regular graphs and their codes
Adel Alahmadi,Ahmad Alkenani,김종락,Minjia Shi,Patrick Sole 대한수학회 2017 대한수학회보 Vol.54 No.2
The rank over a finite field of the adjacency matrix of a directed strongly regular graph is studied, with some applications to the construction of linear codes. Three techniques are used: code orthogonality, adjacency matrix determinant, and adjacency matrix spectrum.
Comparison of the Lee and homogenous weights over a family of chain rings
Adel Alahmadi,Ahmad Alkenani,Rahmah Alomari,Najat Muthana,Patrick Sole,Bahattin Yildiz 대한수학회 2018 대한수학회보 Vol.55 No.2
We compare the Lee and homogenous weights over the chain ring $S_{q,m}=\F_q[u]/(u^m)$ by computing the minimum distance of random codes for small values of $n,q,m.$
COMPARISON OF THE LEE AND HOMOGENOUS WEIGHTS OVER A FAMILY OF CHAIN RINGS
Alahmadi, Adel,Alkenani, Ahmad,Alomari, Rahmah,Muthana, Najat,Sole, Patrick,Yildiz, Bahattin Korean Mathematical Society 2018 대한수학회보 Vol.55 No.2
We compare the Lee and homogenous weights over the chain ring $S_{q,m}={\mathbb{F}}_q[u]/(u^m)$ by computing the minimum distance of random codes for small values of n, q, m.