| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A class of twisted generalized Reed–Solomon codes
|
Zhang, Jun
|
|
|
90 |
7 |
p. 1649-1658
|
article
|
| 2 |
A method of constructing 2-resolvable t-designs for t=3,4
|
van Trung, Tran
|
|
|
90 |
7 |
p. 1567-1583
|
article
|
| 3 |
Book Review: “Designs from Linear Codes”, second edition, by Cunsheng Ding and Chunming Tang, World Scientific, 2022
|
Tonchev, Vladimir D.
|
|
|
90 |
7 |
p. 1595-1597
|
article
|
| 4 |
Classification of permutation polynomials of the form x3g(xq-1) of Fq2 where g(x)=x3+bx+c and b,c∈Fq∗
|
Özbudak, Ferruh
|
|
|
90 |
7 |
p. 1537-1556
|
article
|
| 5 |
Large sets of t-designs over finite fields exist for all t
|
Bao, Jingjun
|
|
|
90 |
7 |
p. 1599-1609
|
article
|
| 6 |
Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes
|
Li, Xia
|
|
|
90 |
7 |
p. 1629-1647
|
article
|
| 7 |
Reversible Gk-codes with applications to DNA codes
|
Korban, Adrian
|
|
|
90 |
7 |
p. 1679-1694
|
article
|
| 8 |
Switching for 2-designs
|
Crnković, Dean
|
|
|
90 |
7 |
p. 1585-1593
|
article
|
| 9 |
The equivalence of linear codes implies semi-linear equivalence
|
Ball, Simeon
|
|
|
90 |
7 |
p. 1557-1565
|
article
|
| 10 |
The existence of cyclic (v, 4, 1)-designs
|
Zhang, Menglong
|
|
|
90 |
7 |
p. 1611-1628
|
article
|
| 11 |
Using permutation rational functions to obtain permutation arrays with large hamming distance
|
Bereg, Sergey
|
|
|
90 |
7 |
p. 1659-1677
|
article
|
Journal description