On strongly walk regular graphs, triple sum sets and their codes
From MaRDI portal
Publication:2698347
DOI10.1007/s10623-022-01118-zOpenAlexW3112602521WikidataQ122781707 ScholiaQ122781707MaRDI QIDQ2698347
Patrick Solé, Sascha Kurz, Alfred Wassermann, Michael Kiermaier, Michael Stoll
Publication date: 21 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.06160
Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Higher degree equations; Fermat's equation (11D41)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Binary divisible codes of maximum dimension
- Spectra of graphs
- On triple-sum-sets and two or three weights codes
- Constructing two-weight codes with prescribed groups of automorphisms
- Codes and projective multisets
- Divisible codes
- The Magma algebra system. I: The user language
- Strongly walk-regular graphs
- Three-weight codes over rings and strongly walk regular graphs
- Three-weight codes, triple sum sets, and strongly walk regular graphs
- Weights of linear codes and strongly regular normed spaces
- Implementing 2-descent for Jacobians of hyperelliptic curves
- GENERALIZED EXPLICIT DESCENT AND ITS APPLICATION TO CURVES OF GENUS 3
- On triply even binary codes
- The Mordell–Weil sieve: proving non-existence of rational points on curves
- A sextic surface cannot have 66 nodes
- Optimal Linear Codes From Matrix Groups
- The Geometry of Two-Weight Codes
- Restrictions on the weight distribution of binary linear codes imposed by the structure of Reed-Muller codes
- Some new results on the minimum length of binary linear codes of dimension nine
- Computer Classification of Linear Codes
- Power moment identities on weight distributions in error correcting codes
This page was built for publication: On strongly walk regular graphs, triple sum sets and their codes
