default search action
Advances in Mathematics of Communications, Volume 12
Volume 12, Number 1, February 2018
- Yunwen Liu, Longjiang Qu, Chao Li:
New constructions of systematic authentication codes from three classes of cyclic codes. 1-16 - Sanjit Chatterjee, Chethan Kamath
, Vikas Kumar:
Private set-intersection with common set-up. 17-47 - JiYoon Jung, Carl Mummert, Elizabeth M. Niese, Michael Schroeder:
On erasure combinatorial batch codes. 49-65 - LiMengNan Zhou, Daiyuan Peng, Hongyu Han, Hongbin Liang, Zheng Ma:
Construction of optimal low-hit-zone frequency hopping sequence sets under periodic partial Hamming correlation. 67-79 - Johan Rosenkilde
Power decoding Reed-Solomon codes up to the Johnson radius. 81-106 - Karim Samei, Saadoun Mahmoudi:
Singleton bounds for R-additive codes. 107-114 - Sugata Gangopadhyay, Goutam Paul, Nishant Sinha, Pantelimon Stanica:
Generalized nonlinearity of S-boxes. 115-122 - Anuradha Sharma
Trace description and Hamming weights of irreducible constacyclic codes. 123-141 - Nazar Arakelian
On the spectrum for the genera of maximal curves over small fields. 143-149 - Carolyn Mayer, Kathryn Haymaker, Christine A. Kelley:
Channel decomposition for multilevel codes over multilevel and partial erasure channels. 151-168 - Joaquim Borges
On ℤprℤps-additive cyclic codes. 169-179 - Lenny Fukshansky
A new family of one-coincidence sets of sequences with dispersed elements for frequency hopping cdma systems. 181-188 - Adel Alahmadi, Cem Güneri, Hatoon Shohaib, Patrick Solé:
Long quasi-polycyclic t-CIS codes. 189-198 - Motahhareh Gharahi, Shahram Khazaei
Reduced access structures with four minimal qualified subsets on six participants. 199-214 - Jiarong Peng, Xiangyong Zeng, Zhimin Sun:
Finite length sequences with large nonlinear complexity. 215-230
Volume 12, Number 2, May 2018
- Yonglin Cao, Yuan Cao, Hai Q. Dinh, Fang-Wei Fu, Jian Gao, Songsak Sriboonchitta:
Constacyclic codes of length nps over 𝔽pm+u𝔽pm. 231-262 - Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Indiscreet logarithms in finite fields of small characteristic. 263-286 - Carla Mascia
Hilbert quasi-polynomial for order domains and application to coding theory. 287-301 - Yanfeng Qi, Chunming Tang, Zhengchun Zhou, Cuiling Fan:
Several infinite families of p-ary weakly regular bent functions. 303-315 - Kathryn Haymaker, Beth Malmskog, Gretchen L. Matthews
Locally recoverable codes with availability t≥2 from fiber products of curves. 317-336 - Joaquim Borges
Completely regular codes by concatenating Hamming codes. 337-349 - Guangzhou Chen
Further results on the existence of super-simple pairwise balanced designs with block sizes 3 and 4. 351-362 - Nigel Boston, Jing Hao:
The weight distribution of quasi-quadratic residue codes. 363-385 - Jingjun Bao:
New families of strictly optimal frequency hopping sequence sets. 387-413 - Yiwei Liu, Zihui Liu:
On some classes of codes with a few weights. 415-428
Volume 12, Number 3, August 2018
- Konstantinos A. Draziotis
Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme. 429-449 - Somphong Jitman
The average dimension of the Hermitian hull of constayclic codes over finite fields of square order. 451-463 - Gokhan Calis, Onur Ozan Koyluoglu:
Architecture-aware coding for distributed storage: Repairable block failure resilient codes. 465-503 - Ming Su, Arne Winterhof
Hamming correlation of higher order. 505-513 - Marco Calderini
A note on some algebraic trapdoors for block ciphers. 515-524 - Pinhui Ke, Yueqin Jiang, Zhixiong Chen:
On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation. 525-539 - Longye Wang, Gao Yuan Zhang, Hong Wen, Xiaoli Zeng:
An asymmetric ZCZ sequence set with inter-subset uncorrelated property and flexible ZCZ length. 541-552 - Delphine Boucher
A first step towards the skew duadic codes. 553-577 - Haode Yan, Hao Liu, Chengju Li, Shudi Yang:
Parameters of LCD BCH codes with two lengths. 579-594 - Otávio J. N. T. N. dos Santos, Emerson L. Monte Carmelo
A connection between sumsets and covering codes of a module. 595-605 - Dean Crnkovic
On self-orthogonal designs and codes related to Held's simple group. 607-628
Volume 12, Number 4, November 2018
- Bal Kishan Dass, Namita Sharma, Rashmi Verma:
Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces. 629-639 - Tingting Wu, Jian Gao, Yun Gao, Fang-Wei Fu:
ℤ2ℤ2ℤ4-additive cyclic codes. 641-657 - Alexis E. Almendras Valdebenito
On the dual codes of skew constacyclic codes. 659-679 - Yuebo Shen, Dongdong Jia, Gengsheng Zhang:
The results on optimal values of some combinatorial batch codes. 681-690 - Ayça Çesmelioglu
Bent and vectorial bent functions, partial difference sets, and strongly regular graphs. 691-705 - Kamil Otal, Ferruh Özbudak
Self-duality of generalized twisted Gabidulin codes. 707-721 - Amit Sharma
A class of skew-cyclic codes over ℤ4+uℤ4 with derivation. 723-739 - Gora Adj, Isaac Andrés Canales Martinez
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields. 741-759 - Zihui Liu, Dajian Liao:
Higher weights and near-MDR codes over chain rings. 761-772 - Hannes Bartz, Antonia Wachter-Zeh:
Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases. 773-804 - Zhixiong Chen, Vladimir Edemskiy
On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients. 805-816 - Daniel Heinlein, Sascha Kurz:
Binary subspace codes in small ambient spaces. 817-839
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-27 21:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: