A p-adic condition on the weight of a codeword of a linear code

DOI10.1007/S10623-013-9863-YzbMATH Open1321.94118OpenAlexW2142890715MaRDI QIDQ2249654FDOQ2249654

Simeon Ball

Publication date: 3 July 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-013-9863-y

Recommendations

• A Bound for the Maximum Weight of a Linear Code
• On the code generated by the incidence matrix of points and hyperplanes in \(\text{PG}(n,q)\) and its dual
• On linear codes whose weights and length have a common divisor
• Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes
• Large weight code words in projective space codes

zbMATH Keywords

linear codesaffine blocking sets

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05)

Cites Work

• Title not available (Why is that?)
• Covering finite fields with cosets of subspaces
• The blocking number of an affine space
• A Bound for the Maximum Weight of a Linear Code
• Maximum distance<tex>q</tex>-nary codes
• On intersection sets in Desarguesian affine spaces
• Polynomial multiplicities over finite fields and intersection sets
• Covering all points except one
• Applications of finite fields to combinatorics and finite geometries
• On multiple nuclei and a conjecture of Lunelli and Sce
• On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces
• Title not available (Why is that?)

Cited In (2)

• A general construction for blocking sets in finite affine geometries
• Generalized weights and the Ball-Blokhuis congruence

This page was built for publication: A \(p\)-adic condition on the weight of a codeword of a linear code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249654)