发布求助
文献互助 智能选刊 最新文献

Designs, Codes and Cryptography最新文献

筛选
英文 中文
Evaluation codes from linear systems of conics 二次曲线线性系统的求值代码
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2026-07-15 DOI: 10.1007/s10623-026-01901-2
Barbara Gatti, Gábor Korchmáros, Gioia Schulte
{"title":"Evaluation codes from linear systems of conics","authors":"Barbara Gatti, Gábor Korchmáros, Gioia Schulte","doi":"10.1007/s10623-026-01901-2","DOIUrl":"https://doi.org/10.1007/s10623-026-01901-2","url":null,"abstract":"The Datta–Johnsen code is an evaluation code where the linear combinations of elementary symmetric polynomials are evaluated on the set of all points with pairwise distinct coordinates in an affine space of dimension <jats:inline-formula> <jats:alternatives> <jats:tex-math>$$ge , 2$$</jats:tex-math> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mo>≥</mml:mo> <mml:mspace/> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> </jats:alternatives> </jats:inline-formula> over a finite field <jats:inline-formula> <jats:alternatives> <jats:tex-math>$$mathbb {F}_q$$</jats:tex-math> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:msub> <mml:mi>F</mml:mi> <mml:mi>q</mml:mi> </mml:msub> </mml:math> </jats:alternatives> </jats:inline-formula> . A generalization is obtained by taking a low dimensional linear system of symmetric polynomials. The odd characteristic case was the subject of a recent paper. Here, the even characteristic case is investigated.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"217 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148440856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On codes from split metacyclic groups 关于分裂元环组的代码
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2026-07-15 DOI: 10.1007/s10623-026-01870-6
Kirill Vedenev
{"title":"On codes from split metacyclic groups","authors":"Kirill Vedenev","doi":"10.1007/s10623-026-01870-6","DOIUrl":"https://doi.org/10.1007/s10623-026-01870-6","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"10 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148440859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Line-parallelisms of PG(n, 2) from Preparata-like codes 类prepare码中PG（n, 2）的行并行性
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2026-07-15 DOI: 10.1007/s10623-026-01905-y
Philipp Heering, Vladislav Taranchuk
{"title":"Line-parallelisms of PG(n, 2) from Preparata-like codes","authors":"Philipp Heering, Vladislav Taranchuk","doi":"10.1007/s10623-026-01905-y","DOIUrl":"https://doi.org/10.1007/s10623-026-01905-y","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"37 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148440855","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
$$mathbb {F}_2mathbb {F}_4$$-ACP of codes $$mathbb {F}_2mathbb {F}_4$$-ACP的代码
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2026-07-15 DOI: 10.1007/s10623-026-01902-1
Xiusheng Liu, Jie Liu
{"title":"$$mathbb {F}_2mathbb {F}_4$$-ACP of codes","authors":"Xiusheng Liu, Jie Liu","doi":"10.1007/s10623-026-01902-1","DOIUrl":"https://doi.org/10.1007/s10623-026-01902-1","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"31 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148440857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Hierarchical identity-based encryption with receiver selective opening security in the multi-challenge setting 基于身份的分层加密，在多挑战环境下具有接收者选择打开的安全性
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2026-07-14 DOI: 10.1007/s10623-026-01885-z
Zi-Yuan Liu, Masahiro Mambo, Raylin Tso, Yi-Fan Tseng
{"title":"Hierarchical identity-based encryption with receiver selective opening security in the multi-challenge setting","authors":"Zi-Yuan Liu, Masahiro Mambo, Raylin Tso, Yi-Fan Tseng","doi":"10.1007/s10623-026-01885-z","DOIUrl":"https://doi.org/10.1007/s10623-026-01885-z","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"10 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148432001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Strong existential unforgeability and BUFF securities of MPC-in-the-head signatures 头部mpc签名的强存在不可伪造性和BUFF安全性
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2026-07-09 DOI: 10.1007/s10623-026-01851-9
Mukul Kulkarni, Keita Xagawa
{"title":"Strong existential unforgeability and BUFF securities of MPC-in-the-head signatures","authors":"Mukul Kulkarni, Keita Xagawa","doi":"10.1007/s10623-026-01851-9","DOIUrl":"https://doi.org/10.1007/s10623-026-01851-9","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"12 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148408874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Quantum weighted algebraic geometry codes 量子加权代数几何代码
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2026-07-07 DOI: 10.1007/s10623-026-01898-8
Tanush Shaska
{"title":"Quantum weighted algebraic geometry codes","authors":"Tanush Shaska","doi":"10.1007/s10623-026-01898-8","DOIUrl":"https://doi.org/10.1007/s10623-026-01898-8","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"37 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148408875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Majority logic decoding of affine Grassmann codes over nonbinary fields 非二进制域上仿射格拉斯曼码的多数逻辑译码
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2026-07-07 DOI: 10.1007/s10623-026-01915-w
Fernando Piñero González, Prasant Singh, Rohit Yadav
{"title":"Majority logic decoding of affine Grassmann codes over nonbinary fields","authors":"Fernando Piñero González, Prasant Singh, Rohit Yadav","doi":"10.1007/s10623-026-01915-w","DOIUrl":"https://doi.org/10.1007/s10623-026-01915-w","url":null,"abstract":"In this article, we consider the decoding problem of affine Grassmann codes over nonbinary fields. We use matrices of different ranks to construct a large set consisting of parity checks of affine Grassmann codes, which are orthogonal with respect to some fixed coordinate. By leveraging the automorphism groups of these codes, we generate a set of orthogonal parity checks for each coordinate. Using these parity checks, we perform majority logic decoding to correct a large number of errors in affine Grassmann codes. The order of error correction capability and the complexity of this decoder for affine Grassmann codes are the same as those of the majority logic decoder for Grassmann codes proposed in [<xref ref-type=\"bibr\">4</xref>]. Ultimately, we provide an example of this decoder for the ternary affine Grassmann code <inline-formula><alternatives><mml:math><mml:mrow><mml:msup><mml:mi>C</mml:mi><mml:mi mathvariant=\"double-struck\">A</mml:mi></mml:msup><mml:mrow><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>4</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:mrow></mml:mrow></mml:math><tex-math>documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$${C^{mathbb A}(2,4)}$$end{document}</tex-math></alternatives></inline-formula>.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"17 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148612849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient universal cycle constructions for k-permutations via concatenation trees 通过连接树构造k-置换的有效通用循环
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2026-07-07 DOI: 10.1007/s10623-026-01880-4
Lingyu Diao, Zuling Chang, Shujie Wang
{"title":"Efficient universal cycle constructions for k-permutations via concatenation trees","authors":"Lingyu Diao, Zuling Chang, Shujie Wang","doi":"10.1007/s10623-026-01880-4","DOIUrl":"https://doi.org/10.1007/s10623-026-01880-4","url":null,"abstract":"A universal cycle for <italic>k</italic>-permutations is a periodic sequence in which every <italic>k</italic>-permutation of the <italic>n</italic>-set <inline-formula><alternatives><mml:math><mml:mrow><mml:mo stretchy=\"false\">{</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy=\"false\">}</mml:mo></mml:mrow></mml:math><tex-math>documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$${1,2,ldots ,n}$$end{document}</tex-math></alternatives></inline-formula> occurs exactly once within each period for all <inline-formula><alternatives><mml:math><mml:mrow><mml:mi>n</mml:mi><mml:mo>&gt;</mml:mo><mml:mi>k</mml:mi><mml:mo>≥</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:math><tex-math>documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$n&gt;kge 3$$end{document}</tex-math></alternatives></inline-formula>. In this paper, we present two efficient algorithms to construct universal cycles for <italic>k</italic>-permutations. These two algorithms are built upon a concatenation tree framework proposed by Sawada et al. (2024), and each algorithm can be used to construct a universal cycle for <italic>k</italic>-permutations in <italic>O</italic>(1)-amortized time per symbol using <italic>O</italic>(<italic>nk</italic>) space.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"12 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148552127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Steiner 3-designs as extensions 作为扩展的斯坦纳3设计
IF 1.6 2区 数学
Designs, Codes and Cryptography Pub Date : 2026-07-07 DOI: 10.1007/s10623-026-01888-w
Michael Kiermaier, Vedran Krčadinac, Alfred Wassermann
{"title":"Steiner 3-designs as extensions","authors":"Michael Kiermaier, Vedran Krčadinac, Alfred Wassermann","doi":"10.1007/s10623-026-01888-w","DOIUrl":"https://doi.org/10.1007/s10623-026-01888-w","url":null,"abstract":"In this article, we construct a Steiner system with the parameters <jats:italic>S</jats:italic> (3, 6, 42), settling one of the smallest open parameter sets of Steiner 3-designs. Furthermore, we establish the existence of rotational Steiner quadruple systems on 46 and 92 points. Our construction method is based on extending Steiner 2-designs using prescribed extension groups. We also consider extensions to designs of higher strength. The article includes a table and a discussion of the status of all admissible parameters for Steiner 3-designs on at most 50 points.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"78 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148408877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书