Paper Review Records
全部论文审稿周期
30 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
171
天
New constructions of LRCs and qLRCs with good parameters from cyclic codes
作者
Sihem Mesnager; Yaozong Zhang; Dabin Zheng展开收起
作者单位
1. Department of Mathematics, University of Paris VIII, Saint-Denis, France; 2. Laboratory Analysis, Geometry and Applications, LAGA, University Sorbonne Paris Nord, CNRS, UMR7539, Villetaneuse, France; 3. Telecom Paris, Polytechnic Institute of Paris, Palaiseau, France; 4. School of Mathematical Sciences and LPMC, Nankai University, Tianjin, China; 5. Key Laboratory of Intelligent Sensing System and Security, Ministry of Education, Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University, Wuhan, China展开收起
188
天
222
天
On the optimal contrast of threshold visual cryptography schemes when all the shares are superimposed
作者
Hiroki Koga; Naoki Mitarai; Koutaro Morisawa展开收起
作者单位
1. Institute of Systems and Information Engineering, University of Tsukuba, Tsukuba, Japan; 2. Graduate School of Science and Technology, University of Tsukuba, Tsukuba, Japan; 3. Intelligent Wave Inc., Chuo-ku, Japan展开收起
267
天
Divisible design graphs from Higmanian association schemes
作者
Grigory Ryabov展开收起
作者单位
1. School of Mathematical Sciences, Hebei Key Laboratory of Computational Mathematics and Applications, Hebei Normal University, Shijiazhuang, People’s Republic of China; 2. Sobolev Institute of Mathematics, Novosibirsk, Russia; 3. Novosibirsk State Technical University, Novosibirsk, Russia展开收起
356
天
Module lattices and their shortest vectors
作者
Nihar Gargava; Vlad Serban; Maryna Viazovska; Ilaria Viglino展开收起
作者单位
1. Institut de Mathématiques d’Orsay, Université Paris-Saclay, Orsay, France; 2. Department of Mathematics, New College of Florida, Sarasota, USA; 3. Section of Mathematics, EPFL, Lausanne, Switzerland展开收起
204
天
Code distances: a new family of invariants of linear codes
作者
Eduardo Camps-Moreno; Elisa Gorla; Hiram H. López展开收起
作者单位
1. Department of Mathematics, Virginia Tech, Blacksburg, USA; 2. Institute of Mathematics of Bordeaux, Talence, France; 3. Department of Mathematics, University of Neuchatel, Neuchatel, Switzerland展开收起
FAQ
DESIGNS CODES AND CRYPTOGRAPHY审稿要多久?
截至2026-11-16,CrushSCI 收录了 DESIGNS CODES AND CRYPTOGRAPHY 的 30 篇完整审稿记录。最快一篇从收稿到录用用了 82 天(Cyclic codes and cyclically covering subspaces over finite fields,2026-07-02 收稿,2026-09-22 录用),最慢一篇用了 1035 天;平均 350.4 天,中位数 270 天。
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。
