This website uses cookies

We use cookies to enhance your experience and support COUNTER Metrics for transparent reporting of readership statistics. Cookie data is not sold to third parties or used for marketing purposes.

Skip to main content
Journal of High School Science
  • Menu
  • Articles
    • Case study
    • Original article
    • Review paper
    • Technical Note
    • All
  • For Authors
  • Editorial Board
  • About
  • Issues
  • Metrics
  • IRB
  • search
  • RSS feed (opens a modal with a link to feed)

RSS Feed

Enter the URL below into your favorite RSS reader.

http://localhost:53604/feed
ISSN 2575-6206
Review paper
Vol. 10, Issue 1, 2026January 15, 2026 CDT

Using impartial games and greedy algorithms to generate codes with fixed distance

Benjamin Yin, Noah Aydin, Ph.D,
Lexicographic codesGreedy codesImpartial gamesGilbert-Varshamov boundSprague-Grundy analysisGreedy algorithm
Copyright Logoccby-nc-sa-4.0 • https://doi.org/10.64336/001c.155366
Journal of High School Science
Yin, Benjamin, and Noah Aydin. 2026. “Using Impartial Games and Greedy Algorithms to Generate Codes with Fixed Distance.” Journal of High School Science 10 (1): 37–59. https:/​/​doi.org/​10.64336/​001c.155366.
Download all (1)
  • Peer-Review
    Download

Sorry, something went wrong. Please try again.

If this problem reoccurs, please contact Scholastica Support

Error message:

undefined

View more stats

Powered by Scholastica, the modern academic journal management system