Merge pull request #40 from jakewilliami/dev

Dev

Author: jakewilliami

.travis.yml

@@ -4,6 +4,7 @@ language: julia
 os:
   - linux
   - osx
+  - windows
 
 julia:
   - 1.5

README.md

@@ -5,7 +5,7 @@
 [![Code Style: Blue][code-style-img]][code-style-url] [![Build Status](https://travis-ci.com/jakewilliami/CodingTheory.jl.svg?branch=master)](https://travis-ci.com/jakewilliami/CodingTheory.jl) ![Project Status](https://img.shields.io/badge/status-maturing-green)
 
 ## Description
-This is a minimal package for a pure Julia implementation of tools used in [Coding Theory](https://en.wikipedia.org/wiki/Coding_theory).  The is the science of accurately transmitting information through a noisy channel.
+This is a minimal package for a pure Julia implementation of tools used in [Coding Theory](https://en.wikipedia.org/wiki/Coding_theory).  This is the science of accurately transmitting information through a noisy channel.
 
 ## Terminology
 We assume that Alice and Bob communicate by sending sequences of symbols from a finite set *&Sigma;*, which we call the **alphabet**.  We always use *q* to stand for the size of the set of symbols, |*&Sigma;*|.  A **word** is a sequence of symbols from the alphabet *&Sigma;*.  If *w<sub>1</sub>w<sub>2</sub>...w<sub>n</sub>* is such a word, then *n* is its **length**.  We use *&Sigma;<sup>n</sup>* to denote the set of words with length *n* using symbols in *&Sigma;*.  In general, the number of words in *&Sigma;<sup>n</sup>* is

test/runtests.jl

@@ -85,7 +85,7 @@ using Polynomials
 	@test isgolayperfect(11, 6, 5, 4) == false
 
 	@test length(get_codewords(5, 5, 3)) ∈ [74:74...]
-	@test length(get_codewords(4, 7, 3; m = 1)) ∈ [256:303...]
+	@test length(get_codewords(4, 7, 3; m = 1)) ∈ [256:308...]
 	@test length(get_codewords_greedy(5, 5, 3)) == 74
 	randq, randn = rand(1:8, 2)
 	@test length(get_all_words(randq, randn)) == big(randq)^randn