Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Combinatorial properties of codes with degree \(n\)

From MaRDI portal
Publication:1395008
Jump to:navigation, search

DOI10.1016/S0195-6698(03)00016-7zbMath1029.94014MaRDI QIDQ1395008

Hong-Fen Zheng, Liang Zhang, Kar Ping Shum

Publication date: 26 June 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)


zbMATH Keywords

synchronizing codesmaximal prefix codesdegrees of codesSuschkewitch groupsvery thin codes


Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Synchronization error-correcting codes (94B50)


Related Items

Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs



Cites Work

  • Unnamed Item
  • Unnamed Item
  • On group codes
  • Decompositions of recognizable strong maximal codes
  • On completion of codes with finite deciphering delay
  • Rational strong codes and structure of rational group languages
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1395008&oldid=13549444"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki