diff --git a/argmax.m b/argmax.m
index 740bd40286e42f3d602222ffeec7fce94b78b70b..252bc10a3d0f89410d7414d7fad75dcd737a38bf 100644
--- a/argmax.m
+++ b/argmax.m
@@ -1,4 +1,7 @@
 function j = argmax(L)
 % ARGMAX Index j of the maximum value in L.
+%
+% Authors:
+% L. Sun, S. Suvorova, and the Uni. Melbourne group (2016)
  
-[~,j] = max(L);
\ No newline at end of file
+[~,j] = max(L);
diff --git a/binaryfilter.m b/binaryfilter.m
index 0e9fb9182b38bcece2f8606354ffa0d10b3a495a..f170b73b501103ade45aaaefac1e2b35aca7f5c6 100644
--- a/binaryfilter.m
+++ b/binaryfilter.m
@@ -18,6 +18,9 @@ function [b,h] = binaryfilter(f,f0,P,a0)
 % Output:
 %     b  - Bessel-weighted matched filter
 %     h  - Comb matched filter (not used in the current search)
+%
+% Authors:
+% L. Sun, S. Suvorova, and the Uni. Melbourne group (2016)
 
 c = 2*pi*a0*f0;
 % Take a wider range [-N N] for calculation (100 is a random extended width for c)
diff --git a/readfstats.m b/readfstats.m
index 268e5268c49d6e61b649be01be13e3bc6b07f016..369b9de800d2c668cb79994c7e510855a70a2614 100644
--- a/readfstats.m
+++ b/readfstats.m
@@ -19,6 +19,9 @@ function [f, X, N, T] = readfstats(dirName, bandIdx, steps)
 %     X         - F-stat values
 %     N         - Total number of bins
 %     T         - Total number of steps
+%
+% Authors:
+% L. Sun, S. Suvorova, and the Uni. Melbourne group (2016)
 
 X = [];
 for n = 1:steps
diff --git a/run_search.m b/run_search.m
index a72c4751410a3be28c4ffde24d1c9fff1c548c6f..8138250e035e716bd213275099b828d767ffe203 100644
--- a/run_search.m
+++ b/run_search.m
@@ -24,6 +24,9 @@ function run_search(bandIdx,bandOffset,fstatdir,outfile,a0median,a0uncert,a0delt
 %
 % Output:
 %     Save results to the specified output file.
+%
+% Authors:
+% L. Sun, S. Suvorova, and the Uni. Melbourne group (2016)
 
 format long g
 
diff --git a/viterbi_colFLT.m b/viterbi_colFLT.m
index 7d52b0c115403be92e2220380dcbf9d58038c959..5893670bd577b1fb64f105c82c9aab4bc5122923 100644
--- a/viterbi_colFLT.m
+++ b/viterbi_colFLT.m
@@ -16,7 +16,10 @@ function [path,delta,psi,score] = viterbi_colFLT(M, obslik)
 %                  and then go to state j
 %     psi(j,t)   - The best predecessor state, given that it ends up in state j at t
 %     score      - Number of standard deviations above the mean value of log 
-%                  likelihood of paths to all the states at the final step       
+%                  likelihood of paths to all the states at the final step
+%
+% Authors:
+% L. Sun, S. Suvorova, and the Uni. Melbourne group (2016)
 
 % If M is even, increase M by 1
 if round(M/2)==M/2