Almost-disjoint coding and strongly saturated ideals

DOI10.1090/S0002-9939-05-07824-XMaRDI QIDQ4674776zbMATH OpenFDO

Authors Paul Larson

Publication date 18 May 2005

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

Martin's axiom

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Large cardinals (03E55) Continuum hypothesis and Martin's axiom (03E50)

Recommendations

• Solid codes and disjunctive domains
• Remark on coding in algebras with strong filtration
• Almost affinely disjoint subspaces and covering Grassmannian codes
• Coding theory and hyper BCK-algebras
• scientific article; zbMATH DE number 140079
• scientific article; zbMATH DE number 4057503
• scientific article; zbMATH DE number 870510
• Disjunctive ideals of almost distributive lattices
• Ideal codes over separable ring extensions
• Coding and strong coding in trace monoids

Cited in

(3)

• Computing separability elements for the sentence-ambient algebra of split ideal codes
• Almost disjoint families and diagonalizations of length continuum
• Solid codes and disjunctive domains

This page was built for publication: Almost-disjoint coding and strongly saturated ideals

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